About the Execution of LTSMin+red for ASLink-PT-06a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1707.188 | 3600000.00 | 10083241.00 | 3888.00 | F??FFTFT?F?TFFFF | normal |
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.r464-smll-171620117800091.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 ASLink-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117800091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 597K 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 ASLink-PT-06a-LTLCardinality-00
FORMULA_NAME ASLink-PT-06a-LTLCardinality-01
FORMULA_NAME ASLink-PT-06a-LTLCardinality-02
FORMULA_NAME ASLink-PT-06a-LTLCardinality-03
FORMULA_NAME ASLink-PT-06a-LTLCardinality-04
FORMULA_NAME ASLink-PT-06a-LTLCardinality-05
FORMULA_NAME ASLink-PT-06a-LTLCardinality-06
FORMULA_NAME ASLink-PT-06a-LTLCardinality-07
FORMULA_NAME ASLink-PT-06a-LTLCardinality-08
FORMULA_NAME ASLink-PT-06a-LTLCardinality-09
FORMULA_NAME ASLink-PT-06a-LTLCardinality-10
FORMULA_NAME ASLink-PT-06a-LTLCardinality-11
FORMULA_NAME ASLink-PT-06a-LTLCardinality-12
FORMULA_NAME ASLink-PT-06a-LTLCardinality-13
FORMULA_NAME ASLink-PT-06a-LTLCardinality-14
FORMULA_NAME ASLink-PT-06a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717204935324
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:22:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 01:22:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:22:17] [INFO ] Load time of PNML (sax parser for PT used): 411 ms
[2024-06-01 01:22:17] [INFO ] Transformed 1406 places.
[2024-06-01 01:22:17] [INFO ] Transformed 2100 transitions.
[2024-06-01 01:22:17] [INFO ] Found NUPN structural information;
[2024-06-01 01:22:17] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 595 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
FORMULA ASLink-PT-06a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 1370 transition count 2078
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 1359 transition count 2029
Ensure Unique test removed 1 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 1358 transition count 2029
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 1358 transition count 2027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1357 transition count 2019
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1357 transition count 2019
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1356 transition count 2011
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1356 transition count 2011
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1355 transition count 2003
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1355 transition count 2003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1354 transition count 1995
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1354 transition count 1995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1353 transition count 1987
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1353 transition count 1987
Applied a total of 71 rules in 995 ms. Remains 1353 /1406 variables (removed 53) and now considering 1987/2078 (removed 91) transitions.
// Phase 1: matrix 1987 rows 1353 cols
[2024-06-01 01:22:19] [INFO ] Computed 233 invariants in 153 ms
[2024-06-01 01:22:21] [INFO ] Implicit Places using invariants in 2124 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 596, 597, 615, 633, 762, 778, 783, 784, 785, 803, 821, 966, 971, 973, 991, 1009, 1138, 1143, 1155, 1160, 1161, 1162, 1191, 1193, 1196, 1214, 1215, 1216, 1217, 1234, 1242, 1250, 1256, 1262, 1268, 1274, 1282, 1288, 1294, 1302]
Discarding 63 places :
Implicit Place search using SMT only with invariants took 2184 ms to find 63 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1290/1406 places, 1987/2078 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1277 transition count 1974
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1277 transition count 1974
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1267 transition count 1964
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1267 transition count 1964
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1262 transition count 1959
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1262 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1260 transition count 1957
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1260 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1258 transition count 1955
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1258 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1257 transition count 1954
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1257 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1256 transition count 1953
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1256 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1255 transition count 1952
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1255 transition count 1952
Applied a total of 70 rules in 414 ms. Remains 1255 /1290 variables (removed 35) and now considering 1952/1987 (removed 35) transitions.
// Phase 1: matrix 1952 rows 1255 cols
[2024-06-01 01:22:21] [INFO ] Computed 170 invariants in 80 ms
[2024-06-01 01:22:22] [INFO ] Implicit Places using invariants in 1219 ms returned []
[2024-06-01 01:22:22] [INFO ] Invariant cache hit.
[2024-06-01 01:22:26] [INFO ] Implicit Places using invariants and state equation in 4049 ms returned []
Implicit Place search using SMT with State Equation took 5272 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1255/1406 places, 1952/2078 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8893 ms. Remains : 1255/1406 places, 1952/2078 transitions.
Support contains 34 out of 1255 places after structural reductions.
[2024-06-01 01:22:27] [INFO ] Flatten gal took : 259 ms
[2024-06-01 01:22:27] [INFO ] Flatten gal took : 163 ms
[2024-06-01 01:22:27] [INFO ] Input system was already deterministic with 1952 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (212 resets) in 2321 ms. (17 steps per ms) remains 9/17 properties
BEST_FIRST walk for 40003 steps (27 resets) in 292 ms. (136 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (30 resets) in 224 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (29 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (27 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (27 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (29 resets) in 131 ms. (303 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (27 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (31 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (24 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
[2024-06-01 01:22:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 221/238 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 275/513 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 723/1236 variables, 125/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1236 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 19/1255 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1255 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1952/3207 variables, 1255/1425 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3207 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/3207 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3207/3207 variables, and 1425 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3328 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 132/132 constraints, State Equation: 1255/1255 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 221/238 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 275/513 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 01:22:33] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 723/1236 variables, 125/164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1236 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 19/1255 variables, 7/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1255 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1952/3207 variables, 1255/1426 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3207/3207 variables, and 1434 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 132/132 constraints, State Equation: 1255/1255 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 8424ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1952/1952 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 1255 transition count 1722
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 1025 transition count 1719
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 466 place count 1022 transition count 1719
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 466 place count 1022 transition count 1565
Deduced a syphon composed of 154 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 826 place count 816 transition count 1565
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 20 rules applied. Total rules applied 846 place count 805 transition count 1556
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 855 place count 796 transition count 1556
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 855 place count 796 transition count 1540
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 887 place count 780 transition count 1540
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 893 place count 774 transition count 1527
Iterating global reduction 5 with 6 rules applied. Total rules applied 899 place count 774 transition count 1527
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 903 place count 774 transition count 1523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 904 place count 773 transition count 1523
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 904 place count 773 transition count 1522
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 906 place count 772 transition count 1522
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 907 place count 771 transition count 1514
Iterating global reduction 7 with 1 rules applied. Total rules applied 908 place count 771 transition count 1514
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 909 place count 770 transition count 1506
Iterating global reduction 7 with 1 rules applied. Total rules applied 910 place count 770 transition count 1506
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 911 place count 769 transition count 1498
Iterating global reduction 7 with 1 rules applied. Total rules applied 912 place count 769 transition count 1498
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 913 place count 768 transition count 1490
Iterating global reduction 7 with 1 rules applied. Total rules applied 914 place count 768 transition count 1490
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 915 place count 767 transition count 1482
Iterating global reduction 7 with 1 rules applied. Total rules applied 916 place count 767 transition count 1482
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 917 place count 766 transition count 1474
Iterating global reduction 7 with 1 rules applied. Total rules applied 918 place count 766 transition count 1474
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 919 place count 765 transition count 1466
Iterating global reduction 7 with 1 rules applied. Total rules applied 920 place count 765 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 921 place count 764 transition count 1458
Iterating global reduction 7 with 1 rules applied. Total rules applied 922 place count 764 transition count 1458
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 923 place count 763 transition count 1450
Iterating global reduction 7 with 1 rules applied. Total rules applied 924 place count 763 transition count 1450
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 925 place count 762 transition count 1442
Iterating global reduction 7 with 1 rules applied. Total rules applied 926 place count 762 transition count 1442
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 7 with 140 rules applied. Total rules applied 1066 place count 692 transition count 1372
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1072 place count 692 transition count 1366
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1078 place count 686 transition count 1366
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 8 with 30 rules applied. Total rules applied 1108 place count 686 transition count 1336
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 1139 place count 655 transition count 1336
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1143 place count 655 transition count 1332
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 1161 place count 655 transition count 1332
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1163 place count 655 transition count 1332
Applied a total of 1163 rules in 1056 ms. Remains 655 /1255 variables (removed 600) and now considering 1332/1952 (removed 620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1056 ms. Remains : 655/1255 places, 1332/1952 transitions.
RANDOM walk for 40000 steps (492 resets) in 746 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (93 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (93 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (75 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (86 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (88 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (85 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (94 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (89 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 167618 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :2 out of 8
Probabilistic random walk after 167618 steps, saw 73174 distinct states, run finished after 3013 ms. (steps per millisecond=55 ) properties seen :2
// Phase 1: matrix 1332 rows 655 cols
[2024-06-01 01:22:42] [INFO ] Computed 106 invariants in 15 ms
[2024-06-01 01:22:42] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 148/161 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 65/226 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 396/622 variables, 71/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 33/655 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1332/1987 variables, 655/761 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1987 variables, 31/792 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1987 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1987 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1987/1987 variables, and 792 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 655/655 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 148/161 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 65/226 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 01:22:44] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 396/622 variables, 71/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 33/655 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1332/1987 variables, 655/762 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1987 variables, 31/793 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1987 variables, 6/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1987 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1987 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1987/1987 variables, and 799 constraints, problems are : Problem set: 0 solved, 6 unsolved in 24530 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 76/76 constraints, State Equation: 655/655 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 26060ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 1 properties in 35334 ms.
Support contains 11 out of 655 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 655/655 places, 1332/1332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 655 transition count 1328
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 651 transition count 1327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 650 transition count 1327
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 3 with 2 rules applied. Total rules applied 12 place count 649 transition count 1326
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 649 transition count 1324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 16 place count 647 transition count 1324
Applied a total of 16 rules in 113 ms. Remains 647 /655 variables (removed 8) and now considering 1324/1332 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 647/655 places, 1324/1332 transitions.
RANDOM walk for 40000 steps (520 resets) in 326 ms. (122 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (92 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (96 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (94 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (101 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (97 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 220570 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :2 out of 5
Probabilistic random walk after 220570 steps, saw 57959 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :2
[2024-06-01 01:23:47] [INFO ] Flow matrix only has 1323 transitions (discarded 1 similar events)
// Phase 1: matrix 1323 rows 647 cols
[2024-06-01 01:23:47] [INFO ] Computed 106 invariants in 19 ms
[2024-06-01 01:23:47] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 133/202 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 411/613 variables, 71/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 34/647 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1323/1970 variables, 647/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1970 variables, 34/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1970 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1970 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1970/1970 variables, and 787 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 647/647 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 133/202 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 411/613 variables, 71/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 34/647 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1323/1970 variables, 647/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1970 variables, 34/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1970 variables, 3/790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1970 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1970 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1970/1970 variables, and 790 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1899 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 647/647 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2963ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3182 ms.
Support contains 7 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1324/1324 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 647 transition count 1323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 646 transition count 1323
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 646 transition count 1322
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 645 transition count 1322
Applied a total of 4 rules in 51 ms. Remains 645 /647 variables (removed 2) and now considering 1322/1324 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 645/647 places, 1322/1324 transitions.
RANDOM walk for 40000 steps (509 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (101 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (100 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (99 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 208939 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 3
Probabilistic random walk after 208939 steps, saw 55169 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-06-01 01:23:56] [INFO ] Flow matrix only has 1321 transitions (discarded 1 similar events)
// Phase 1: matrix 1321 rows 645 cols
[2024-06-01 01:23:56] [INFO ] Computed 106 invariants in 14 ms
[2024-06-01 01:23:56] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 131/175 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 398/573 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 72/645 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1321/1966 variables, 645/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1966 variables, 35/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1966 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1966 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1966/1966 variables, and 786 constraints, problems are : Problem set: 0 solved, 3 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 645/645 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 131/175 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 398/573 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 72/645 variables, 13/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1321/1966 variables, 645/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1966 variables, 35/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1966 variables, 3/789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 01:23:59] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1966 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1966 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1966 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1966/1966 variables, and 790 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2114 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 645/645 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3061ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2987 ms.
Support contains 7 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1322/1322 transitions.
Applied a total of 0 rules in 34 ms. Remains 645 /645 variables (removed 0) and now considering 1322/1322 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 645/645 places, 1322/1322 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1322/1322 transitions.
Applied a total of 0 rules in 29 ms. Remains 645 /645 variables (removed 0) and now considering 1322/1322 (removed 0) transitions.
[2024-06-01 01:24:02] [INFO ] Flow matrix only has 1321 transitions (discarded 1 similar events)
[2024-06-01 01:24:02] [INFO ] Invariant cache hit.
[2024-06-01 01:24:03] [INFO ] Implicit Places using invariants in 817 ms returned [90, 96, 99, 101, 104, 111, 112, 114, 183, 189, 192, 194, 197, 204, 205, 206, 267, 275, 281, 284, 286, 289, 296, 297, 298, 299, 369, 375, 381, 384, 397, 478, 484, 492, 493, 494, 495, 564, 570, 573, 575, 578, 591]
[2024-06-01 01:24:03] [INFO ] Actually due to overlaps returned [111, 204, 296, 492, 112, 205, 297, 299, 493, 114, 494, 495, 206, 298, 397, 591, 90, 96, 101, 183, 189, 194, 375, 564, 570, 575, 104, 197, 289, 369, 381, 384, 478, 484, 578]
Discarding 35 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 824 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 610/645 places, 1321/1322 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 610 transition count 1305
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 594 transition count 1305
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 51 place count 575 transition count 1286
Iterating global reduction 0 with 19 rules applied. Total rules applied 70 place count 575 transition count 1286
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 575 transition count 1280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 572 transition count 1277
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 572 transition count 1277
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 90 place count 568 transition count 1273
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 568 transition count 1261
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 114 place count 556 transition count 1261
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 556 transition count 1260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 555 transition count 1260
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 555 transition count 1259
Applied a total of 117 rules in 175 ms. Remains 555 /610 variables (removed 55) and now considering 1259/1321 (removed 62) transitions.
// Phase 1: matrix 1259 rows 555 cols
[2024-06-01 01:24:03] [INFO ] Computed 71 invariants in 13 ms
[2024-06-01 01:24:04] [INFO ] Implicit Places using invariants in 608 ms returned [72, 89, 146, 163, 219, 236, 242, 245, 247, 248, 304, 327, 389, 406, 412, 418, 474, 491]
[2024-06-01 01:24:04] [INFO ] Actually due to overlaps returned [163, 248, 327, 491, 418, 236, 242, 247, 406, 412, 72, 89, 146, 219, 304, 389, 474]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 613 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 538/645 places, 1259/1322 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 531 transition count 1252
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 531 transition count 1252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 529 transition count 1250
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 529 transition count 1250
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 34 place count 521 transition count 1242
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 39 place count 521 transition count 1237
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 516 transition count 1237
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 516 transition count 1231
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 510 transition count 1231
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 510 transition count 1231
Applied a total of 57 rules in 145 ms. Remains 510 /538 variables (removed 28) and now considering 1231/1259 (removed 28) transitions.
// Phase 1: matrix 1231 rows 510 cols
[2024-06-01 01:24:04] [INFO ] Computed 54 invariants in 12 ms
[2024-06-01 01:24:05] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-06-01 01:24:05] [INFO ] Invariant cache hit.
[2024-06-01 01:24:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 01:24:06] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2335 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 510/645 places, 1231/1322 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4123 ms. Remains : 510/645 places, 1231/1322 transitions.
RANDOM walk for 40000 steps (621 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (140 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (152 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (142 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 175539 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 3
Probabilistic random walk after 175539 steps, saw 107648 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-06-01 01:24:10] [INFO ] Invariant cache hit.
[2024-06-01 01:24:10] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 69/113 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 361/474 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 36/510 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1231/1741 variables, 510/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1741 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1741 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1741 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1741/1741 variables, and 569 constraints, problems are : Problem set: 0 solved, 3 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 510/510 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 69/113 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 361/474 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 36/510 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1231/1741 variables, 510/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1741 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1741 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1741 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1741 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1741/1741 variables, and 572 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3809 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 510/510 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4777ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2370 ms.
Support contains 7 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1231/1231 transitions.
Applied a total of 0 rules in 22 ms. Remains 510 /510 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 510/510 places, 1231/1231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1231/1231 transitions.
Applied a total of 0 rules in 24 ms. Remains 510 /510 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
[2024-06-01 01:24:17] [INFO ] Invariant cache hit.
[2024-06-01 01:24:17] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-06-01 01:24:17] [INFO ] Invariant cache hit.
[2024-06-01 01:24:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 01:24:19] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
[2024-06-01 01:24:19] [INFO ] Redundant transitions in 158 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-06-01 01:24:19] [INFO ] Invariant cache hit.
[2024-06-01 01:24:19] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/509 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (OVERLAPS) 1/510 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/1741 variables, and 54 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/510 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/509 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (OVERLAPS) 1/510 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-06-01 01:25:16] [INFO ] Deduced a trap composed of 103 places in 359 ms of which 4 ms to minimize.
[2024-06-01 01:25:17] [INFO ] Deduced a trap composed of 102 places in 423 ms of which 5 ms to minimize.
[2024-06-01 01:25:19] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/1741 variables, and 57 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/510 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 3/3 constraints]
After SMT, in 61312ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 61338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63623 ms. Remains : 510/510 places, 1231/1231 transitions.
FORMULA ASLink-PT-06a-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&F(G(p2))))'
Support contains 6 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 1952/1952 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 1254 transition count 1717
Reduce places removed 240 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 246 rules applied. Total rules applied 480 place count 1014 transition count 1711
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 489 place count 1008 transition count 1708
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 492 place count 1005 transition count 1708
Performed 167 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 167 Pre rules applied. Total rules applied 492 place count 1005 transition count 1541
Deduced a syphon composed of 167 places in 5 ms
Ensure Unique test removed 52 places
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 4 with 386 rules applied. Total rules applied 878 place count 786 transition count 1541
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 43 rules applied. Total rules applied 921 place count 768 transition count 1516
Reduce places removed 26 places and 0 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 5 with 28 rules applied. Total rules applied 949 place count 742 transition count 1514
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 951 place count 740 transition count 1514
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 951 place count 740 transition count 1493
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 993 place count 719 transition count 1493
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1005 place count 707 transition count 1474
Iterating global reduction 7 with 12 rules applied. Total rules applied 1017 place count 707 transition count 1474
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 10 rules applied. Total rules applied 1027 place count 707 transition count 1464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1028 place count 706 transition count 1464
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1028 place count 706 transition count 1463
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1030 place count 705 transition count 1463
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1031 place count 704 transition count 1455
Iterating global reduction 9 with 1 rules applied. Total rules applied 1032 place count 704 transition count 1455
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1033 place count 703 transition count 1447
Iterating global reduction 9 with 1 rules applied. Total rules applied 1034 place count 703 transition count 1447
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1035 place count 702 transition count 1439
Iterating global reduction 9 with 1 rules applied. Total rules applied 1036 place count 702 transition count 1439
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1037 place count 701 transition count 1431
Iterating global reduction 9 with 1 rules applied. Total rules applied 1038 place count 701 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1039 place count 700 transition count 1423
Iterating global reduction 9 with 1 rules applied. Total rules applied 1040 place count 700 transition count 1423
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1041 place count 699 transition count 1415
Iterating global reduction 9 with 1 rules applied. Total rules applied 1042 place count 699 transition count 1415
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1043 place count 698 transition count 1407
Iterating global reduction 9 with 1 rules applied. Total rules applied 1044 place count 698 transition count 1407
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1045 place count 697 transition count 1399
Iterating global reduction 9 with 1 rules applied. Total rules applied 1046 place count 697 transition count 1399
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1047 place count 696 transition count 1391
Iterating global reduction 9 with 1 rules applied. Total rules applied 1048 place count 696 transition count 1391
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1049 place count 695 transition count 1383
Iterating global reduction 9 with 1 rules applied. Total rules applied 1050 place count 695 transition count 1383
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 9 with 132 rules applied. Total rules applied 1182 place count 629 transition count 1317
Applied a total of 1182 rules in 426 ms. Remains 629 /1255 variables (removed 626) and now considering 1317/1952 (removed 635) transitions.
// Phase 1: matrix 1317 rows 629 cols
[2024-06-01 01:25:21] [INFO ] Computed 93 invariants in 18 ms
[2024-06-01 01:25:22] [INFO ] Implicit Places using invariants in 832 ms returned [73, 90, 96, 101, 160, 177, 183, 188, 190, 250, 284, 293, 345, 364, 370, 379, 442, 459, 465, 470, 472, 473, 533, 550, 556, 561, 563, 626]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 835 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 601/1255 places, 1317/1952 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 601 transition count 1315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 599 transition count 1315
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 599 transition count 1311
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 595 transition count 1311
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 21 place count 586 transition count 1302
Iterating global reduction 2 with 9 rules applied. Total rules applied 30 place count 586 transition count 1302
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 39 place count 577 transition count 1293
Iterating global reduction 2 with 9 rules applied. Total rules applied 48 place count 577 transition count 1293
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 572 transition count 1288
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 572 transition count 1288
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 84 place count 559 transition count 1275
Applied a total of 84 rules in 113 ms. Remains 559 /601 variables (removed 42) and now considering 1275/1317 (removed 42) transitions.
// Phase 1: matrix 1275 rows 559 cols
[2024-06-01 01:25:22] [INFO ] Computed 65 invariants in 12 ms
[2024-06-01 01:25:23] [INFO ] Implicit Places using invariants in 586 ms returned [242, 248, 253]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 588 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 556/1255 places, 1275/1952 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 554 transition count 1273
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 554 transition count 1273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 552 transition count 1271
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 552 transition count 1271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 551 transition count 1270
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 551 transition count 1270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 550 transition count 1269
Applied a total of 12 rules in 87 ms. Remains 550 /556 variables (removed 6) and now considering 1269/1275 (removed 6) transitions.
// Phase 1: matrix 1269 rows 550 cols
[2024-06-01 01:25:23] [INFO ] Computed 62 invariants in 12 ms
[2024-06-01 01:25:23] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-06-01 01:25:23] [INFO ] Invariant cache hit.
[2024-06-01 01:25:25] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2378 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 550/1255 places, 1269/1952 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4435 ms. Remains : 550/1255 places, 1269/1952 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-01
Product exploration explored 100000 steps with 1623 reset in 556 ms.
Product exploration explored 100000 steps with 1636 reset in 463 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (OR p1 p0))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 348 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (563 resets) in 543 ms. (73 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (117 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (113 resets) in 407 ms. (98 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (112 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
[2024-06-01 01:25:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/51 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 307/358 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 27/385 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 165/550 variables, 30/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1269/1819 variables, 550/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1819 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1819 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1819/1819 variables, and 612 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/51 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 307/358 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 27/385 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 01:25:29] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 10 (OVERLAPS) 165/550 variables, 30/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/550 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1269/1819 variables, 550/613 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1819 variables, 2/615 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1819/1819 variables, and 615 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3104 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 4162ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1269/1269 transitions.
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 550 transition count 1246
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 52 place count 527 transition count 1240
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 71 place count 527 transition count 1221
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 90 place count 508 transition count 1221
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 508 transition count 1221
Applied a total of 91 rules in 95 ms. Remains 508 /550 variables (removed 42) and now considering 1221/1269 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 508/550 places, 1221/1269 transitions.
RANDOM walk for 40000 steps (696 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (151 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (159 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 183020 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 183020 steps, saw 103617 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 1221 rows 508 cols
[2024-06-01 01:25:35] [INFO ] Computed 62 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 274/320 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 23/343 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 165/508 variables, 30/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1221/1729 variables, 508/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1729 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 508/508 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 274/320 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 23/343 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 165/508 variables, 30/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1221/1729 variables, 508/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1729 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1729 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1729/1729 variables, and 572 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10236 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 508/508 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 11103ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 701 ms.
Support contains 6 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 1221/1221 transitions.
Applied a total of 0 rules in 22 ms. Remains 508 /508 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 508/508 places, 1221/1221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 1221/1221 transitions.
Applied a total of 0 rules in 21 ms. Remains 508 /508 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
[2024-06-01 01:25:47] [INFO ] Invariant cache hit.
[2024-06-01 01:25:48] [INFO ] Implicit Places using invariants in 785 ms returned [89, 90, 160, 161, 231, 232, 299, 308, 309, 379, 380]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 787 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 497/508 places, 1221/1221 transitions.
Applied a total of 0 rules in 20 ms. Remains 497 /497 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 830 ms. Remains : 497/508 places, 1221/1221 transitions.
RANDOM walk for 40000 steps (681 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (158 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (148 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 195161 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 2
Probabilistic random walk after 195161 steps, saw 107415 distinct states, run finished after 3006 ms. (steps per millisecond=64 ) properties seen :0
// Phase 1: matrix 1221 rows 497 cols
[2024-06-01 01:25:51] [INFO ] Computed 51 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/57 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 312/388 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 21/409 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 88/497 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/497 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1221/1718 variables, 497/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1718 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1718 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 548 constraints, problems are : Problem set: 0 solved, 2 unsolved in 985 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/57 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 312/388 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 21/409 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:25:52] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 88/497 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/497 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1221/1718 variables, 497/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1718 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1718 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1718 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 551 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6381 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 7393ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 686 ms.
Support contains 6 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 1221/1221 transitions.
Applied a total of 0 rules in 25 ms. Remains 497 /497 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 497/497 places, 1221/1221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 1221/1221 transitions.
Applied a total of 0 rules in 21 ms. Remains 497 /497 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
[2024-06-01 01:25:59] [INFO ] Invariant cache hit.
[2024-06-01 01:25:59] [INFO ] Implicit Places using invariants in 612 ms returned []
[2024-06-01 01:26:00] [INFO ] Invariant cache hit.
[2024-06-01 01:26:01] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
[2024-06-01 01:26:01] [INFO ] Redundant transitions in 28 ms returned []
Running 1191 sub problems to find dead transitions.
[2024-06-01 01:26:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/1718 variables, and 46 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/497 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 01:26:50] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/1718 variables, and 47 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/497 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 1/1 constraints]
After SMT, in 61031ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 61048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63073 ms. Remains : 497/497 places, 1221/1221 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 497 /497 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 01:27:02] [INFO ] Invariant cache hit.
[2024-06-01 01:27:02] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 01:27:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 01:27:02] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 24 ms returned sat
[2024-06-01 01:27:12] [INFO ] After 9556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 01:27:14] [INFO ] After 12157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 01:27:18] [INFO ] After 15783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 15934 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (OR p1 p0))), (X (X p0)), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 421 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Support contains 4 out of 550 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1269/1269 transitions.
Applied a total of 0 rules in 23 ms. Remains 550 /550 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
// Phase 1: matrix 1269 rows 550 cols
[2024-06-01 01:27:19] [INFO ] Computed 62 invariants in 12 ms
[2024-06-01 01:27:19] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-06-01 01:27:19] [INFO ] Invariant cache hit.
[2024-06-01 01:27:21] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
[2024-06-01 01:27:21] [INFO ] Redundant transitions in 94 ms returned []
Running 1233 sub problems to find dead transitions.
[2024-06-01 01:27:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1819 variables, and 56 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 48/51 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 1233/1233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 3 (OVERLAPS) 1/550 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
[2024-06-01 01:28:18] [INFO ] Deduced a trap composed of 87 places in 460 ms of which 6 ms to minimize.
[2024-06-01 01:28:19] [INFO ] Deduced a trap composed of 97 places in 482 ms of which 5 ms to minimize.
[2024-06-01 01:28:19] [INFO ] Deduced a trap composed of 87 places in 470 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1819 variables, and 65 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 0/1233 constraints, Known Traps: 3/3 constraints]
After SMT, in 60909ms problems are : Problem set: 0 solved, 1233 unsolved
Search for dead transitions found 0 dead transitions in 60925ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63314 ms. Remains : 550/550 places, 1269/1269 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (568 resets) in 126 ms. (314 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (111 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
[2024-06-01 01:28:22] [INFO ] Invariant cache hit.
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) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/136 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/142 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 193/335 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/340 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 127/467 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/501 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/501 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 49/550 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1269/1819 variables, 550/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1819 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1819 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1819/1819 variables, and 612 constraints, problems are : Problem set: 0 solved, 1 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 550/550 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) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/136 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/142 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 193/335 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/340 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 127/467 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/501 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/501 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 49/550 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1269/1819 variables, 550/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1819/1819 variables, and 613 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2716ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1269/1269 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 550 transition count 1266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 547 transition count 1266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 547 transition count 1265
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 546 transition count 1265
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 31 place count 546 transition count 1242
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 60 place count 523 transition count 1236
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 77 place count 523 transition count 1219
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 94 place count 506 transition count 1219
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 506 transition count 1219
Applied a total of 95 rules in 106 ms. Remains 506 /550 variables (removed 44) and now considering 1219/1269 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 506/550 places, 1219/1269 transitions.
RANDOM walk for 40000 steps (664 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (165 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 265141 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 265141 steps, saw 160271 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 1219 rows 506 cols
[2024-06-01 01:28:28] [INFO ] Computed 62 invariants in 11 ms
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) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/118 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/121 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 178/299 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/302 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 121/423 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/457 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 49/506 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1219/1725 variables, 506/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1725 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1725 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1725/1725 variables, and 568 constraints, problems are : Problem set: 0 solved, 1 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 506/506 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) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/118 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/121 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 178/299 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/302 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 121/423 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 34/457 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:28:29] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 49/506 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1219/1725 variables, 506/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1725 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 570 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10512 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 506/506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 11171ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 206 ms.
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1219/1219 transitions.
Applied a total of 0 rules in 21 ms. Remains 506 /506 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 506/506 places, 1219/1219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1219/1219 transitions.
Applied a total of 0 rules in 20 ms. Remains 506 /506 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
[2024-06-01 01:28:40] [INFO ] Invariant cache hit.
[2024-06-01 01:28:40] [INFO ] Implicit Places using invariants in 706 ms returned [89, 90, 160, 161, 231, 232, 299, 301, 306, 307, 377, 378]
[2024-06-01 01:28:40] [INFO ] Actually due to overlaps returned [89, 160, 231, 306, 377, 90, 161, 232, 307, 378, 301]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 708 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 495/506 places, 1219/1219 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 494 transition count 1218
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 494 transition count 1218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 493 transition count 1217
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 493 transition count 1216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 492 transition count 1216
Applied a total of 6 rules in 68 ms. Remains 492 /495 variables (removed 3) and now considering 1216/1219 (removed 3) transitions.
// Phase 1: matrix 1216 rows 492 cols
[2024-06-01 01:28:40] [INFO ] Computed 51 invariants in 13 ms
[2024-06-01 01:28:41] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-06-01 01:28:41] [INFO ] Invariant cache hit.
[2024-06-01 01:28:42] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2069 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 492/506 places, 1216/1219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2866 ms. Remains : 492/506 places, 1216/1219 transitions.
RANDOM walk for 40000 steps (736 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (152 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 282201 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 282201 steps, saw 173747 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 01:28:45] [INFO ] Invariant cache hit.
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) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/141 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 165/306 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/313 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/326 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 33/359 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 99/458 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/476 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/476 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 16/492 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/492 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1216/1708 variables, 492/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1708 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1708 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1708/1708 variables, and 543 constraints, problems are : Problem set: 0 solved, 1 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 492/492 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) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/141 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 165/306 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/313 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/326 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 33/359 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 99/458 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/476 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/476 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 16/492 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/492 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1216/1708 variables, 492/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1708 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1708 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1708 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 544 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9479 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10123ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 234 ms.
Support contains 2 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 1216/1216 transitions.
Applied a total of 0 rules in 20 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 492/492 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 1216/1216 transitions.
Applied a total of 0 rules in 19 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-06-01 01:28:56] [INFO ] Invariant cache hit.
[2024-06-01 01:28:56] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-06-01 01:28:56] [INFO ] Invariant cache hit.
[2024-06-01 01:28:58] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
[2024-06-01 01:28:58] [INFO ] Redundant transitions in 104 ms returned []
Running 1186 sub problems to find dead transitions.
[2024-06-01 01:28:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/1708 variables, and 46 constraints, problems are : Problem set: 0 solved, 1186 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/492 constraints, PredecessorRefiner: 1186/1186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
At refinement iteration 3 (OVERLAPS) 1/492 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/1708 variables, and 51 constraints, problems are : Problem set: 0 solved, 1186 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/492 constraints, PredecessorRefiner: 0/1186 constraints, Known Traps: 0/0 constraints]
After SMT, in 60869ms problems are : Problem set: 0 solved, 1186 unsolved
Search for dead transitions found 0 dead transitions in 60885ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62883 ms. Remains : 492/492 places, 1216/1216 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 492 /492 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 01:29:59] [INFO ] Invariant cache hit.
[2024-06-01 01:29:59] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 01:29:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 01:29:59] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 28 ms returned sat
[2024-06-01 01:30:00] [INFO ] After 1083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 01:30:00] [INFO ] After 1181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 01:30:04] [INFO ] After 5168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 5300 ms.
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1596 reset in 270 ms.
Product exploration explored 100000 steps with 1606 reset in 293 ms.
Support contains 4 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1269/1269 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 550 transition count 1267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 548 transition count 1267
Applied a total of 4 rules in 25 ms. Remains 548 /550 variables (removed 2) and now considering 1267/1269 (removed 2) transitions.
// Phase 1: matrix 1267 rows 548 cols
[2024-06-01 01:30:05] [INFO ] Computed 62 invariants in 12 ms
[2024-06-01 01:30:06] [INFO ] Implicit Places using invariants in 728 ms returned []
[2024-06-01 01:30:06] [INFO ] Invariant cache hit.
[2024-06-01 01:30:08] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2516 ms to find 0 implicit places.
[2024-06-01 01:30:08] [INFO ] Redundant transitions in 42 ms returned []
Running 1231 sub problems to find dead transitions.
[2024-06-01 01:30:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/547 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/547 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/1815 variables, and 56 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 48/51 constraints, State Equation: 0/548 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/547 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/547 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 3 (OVERLAPS) 1/548 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
[2024-06-01 01:31:05] [INFO ] Deduced a trap composed of 102 places in 433 ms of which 5 ms to minimize.
[2024-06-01 01:31:05] [INFO ] Deduced a trap composed of 93 places in 477 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1815 variables, and 64 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/548 constraints, PredecessorRefiner: 0/1231 constraints, Known Traps: 2/2 constraints]
After SMT, in 60973ms problems are : Problem set: 0 solved, 1231 unsolved
Search for dead transitions found 0 dead transitions in 60997ms
Starting structural reductions in SI_LTL mode, iteration 1 : 548/550 places, 1267/1269 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63594 ms. Remains : 548/550 places, 1267/1269 transitions.
Treatment of property ASLink-PT-06a-LTLCardinality-01 finished in 348245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 1952/1952 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1254 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1254 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1253 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1253 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1252 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1252 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1251 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1251 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1250 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1250 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1249 transition count 1904
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1249 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1248 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1248 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1247 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1247 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1246 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1246 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1245 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1245 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1244 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1244 transition count 1864
Applied a total of 22 rules in 619 ms. Remains 1244 /1255 variables (removed 11) and now considering 1864/1952 (removed 88) transitions.
// Phase 1: matrix 1864 rows 1244 cols
[2024-06-01 01:31:10] [INFO ] Computed 170 invariants in 18 ms
[2024-06-01 01:31:11] [INFO ] Implicit Places using invariants in 1087 ms returned [572, 936]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1090 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1255 places, 1864/1952 transitions.
Applied a total of 0 rules in 45 ms. Remains 1242 /1242 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1754 ms. Remains : 1242/1255 places, 1864/1952 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-02
Product exploration explored 100000 steps with 566 reset in 479 ms.
Product exploration explored 100000 steps with 556 reset in 455 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (221 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (31 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 224472 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 224472 steps, saw 78248 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 1864 rows 1242 cols
[2024-06-01 01:31:15] [INFO ] Computed 168 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 454/543 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 689/1232 variables, 125/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/1242 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1242 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1864/3106 variables, 1242/1410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3106 variables, 0/1410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3106 variables, 0/1410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3106/3106 variables, and 1410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 454/543 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 689/1232 variables, 125/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:31:17] [INFO ] Deduced a trap composed of 51 places in 640 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/1242 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1242 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1864/3106 variables, 1242/1411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3106 variables, 1/1412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3106 variables, 0/1412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3106 variables, 0/1412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3106/3106 variables, and 1412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2327 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3511ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 456 ms.
Support contains 4 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1864/1864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1242 transition count 1624
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 1002 transition count 1624
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 164 Pre rules applied. Total rules applied 480 place count 1002 transition count 1460
Deduced a syphon composed of 164 places in 2 ms
Ensure Unique test removed 53 places
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 381 rules applied. Total rules applied 861 place count 785 transition count 1460
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 19 rules applied. Total rules applied 880 place count 775 transition count 1451
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 889 place count 766 transition count 1451
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 889 place count 766 transition count 1427
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 937 place count 742 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 942 place count 737 transition count 1422
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 737 transition count 1422
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 951 place count 737 transition count 1418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 952 place count 736 transition count 1418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 952 place count 736 transition count 1417
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 954 place count 735 transition count 1417
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 1088 place count 668 transition count 1350
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1094 place count 668 transition count 1344
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1100 place count 662 transition count 1344
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1124 place count 662 transition count 1320
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1149 place count 637 transition count 1320
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1155 place count 637 transition count 1314
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 1174 place count 637 transition count 1314
Applied a total of 1174 rules in 252 ms. Remains 637 /1242 variables (removed 605) and now considering 1314/1864 (removed 550) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 637/1242 places, 1314/1864 transitions.
RANDOM walk for 40000 steps (525 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (101 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 331349 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 331349 steps, saw 79069 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
// Phase 1: matrix 1314 rows 637 cols
[2024-06-01 01:31:22] [INFO ] Computed 104 invariants in 14 ms
[2024-06-01 01:31:22] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/149 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 413/562 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 75/637 variables, 15/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1314/1951 variables, 637/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1951 variables, 30/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1951 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1951 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1951/1951 variables, and 771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 637/637 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/149 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 413/562 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 75/637 variables, 15/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1314/1951 variables, 637/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1951 variables, 30/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1951 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1951 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1951 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1951/1951 variables, and 772 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 637/637 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1919ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 139 ms.
Support contains 4 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1314/1314 transitions.
Applied a total of 0 rules in 24 ms. Remains 637 /637 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 637/637 places, 1314/1314 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1314/1314 transitions.
Applied a total of 0 rules in 24 ms. Remains 637 /637 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
[2024-06-01 01:31:24] [INFO ] Invariant cache hit.
[2024-06-01 01:31:25] [INFO ] Implicit Places using invariants in 859 ms returned [89, 95, 98, 100, 103, 110, 111, 112, 181, 187, 190, 192, 195, 202, 203, 204, 273, 279, 282, 284, 287, 294, 295, 296, 366, 372, 378, 381, 394, 463, 469, 472, 474, 477, 485, 486, 487, 556, 562, 565, 567, 570, 583]
[2024-06-01 01:31:25] [INFO ] Actually due to overlaps returned [110, 202, 294, 485, 111, 203, 295, 486, 112, 204, 296, 394, 487, 583, 89, 95, 100, 181, 187, 192, 273, 279, 284, 366, 372, 463, 469, 474, 556, 562, 567, 103, 195, 287, 378, 381, 477, 570]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 862 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 599/637 places, 1314/1314 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 599 transition count 1302
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 587 transition count 1302
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 52 place count 559 transition count 1274
Iterating global reduction 0 with 28 rules applied. Total rules applied 80 place count 559 transition count 1274
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 559 transition count 1268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 553 transition count 1262
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 553 transition count 1262
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 110 place count 547 transition count 1256
Free-agglomeration rule applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 128 place count 547 transition count 1238
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 146 place count 529 transition count 1238
Applied a total of 146 rules in 99 ms. Remains 529 /599 variables (removed 70) and now considering 1238/1314 (removed 76) transitions.
// Phase 1: matrix 1238 rows 529 cols
[2024-06-01 01:31:25] [INFO ] Computed 66 invariants in 10 ms
[2024-06-01 01:31:26] [INFO ] Implicit Places using invariants in 712 ms returned [72, 89, 145, 162, 218, 235, 291, 312, 374, 392, 448, 465]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 715 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 517/637 places, 1238/1314 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 516 transition count 1237
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 516 transition count 1237
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 510 transition count 1231
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 510 transition count 1225
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 504 transition count 1225
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 27 place count 504 transition count 1225
Applied a total of 27 rules in 104 ms. Remains 504 /517 variables (removed 13) and now considering 1225/1238 (removed 13) transitions.
// Phase 1: matrix 1225 rows 504 cols
[2024-06-01 01:31:26] [INFO ] Computed 54 invariants in 11 ms
[2024-06-01 01:31:27] [INFO ] Implicit Places using invariants in 769 ms returned []
[2024-06-01 01:31:27] [INFO ] Invariant cache hit.
[2024-06-01 01:31:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 01:31:29] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2840 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 504/637 places, 1225/1314 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4646 ms. Remains : 504/637 places, 1225/1314 transitions.
RANDOM walk for 40000 steps (669 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (139 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 280181 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 280181 steps, saw 179415 distinct states, run finished after 3003 ms. (steps per millisecond=93 ) properties seen :0
[2024-06-01 01:31:32] [INFO ] Invariant cache hit.
[2024-06-01 01:31:32] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/123 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/469 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/504 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1729 variables, 504/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 6/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1729 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 564 constraints, problems are : Problem set: 0 solved, 1 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 504/504 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/123 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/469 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/504 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1729 variables, 504/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 6/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1729 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1729/1729 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4338 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 504/504 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4955ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 246 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 504/504 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 01:31:37] [INFO ] Invariant cache hit.
[2024-06-01 01:31:38] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-06-01 01:31:38] [INFO ] Invariant cache hit.
[2024-06-01 01:31:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 01:31:40] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 2639 ms to find 0 implicit places.
[2024-06-01 01:31:40] [INFO ] Redundant transitions in 28 ms returned []
Running 1224 sub problems to find dead transitions.
[2024-06-01 01:31:40] [INFO ] Invariant cache hit.
[2024-06-01 01:31:40] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/1729 variables, and 54 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/504 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 01:32:35] [INFO ] Deduced a trap composed of 99 places in 322 ms of which 4 ms to minimize.
[2024-06-01 01:32:35] [INFO ] Deduced a trap composed of 102 places in 300 ms of which 4 ms to minimize.
[2024-06-01 01:32:37] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/1729 variables, and 57 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/504 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 3/3 constraints]
After SMT, in 60948ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 60964ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63660 ms. Remains : 504/504 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 01:32:41] [INFO ] Invariant cache hit.
[2024-06-01 01:32:41] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 01:32:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 01:32:41] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned sat
[2024-06-01 01:32:43] [INFO ] After 1438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 01:32:43] [INFO ] After 1527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 01:32:43] [INFO ] After 1748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1903 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Support contains 4 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 1864/1864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1242 transition count 1624
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 1002 transition count 1624
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 164 Pre rules applied. Total rules applied 480 place count 1002 transition count 1460
Deduced a syphon composed of 164 places in 1 ms
Ensure Unique test removed 53 places
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 381 rules applied. Total rules applied 861 place count 785 transition count 1460
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 19 rules applied. Total rules applied 880 place count 775 transition count 1451
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 889 place count 766 transition count 1451
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 889 place count 766 transition count 1427
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 937 place count 742 transition count 1427
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 942 place count 737 transition count 1422
Iterating global reduction 4 with 5 rules applied. Total rules applied 947 place count 737 transition count 1422
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 951 place count 737 transition count 1418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 952 place count 736 transition count 1418
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 952 place count 736 transition count 1417
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 954 place count 735 transition count 1417
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 1088 place count 668 transition count 1350
Applied a total of 1088 rules in 150 ms. Remains 668 /1242 variables (removed 574) and now considering 1350/1864 (removed 514) transitions.
// Phase 1: matrix 1350 rows 668 cols
[2024-06-01 01:32:43] [INFO ] Computed 105 invariants in 12 ms
[2024-06-01 01:32:44] [INFO ] Implicit Places using invariants in 926 ms returned [90, 96, 101, 117, 187, 193, 198, 214, 284, 290, 295, 311, 382, 388, 394, 413, 483, 489, 494, 511, 581, 587, 592, 611, 665]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 928 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 643/1242 places, 1350/1864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 643 transition count 1349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 642 transition count 1349
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 2 place count 642 transition count 1337
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 26 place count 630 transition count 1337
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 37 place count 619 transition count 1326
Iterating global reduction 2 with 11 rules applied. Total rules applied 48 place count 619 transition count 1326
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 59 place count 608 transition count 1315
Iterating global reduction 2 with 11 rules applied. Total rules applied 70 place count 608 transition count 1315
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 602 transition count 1309
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 602 transition count 1309
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 106 place count 590 transition count 1297
Applied a total of 106 rules in 106 ms. Remains 590 /643 variables (removed 53) and now considering 1297/1350 (removed 53) transitions.
// Phase 1: matrix 1297 rows 590 cols
[2024-06-01 01:32:44] [INFO ] Computed 80 invariants in 11 ms
[2024-06-01 01:32:45] [INFO ] Implicit Places using invariants in 775 ms returned [93, 96, 177, 180, 261, 264, 349, 352, 436, 440, 521, 524]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 777 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 578/1242 places, 1297/1864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 578 transition count 1291
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 572 transition count 1291
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 566 transition count 1285
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 566 transition count 1285
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 566 transition count 1279
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 3 with 2 rules applied. Total rules applied 32 place count 565 transition count 1278
Applied a total of 32 rules in 63 ms. Remains 565 /578 variables (removed 13) and now considering 1278/1297 (removed 19) transitions.
// Phase 1: matrix 1278 rows 565 cols
[2024-06-01 01:32:45] [INFO ] Computed 68 invariants in 12 ms
[2024-06-01 01:32:46] [INFO ] Implicit Places using invariants in 703 ms returned [72, 151, 231, 311, 398, 479]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 708 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 559/1242 places, 1278/1864 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 553 transition count 1272
Applied a total of 12 rules in 40 ms. Remains 553 /559 variables (removed 6) and now considering 1272/1278 (removed 6) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-06-01 01:32:46] [INFO ] Computed 62 invariants in 12 ms
[2024-06-01 01:32:46] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 01:32:46] [INFO ] Invariant cache hit.
[2024-06-01 01:32:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 01:32:48] [INFO ] Implicit Places using invariants and state equation in 2005 ms returned []
Implicit Place search using SMT with State Equation took 2703 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 553/1242 places, 1272/1864 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 5479 ms. Remains : 553/1242 places, 1272/1864 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (518 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (111 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 376052 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 376052 steps, saw 111140 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2024-06-01 01:32:52] [INFO ] Invariant cache hit.
[2024-06-01 01:32:52] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/117 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/525 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/553 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1272/1825 variables, 553/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1825 variables, 6/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1825 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1825 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1825/1825 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 553/553 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/117 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/525 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/553 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1272/1825 variables, 553/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1825 variables, 6/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1825/1825 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1844 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 553/553 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2519ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 553 transition count 1248
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 54 place count 529 transition count 1242
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 529 transition count 1225
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 88 place count 512 transition count 1225
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 512 transition count 1225
Applied a total of 90 rules in 86 ms. Remains 512 /553 variables (removed 41) and now considering 1225/1272 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 512/553 places, 1225/1272 transitions.
RANDOM walk for 40000 steps (671 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (147 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 257405 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 257405 steps, saw 150233 distinct states, run finished after 3013 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 1225 rows 512 cols
[2024-06-01 01:32:57] [INFO ] Computed 62 invariants in 11 ms
[2024-06-01 01:32:57] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/104 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/450 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/512 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1737 variables, 512/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1737 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1737/1737 variables, and 580 constraints, problems are : Problem set: 0 solved, 1 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 512/512 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/104 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/450 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/512 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1737 variables, 512/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1737 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1737 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1737/1737 variables, and 581 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 512/512 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1833ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 295 ms.
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 19 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 512/512 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 20 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 01:33:00] [INFO ] Invariant cache hit.
[2024-06-01 01:33:00] [INFO ] Implicit Places using invariants in 609 ms returned [89, 90, 160, 161, 231, 232, 382, 383]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 611 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 504/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 653 ms. Remains : 504/512 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (672 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (147 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 264917 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 264917 steps, saw 154931 distinct states, run finished after 3002 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 1225 rows 504 cols
[2024-06-01 01:33:03] [INFO ] Computed 54 invariants in 11 ms
[2024-06-01 01:33:03] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/123 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/469 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/504 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1729 variables, 504/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 6/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1729 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 564 constraints, problems are : Problem set: 0 solved, 1 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 504/504 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/123 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:33:04] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 346/469 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 35/504 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1225/1729 variables, 504/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 6/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1729 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1729 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1729/1729 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 504/504 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1593ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 212 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 504/504 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 01:33:05] [INFO ] Invariant cache hit.
[2024-06-01 01:33:06] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-06-01 01:33:06] [INFO ] Invariant cache hit.
[2024-06-01 01:33:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 01:33:08] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 2577 ms to find 0 implicit places.
[2024-06-01 01:33:08] [INFO ] Redundant transitions in 27 ms returned []
Running 1224 sub problems to find dead transitions.
[2024-06-01 01:33:08] [INFO ] Invariant cache hit.
[2024-06-01 01:33:08] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/1729 variables, and 54 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/504 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 01:34:03] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/1729 variables, and 55 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/504 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 60900ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 60915ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63546 ms. Remains : 504/504 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 01:34:09] [INFO ] Invariant cache hit.
[2024-06-01 01:34:09] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 01:34:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 01:34:09] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 23 ms returned sat
[2024-06-01 01:34:10] [INFO ] After 1180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 01:34:11] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 4 ms to minimize.
[2024-06-01 01:34:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
TRAPS : Iteration 1
[2024-06-01 01:34:11] [INFO ] After 2033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 01:34:11] [INFO ] After 2222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2364 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1304 reset in 288 ms.
Product exploration explored 100000 steps with 1299 reset in 296 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Applied a total of 0 rules in 22 ms. Remains 553 /553 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-06-01 01:34:12] [INFO ] Computed 62 invariants in 13 ms
[2024-06-01 01:34:13] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-06-01 01:34:13] [INFO ] Invariant cache hit.
[2024-06-01 01:34:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 01:34:15] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2698 ms to find 0 implicit places.
[2024-06-01 01:34:15] [INFO ] Redundant transitions in 28 ms returned []
Running 1271 sub problems to find dead transitions.
[2024-06-01 01:34:15] [INFO ] Invariant cache hit.
[2024-06-01 01:34:15] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 2 (OVERLAPS) 1/553 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1825 variables, and 62 constraints, problems are : Problem set: 0 solved, 1271 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/553 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1271/1271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 2 (OVERLAPS) 1/553 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/1825 variables, and 62 constraints, problems are : Problem set: 0 solved, 1271 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/553 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1271 constraints, Known Traps: 0/0 constraints]
After SMT, in 60857ms problems are : Problem set: 0 solved, 1271 unsolved
Search for dead transitions found 0 dead transitions in 60872ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63631 ms. Remains : 553/553 places, 1272/1272 transitions.
Treatment of property ASLink-PT-06a-LTLCardinality-02 finished in 246622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 1952/1952 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1254 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1254 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1253 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1253 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1252 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1252 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1251 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1251 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1250 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1250 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1249 transition count 1904
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1249 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1248 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1248 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1247 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1247 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1246 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1246 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1245 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1245 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1244 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1244 transition count 1864
Applied a total of 22 rules in 526 ms. Remains 1244 /1255 variables (removed 11) and now considering 1864/1952 (removed 88) transitions.
// Phase 1: matrix 1864 rows 1244 cols
[2024-06-01 01:35:16] [INFO ] Computed 170 invariants in 17 ms
[2024-06-01 01:35:17] [INFO ] Implicit Places using invariants in 1110 ms returned [572, 916]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1112 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1255 places, 1864/1952 transitions.
Applied a total of 0 rules in 45 ms. Remains 1242 /1242 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1684 ms. Remains : 1242/1255 places, 1864/1952 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-03
Product exploration explored 100000 steps with 564 reset in 372 ms.
Product exploration explored 100000 steps with 539 reset in 385 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (220 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (27 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 227967 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 227967 steps, saw 79499 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 1864 rows 1242 cols
[2024-06-01 01:35:21] [INFO ] Computed 168 invariants in 19 ms
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) 20/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 498/520 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/1233 variables, 127/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/1242 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1242 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1864/3106 variables, 1242/1410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3106 variables, 0/1410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3106 variables, 0/1410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3106/3106 variables, and 1410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1137 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1242/1242 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) 20/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 498/520 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 713/1233 variables, 127/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/1242 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1242 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1864/3106 variables, 1242/1410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3106/3106 variables, and 1411 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1953 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3130ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1939 steps, including 127 resets, run visited all 1 properties in 8 ms. (steps per millisecond=242 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-06a-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06a-LTLCardinality-03 finished in 9062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p2)||p1))||p0)))'
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 1952/1952 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1254 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1254 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1253 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1253 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1252 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1252 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1251 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1251 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1250 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1250 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1249 transition count 1904
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1249 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1248 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1248 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1247 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1247 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1246 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1246 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1245 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1245 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1244 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1244 transition count 1864
Applied a total of 22 rules in 529 ms. Remains 1244 /1255 variables (removed 11) and now considering 1864/1952 (removed 88) transitions.
// Phase 1: matrix 1864 rows 1244 cols
[2024-06-01 01:35:25] [INFO ] Computed 170 invariants in 22 ms
[2024-06-01 01:35:26] [INFO ] Implicit Places using invariants in 1064 ms returned [916, 936]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1073 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1255 places, 1864/1952 transitions.
Applied a total of 0 rules in 44 ms. Remains 1242 /1242 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1650 ms. Remains : 1242/1255 places, 1864/1952 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 982 ms.
Product exploration explored 100000 steps with 50000 reset in 997 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 30 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-06a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06a-LTLCardinality-05 finished in 3864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 1952/1952 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1254 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1254 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1253 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1253 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1252 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1252 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1251 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1251 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1250 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1250 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1249 transition count 1904
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1249 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1248 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1248 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1247 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1247 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1246 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1246 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1245 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1245 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1244 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1244 transition count 1864
Applied a total of 22 rules in 529 ms. Remains 1244 /1255 variables (removed 11) and now considering 1864/1952 (removed 88) transitions.
[2024-06-01 01:35:29] [INFO ] Invariant cache hit.
[2024-06-01 01:35:30] [INFO ] Implicit Places using invariants in 1114 ms returned [572, 916, 936]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1117 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1241/1255 places, 1864/1952 transitions.
Applied a total of 0 rules in 44 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1693 ms. Remains : 1241/1255 places, 1864/1952 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-08
Product exploration explored 100000 steps with 549 reset in 338 ms.
Product exploration explored 100000 steps with 567 reset in 368 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 40000 steps (202 resets) in 291 ms. (136 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (30 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
// Phase 1: matrix 1864 rows 1241 cols
[2024-06-01 01:35:32] [INFO ] Computed 167 invariants in 17 ms
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) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 109/134 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 398/532 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 701/1233 variables, 126/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1241 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3105/3105 variables, and 1408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1241/1241 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) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 109/134 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 398/532 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 701/1233 variables, 126/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1241 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1864/3105 variables, 1241/1408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3105/3105 variables, and 1409 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2046 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3424ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1241 transition count 1621
Reduce places removed 243 places and 0 transitions.
Iterating post reduction 1 with 243 rules applied. Total rules applied 486 place count 998 transition count 1621
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 164 Pre rules applied. Total rules applied 486 place count 998 transition count 1457
Deduced a syphon composed of 164 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 866 place count 782 transition count 1457
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 19 rules applied. Total rules applied 885 place count 772 transition count 1448
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 894 place count 763 transition count 1448
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 894 place count 763 transition count 1425
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 940 place count 740 transition count 1425
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 945 place count 735 transition count 1420
Iterating global reduction 4 with 5 rules applied. Total rules applied 950 place count 735 transition count 1420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 954 place count 735 transition count 1416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 955 place count 734 transition count 1416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 955 place count 734 transition count 1415
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 957 place count 733 transition count 1415
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 1097 place count 663 transition count 1345
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1103 place count 663 transition count 1339
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1109 place count 657 transition count 1339
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1133 place count 657 transition count 1315
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1158 place count 632 transition count 1315
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1164 place count 632 transition count 1309
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 1183 place count 632 transition count 1309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1184 place count 631 transition count 1308
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1190 place count 625 transition count 1308
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 1190 place count 625 transition count 1296
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 1220 place count 607 transition count 1296
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1226 place count 601 transition count 1290
Iterating global reduction 9 with 6 rules applied. Total rules applied 1232 place count 601 transition count 1290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1238 place count 601 transition count 1284
Applied a total of 1238 rules in 275 ms. Remains 601 /1241 variables (removed 640) and now considering 1284/1864 (removed 580) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 601/1241 places, 1284/1864 transitions.
RANDOM walk for 40000 steps (641 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (114 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 347396 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 347396 steps, saw 70997 distinct states, run finished after 3003 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 1284 rows 601 cols
[2024-06-01 01:35:38] [INFO ] Computed 92 invariants in 12 ms
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) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/189 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/238 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 294/532 variables, 50/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/556 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/556 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/557 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/601 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1284/1885 variables, 601/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1885 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1885 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1885/1885 variables, and 693 constraints, problems are : Problem set: 0 solved, 1 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 601/601 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) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/189 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/238 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 294/532 variables, 50/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/556 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/556 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/557 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/601 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1284/1885 variables, 601/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1885 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1885 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1885 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1885/1885 variables, and 694 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1411 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2042ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 161 ms.
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1284/1284 transitions.
Applied a total of 0 rules in 22 ms. Remains 601 /601 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 601/601 places, 1284/1284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1284/1284 transitions.
Applied a total of 0 rules in 21 ms. Remains 601 /601 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2024-06-01 01:35:41] [INFO ] Invariant cache hit.
[2024-06-01 01:35:42] [INFO ] Implicit Places using invariants in 941 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 349, 355, 358, 360, 361, 366, 367, 419, 436, 445, 448, 450, 451, 456, 457, 509, 526, 532, 535, 537, 538]
[2024-06-01 01:35:42] [INFO ] Actually due to overlaps returned [187, 274, 361, 451, 538, 88, 94, 99, 175, 181, 186, 262, 268, 273, 349, 355, 360, 436, 445, 450, 526, 532, 537, 71, 100, 158, 245, 332, 419, 509]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 945 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 571/601 places, 1284/1284 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 548 transition count 1261
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 548 transition count 1261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 543 transition count 1256
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 543 transition count 1256
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 80 place count 531 transition count 1244
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 97 place count 531 transition count 1227
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 114 place count 514 transition count 1227
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 514 transition count 1221
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 126 place count 508 transition count 1221
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 508 transition count 1221
Applied a total of 127 rules in 131 ms. Remains 508 /571 variables (removed 63) and now considering 1221/1284 (removed 63) transitions.
// Phase 1: matrix 1221 rows 508 cols
[2024-06-01 01:35:42] [INFO ] Computed 62 invariants in 10 ms
[2024-06-01 01:35:42] [INFO ] Implicit Places using invariants in 712 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 379, 380]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 714 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 498/601 places, 1221/1284 transitions.
Applied a total of 0 rules in 19 ms. Remains 498 /498 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1833 ms. Remains : 498/601 places, 1221/1284 transitions.
RANDOM walk for 40000 steps (734 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (148 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 284777 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 284777 steps, saw 182368 distinct states, run finished after 3006 ms. (steps per millisecond=94 ) properties seen :0
// Phase 1: matrix 1221 rows 498 cols
[2024-06-01 01:35:45] [INFO ] Computed 52 invariants in 12 ms
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) 157/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/185 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 251/436 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/458 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 40/498 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1221/1719 variables, 498/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1719 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1719 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 498/498 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) 157/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/185 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 251/436 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/458 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 40/498 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1221/1719 variables, 498/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1719 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1719 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1719 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4783 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5340ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 197 ms.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1221/1221 transitions.
Applied a total of 0 rules in 19 ms. Remains 498 /498 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 498/498 places, 1221/1221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1221/1221 transitions.
Applied a total of 0 rules in 19 ms. Remains 498 /498 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
[2024-06-01 01:35:51] [INFO ] Invariant cache hit.
[2024-06-01 01:35:52] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-06-01 01:35:52] [INFO ] Invariant cache hit.
[2024-06-01 01:35:53] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2024-06-01 01:35:53] [INFO ] Redundant transitions in 26 ms returned []
Running 1191 sub problems to find dead transitions.
[2024-06-01 01:35:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/497 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/1719 variables, and 46 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 38/41 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/497 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 3 (OVERLAPS) 1/498 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 01:36:47] [INFO ] Deduced a trap composed of 86 places in 252 ms of which 3 ms to minimize.
[2024-06-01 01:36:48] [INFO ] Deduced a trap composed of 82 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1719 variables, and 54 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 2/2 constraints]
After SMT, in 60864ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 60879ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62944 ms. Remains : 498/498 places, 1221/1221 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 20 ms. Remains 498 /498 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 01:36:54] [INFO ] Invariant cache hit.
[2024-06-01 01:36:54] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 01:36:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 01:36:54] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 25 ms returned sat
[2024-06-01 01:36:59] [INFO ] After 4978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 01:36:59] [INFO ] After 5055ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 01:37:02] [INFO ] After 7811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 7945 ms.
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 1241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Applied a total of 0 rules in 45 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2024-06-01 01:37:03] [INFO ] Computed 167 invariants in 17 ms
[2024-06-01 01:37:03] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-06-01 01:37:03] [INFO ] Invariant cache hit.
[2024-06-01 01:37:08] [INFO ] Implicit Places using invariants and state equation in 4040 ms returned []
Implicit Place search using SMT with State Equation took 5037 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2024-06-01 01:37:08] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 16.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 8.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 18.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 7.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 5.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 2.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 3.0)
(s201 1.0)
(s202 2.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 11.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 11.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 8.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 14.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 5.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 2.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 16.0)
(s371 1.0)
(s372 3.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 3.0)
(s382 1.0)
(s383 2.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 16.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 11.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 9.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 4.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 0.0)
(s525 1.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 2.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 3.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 3.0)
(s563 1.0)
(s564 0.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 0.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 16.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 11.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 7.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 8.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 12.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 2.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 3.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 3.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 2.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 16.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 9.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/3105 variables, and 118 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 118/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1863/1863 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1240/3105 variables, and 118 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 118/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1863 constraints, Known Traps: 0/0 constraints]
After SMT, in 61030ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 61053ms
Finished structural reductions in LTL mode , in 1 iterations and 66138 ms. Remains : 1241/1241 places, 1864/1864 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 40000 steps (233 resets) in 149 ms. (266 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (26 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-06-01 01:38:09] [INFO ] Invariant cache hit.
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) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 109/134 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 398/532 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 701/1233 variables, 126/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1241 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1864/3105 variables, 1241/1408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3105 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3105 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3105/3105 variables, and 1408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1335 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1241/1241 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) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 109/134 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 398/532 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 701/1233 variables, 126/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1241 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3105/3105 variables, and 1408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1419 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 129/129 constraints, State Equation: 1241/1241 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2765ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 2 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1241 transition count 1621
Reduce places removed 243 places and 0 transitions.
Iterating post reduction 1 with 243 rules applied. Total rules applied 486 place count 998 transition count 1621
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 164 Pre rules applied. Total rules applied 486 place count 998 transition count 1457
Deduced a syphon composed of 164 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 866 place count 782 transition count 1457
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 19 rules applied. Total rules applied 885 place count 772 transition count 1448
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 894 place count 763 transition count 1448
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 894 place count 763 transition count 1425
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 940 place count 740 transition count 1425
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 945 place count 735 transition count 1420
Iterating global reduction 4 with 5 rules applied. Total rules applied 950 place count 735 transition count 1420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 954 place count 735 transition count 1416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 955 place count 734 transition count 1416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 955 place count 734 transition count 1415
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 957 place count 733 transition count 1415
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 1097 place count 663 transition count 1345
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1103 place count 663 transition count 1339
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1109 place count 657 transition count 1339
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1133 place count 657 transition count 1315
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1158 place count 632 transition count 1315
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1164 place count 632 transition count 1309
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 8 with 19 rules applied. Total rules applied 1183 place count 632 transition count 1309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1184 place count 631 transition count 1308
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1190 place count 625 transition count 1308
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 1190 place count 625 transition count 1296
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 1220 place count 607 transition count 1296
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1226 place count 601 transition count 1290
Iterating global reduction 9 with 6 rules applied. Total rules applied 1232 place count 601 transition count 1290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1238 place count 601 transition count 1284
Applied a total of 1238 rules in 268 ms. Remains 601 /1241 variables (removed 640) and now considering 1284/1864 (removed 580) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 601/1241 places, 1284/1864 transitions.
RANDOM walk for 40000 steps (636 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (124 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 346138 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 346138 steps, saw 70707 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 1284 rows 601 cols
[2024-06-01 01:38:15] [INFO ] Computed 92 invariants in 12 ms
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) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/189 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/238 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 294/532 variables, 50/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/556 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/556 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/557 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/601 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1284/1885 variables, 601/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1885 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1885 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1885/1885 variables, and 693 constraints, problems are : Problem set: 0 solved, 1 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 601/601 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) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/189 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/238 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 294/532 variables, 50/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/556 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/556 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/557 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/601 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1284/1885 variables, 601/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1885 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1885 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1885 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1885/1885 variables, and 694 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2000ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 173 ms.
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1284/1284 transitions.
Applied a total of 0 rules in 21 ms. Remains 601 /601 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 601/601 places, 1284/1284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1284/1284 transitions.
Applied a total of 0 rules in 21 ms. Remains 601 /601 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2024-06-01 01:38:17] [INFO ] Invariant cache hit.
[2024-06-01 01:38:18] [INFO ] Implicit Places using invariants in 887 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 349, 355, 358, 360, 361, 366, 367, 419, 436, 445, 448, 450, 451, 456, 457, 509, 526, 532, 535, 537, 538]
[2024-06-01 01:38:18] [INFO ] Actually due to overlaps returned [187, 274, 361, 451, 538, 88, 94, 99, 175, 181, 186, 262, 268, 273, 349, 355, 360, 436, 445, 450, 526, 532, 537, 71, 100, 158, 245, 332, 419, 509]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 889 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 571/601 places, 1284/1284 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 548 transition count 1261
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 548 transition count 1261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 543 transition count 1256
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 543 transition count 1256
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 80 place count 531 transition count 1244
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 97 place count 531 transition count 1227
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 114 place count 514 transition count 1227
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 514 transition count 1221
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 126 place count 508 transition count 1221
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 508 transition count 1221
Applied a total of 127 rules in 129 ms. Remains 508 /571 variables (removed 63) and now considering 1221/1284 (removed 63) transitions.
// Phase 1: matrix 1221 rows 508 cols
[2024-06-01 01:38:18] [INFO ] Computed 62 invariants in 11 ms
[2024-06-01 01:38:19] [INFO ] Implicit Places using invariants in 689 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 379, 380]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 699 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 498/601 places, 1221/1284 transitions.
Applied a total of 0 rules in 19 ms. Remains 498 /498 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1758 ms. Remains : 498/601 places, 1221/1284 transitions.
RANDOM walk for 40000 steps (712 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (138 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 278387 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 278387 steps, saw 177791 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 1221 rows 498 cols
[2024-06-01 01:38:22] [INFO ] Computed 52 invariants in 10 ms
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) 157/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/185 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 251/436 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/458 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 40/498 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1221/1719 variables, 498/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1719 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1719 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 498/498 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) 157/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/185 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 251/436 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/458 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 40/498 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1221/1719 variables, 498/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1719 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1719 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1719 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4736 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5311ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1221/1221 transitions.
Applied a total of 0 rules in 19 ms. Remains 498 /498 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 498/498 places, 1221/1221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1221/1221 transitions.
Applied a total of 0 rules in 19 ms. Remains 498 /498 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
[2024-06-01 01:38:28] [INFO ] Invariant cache hit.
[2024-06-01 01:38:28] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-06-01 01:38:28] [INFO ] Invariant cache hit.
[2024-06-01 01:38:30] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 2071 ms to find 0 implicit places.
[2024-06-01 01:38:30] [INFO ] Redundant transitions in 26 ms returned []
Running 1191 sub problems to find dead transitions.
[2024-06-01 01:38:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/497 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/1719 variables, and 46 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 38/41 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/497 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 3 (OVERLAPS) 1/498 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 01:39:24] [INFO ] Deduced a trap composed of 86 places in 240 ms of which 3 ms to minimize.
[2024-06-01 01:39:24] [INFO ] Deduced a trap composed of 82 places in 236 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1719 variables, and 54 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 2/2 constraints]
After SMT, in 60880ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 60894ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63019 ms. Remains : 498/498 places, 1221/1221 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 18 ms. Remains 498 /498 variables (removed 0) and now considering 1221/1221 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 01:39:31] [INFO ] Invariant cache hit.
[2024-06-01 01:39:31] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 01:39:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 01:39:31] [INFO ] [Nat]Absence check using 11 positive and 41 generalized place invariants in 25 ms returned sat
[2024-06-01 01:39:36] [INFO ] After 4932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 01:39:36] [INFO ] After 5008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 01:39:39] [INFO ] After 7749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 7892 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 533 reset in 320 ms.
Product exploration explored 100000 steps with 545 reset in 344 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Performed 242 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1241 transition count 1864
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 242 place count 1241 transition count 1893
Deduced a syphon composed of 331 places in 2 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 331 place count 1241 transition count 1893
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 337 place count 1238 transition count 1893
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 372 place count 1203 transition count 1858
Deduced a syphon composed of 301 places in 3 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 407 place count 1203 transition count 1858
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 407 place count 1203 transition count 1858
Deduced a syphon composed of 302 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 408 place count 1203 transition count 1858
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 409 place count 1202 transition count 1857
Deduced a syphon composed of 301 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 place count 1202 transition count 1857
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 455 places in 2 ms
Iterating global reduction 2 with 154 rules applied. Total rules applied 564 place count 1202 transition count 1878
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 643 place count 1123 transition count 1799
Deduced a syphon composed of 376 places in 2 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 722 place count 1123 transition count 1799
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 383 places in 2 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 729 place count 1123 transition count 1839
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 384 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 730 place count 1123 transition count 1843
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 732 place count 1121 transition count 1837
Deduced a syphon composed of 382 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 734 place count 1121 transition count 1837
Deduced a syphon composed of 382 places in 2 ms
Applied a total of 734 rules in 738 ms. Remains 1121 /1241 variables (removed 120) and now considering 1837/1864 (removed 27) transitions.
[2024-06-01 01:39:41] [INFO ] Redundant transitions in 61 ms returned []
Running 1836 sub problems to find dead transitions.
// Phase 1: matrix 1837 rows 1121 cols
[2024-06-01 01:39:41] [INFO ] Computed 164 invariants in 19 ms
[2024-06-01 01:39:41] [INFO ] State equation strengthened by 30 read => feed constraints.
(s265 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 16.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 8.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 6.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 2.0)
(s117 1.0)
(s118 1.0)
(s119 18.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 8.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 6.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 3.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 16.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1120 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1120/2958 variables, and 123 constraints, problems are : Problem set: 0 solved, 1836 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/36 constraints, Generalized P Invariants (flows): 123/128 constraints, State Equation: 0/1121 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 1836/1836 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1836 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1120 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1120/2958 variables, and 123 constraints, problems are : Problem set: 0 solved, 1836 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/36 constraints, Generalized P Invariants (flows): 123/128 constraints, State Equation: 0/1121 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/1836 constraints, Known Traps: 0/0 constraints]
After SMT, in 61182ms problems are : Problem set: 0 solved, 1836 unsolved
Search for dead transitions found 0 dead transitions in 61204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1121/1241 places, 1837/1864 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62014 ms. Remains : 1121/1241 places, 1837/1864 transitions.
Support contains 4 out of 1241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Applied a total of 0 rules in 46 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2024-06-01 01:40:43] [INFO ] Computed 167 invariants in 17 ms
[2024-06-01 01:40:44] [INFO ] Implicit Places using invariants in 1079 ms returned []
[2024-06-01 01:40:44] [INFO ] Invariant cache hit.
[2024-06-01 01:40:48] [INFO ] Implicit Places using invariants and state equation in 4450 ms returned []
Implicit Place search using SMT with State Equation took 5534 ms to find 0 implicit places.
Running 1863 sub problems to find dead transitions.
[2024-06-01 01:40:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1240/3105 variables, and 118 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 118/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 1863/1863 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1863 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1240 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 1863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1240/3105 variables, and 118 constraints, problems are : Problem set: 0 solved, 1863 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/38 constraints, Generalized P Invariants (flows): 118/129 constraints, State Equation: 0/1241 constraints, PredecessorRefiner: 0/1863 constraints, Known Traps: 0/0 constraints]
After SMT, in 61043ms problems are : Problem set: 0 solved, 1863 unsolved
Search for dead transitions found 0 dead transitions in 61065ms
Finished structural reductions in LTL mode , in 1 iterations and 66650 ms. Remains : 1241/1241 places, 1864/1864 transitions.
Treatment of property ASLink-PT-06a-LTLCardinality-08 finished in 380738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 1952/1952 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1254 transition count 1712
Reduce places removed 245 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 251 rules applied. Total rules applied 490 place count 1009 transition count 1706
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 496 place count 1003 transition count 1706
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 169 Pre rules applied. Total rules applied 496 place count 1003 transition count 1537
Deduced a syphon composed of 169 places in 2 ms
Ensure Unique test removed 53 places
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 3 with 391 rules applied. Total rules applied 887 place count 781 transition count 1537
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 3 with 42 rules applied. Total rules applied 929 place count 764 transition count 1512
Reduce places removed 26 places and 0 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 4 with 28 rules applied. Total rules applied 957 place count 738 transition count 1510
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 959 place count 736 transition count 1510
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 959 place count 736 transition count 1489
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1001 place count 715 transition count 1489
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1013 place count 703 transition count 1470
Iterating global reduction 6 with 12 rules applied. Total rules applied 1025 place count 703 transition count 1470
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 10 rules applied. Total rules applied 1035 place count 703 transition count 1460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1036 place count 702 transition count 1460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1036 place count 702 transition count 1459
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1038 place count 701 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1039 place count 700 transition count 1451
Iterating global reduction 8 with 1 rules applied. Total rules applied 1040 place count 700 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1041 place count 699 transition count 1443
Iterating global reduction 8 with 1 rules applied. Total rules applied 1042 place count 699 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1043 place count 698 transition count 1435
Iterating global reduction 8 with 1 rules applied. Total rules applied 1044 place count 698 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1045 place count 697 transition count 1427
Iterating global reduction 8 with 1 rules applied. Total rules applied 1046 place count 697 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1047 place count 696 transition count 1419
Iterating global reduction 8 with 1 rules applied. Total rules applied 1048 place count 696 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1049 place count 695 transition count 1411
Iterating global reduction 8 with 1 rules applied. Total rules applied 1050 place count 695 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1051 place count 694 transition count 1403
Iterating global reduction 8 with 1 rules applied. Total rules applied 1052 place count 694 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1053 place count 693 transition count 1395
Iterating global reduction 8 with 1 rules applied. Total rules applied 1054 place count 693 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1055 place count 692 transition count 1387
Iterating global reduction 8 with 1 rules applied. Total rules applied 1056 place count 692 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1057 place count 691 transition count 1379
Iterating global reduction 8 with 1 rules applied. Total rules applied 1058 place count 691 transition count 1379
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 8 with 130 rules applied. Total rules applied 1188 place count 626 transition count 1314
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1189 place count 626 transition count 1314
Applied a total of 1189 rules in 379 ms. Remains 626 /1255 variables (removed 629) and now considering 1314/1952 (removed 638) transitions.
// Phase 1: matrix 1314 rows 626 cols
[2024-06-01 01:41:50] [INFO ] Computed 93 invariants in 12 ms
[2024-06-01 01:41:50] [INFO ] Implicit Places using invariants in 665 ms returned [72, 90, 96, 101, 161, 178, 184, 189, 191, 251, 285, 294, 346, 363, 369, 374, 376, 439, 456, 462, 467, 469, 470, 530, 547, 553, 558, 560, 623]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 667 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 597/1255 places, 1314/1952 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 597 transition count 1312
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 595 transition count 1312
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 595 transition count 1308
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 591 transition count 1308
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 22 place count 581 transition count 1298
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 581 transition count 1298
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 42 place count 571 transition count 1288
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 571 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 566 transition count 1283
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 566 transition count 1283
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 88 place count 553 transition count 1270
Applied a total of 88 rules in 100 ms. Remains 553 /597 variables (removed 44) and now considering 1270/1314 (removed 44) transitions.
// Phase 1: matrix 1270 rows 553 cols
[2024-06-01 01:41:50] [INFO ] Computed 64 invariants in 10 ms
[2024-06-01 01:41:51] [INFO ] Implicit Places using invariants in 740 ms returned [243, 249, 254]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 743 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 550/1255 places, 1270/1952 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 548 transition count 1268
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 548 transition count 1268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 546 transition count 1266
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 546 transition count 1266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 545 transition count 1265
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 545 transition count 1265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 544 transition count 1264
Applied a total of 12 rules in 85 ms. Remains 544 /550 variables (removed 6) and now considering 1264/1270 (removed 6) transitions.
// Phase 1: matrix 1264 rows 544 cols
[2024-06-01 01:41:51] [INFO ] Computed 61 invariants in 10 ms
[2024-06-01 01:41:52] [INFO ] Implicit Places using invariants in 863 ms returned []
[2024-06-01 01:41:52] [INFO ] Invariant cache hit.
[2024-06-01 01:41:54] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2894 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 544/1255 places, 1264/1952 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4868 ms. Remains : 544/1255 places, 1264/1952 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-10
Product exploration explored 100000 steps with 1334 reset in 269 ms.
Product exploration explored 100000 steps with 1409 reset in 314 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (529 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (116 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 365889 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 365889 steps, saw 282547 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-06-01 01:41:58] [INFO ] Invariant cache hit.
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) 91/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/111 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 296/407 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/435 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/510 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/528 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/544 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1264/1808 variables, 544/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1808 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1808 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1808/1808 variables, and 605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 544/544 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) 91/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/111 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 296/407 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/435 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/510 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/528 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:41:59] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/544 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1264/1808 variables, 544/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1808/1808 variables, and 607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2656ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 544 transition count 1240
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 53 place count 520 transition count 1235
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 71 place count 520 transition count 1217
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 89 place count 502 transition count 1217
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 502 transition count 1216
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 502 transition count 1216
Applied a total of 91 rules in 100 ms. Remains 502 /544 variables (removed 42) and now considering 1216/1264 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 502/544 places, 1216/1264 transitions.
RANDOM walk for 40000 steps (683 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (160 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 254199 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 254199 steps, saw 128019 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
// Phase 1: matrix 1216 rows 502 cols
[2024-06-01 01:42:04] [INFO ] Computed 61 invariants in 12 ms
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) 78/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/92 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 257/349 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/376 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 92/468 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/486 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/502 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1216/1718 variables, 502/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1718 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1718 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 563 constraints, problems are : Problem set: 0 solved, 1 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 502/502 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) 78/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/92 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 257/349 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/376 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 92/468 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/486 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/502 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1216/1718 variables, 502/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1718 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1718 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1718 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 564 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2726ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8508 steps, including 982 resets, run visited all 1 properties in 27 ms. (steps per millisecond=315 )
Parikh walk visited 1 properties in 27 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Applied a total of 0 rules in 24 ms. Remains 544 /544 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
// Phase 1: matrix 1264 rows 544 cols
[2024-06-01 01:42:07] [INFO ] Computed 61 invariants in 11 ms
[2024-06-01 01:42:07] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-06-01 01:42:07] [INFO ] Invariant cache hit.
[2024-06-01 01:42:09] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2524 ms to find 0 implicit places.
[2024-06-01 01:42:09] [INFO ] Redundant transitions in 28 ms returned []
Running 1228 sub problems to find dead transitions.
[2024-06-01 01:42:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/1808 variables, and 56 constraints, problems are : Problem set: 0 solved, 1228 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 47/49 constraints, State Equation: 0/544 constraints, PredecessorRefiner: 1228/1228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/543 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 3 (OVERLAPS) 1/544 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
[2024-06-01 01:43:06] [INFO ] Deduced a trap composed of 87 places in 472 ms of which 5 ms to minimize.
[2024-06-01 01:43:07] [INFO ] Deduced a trap composed of 94 places in 490 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/1808 variables, and 63 constraints, problems are : Problem set: 0 solved, 1228 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 0/544 constraints, PredecessorRefiner: 0/1228 constraints, Known Traps: 2/2 constraints]
After SMT, in 60818ms problems are : Problem set: 0 solved, 1228 unsolved
Search for dead transitions found 0 dead transitions in 60836ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63422 ms. Remains : 544/544 places, 1264/1264 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (529 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (113 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 367007 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 367007 steps, saw 283508 distinct states, run finished after 3004 ms. (steps per millisecond=122 ) properties seen :0
[2024-06-01 01:43:13] [INFO ] Invariant cache hit.
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) 91/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/111 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 296/407 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/435 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/510 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/528 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/544 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1264/1808 variables, 544/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1808 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1808 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1808/1808 variables, and 605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 544/544 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) 91/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/111 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 296/407 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/435 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/510 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/528 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:43:14] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/544 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1264/1808 variables, 544/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1808/1808 variables, and 607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1946 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2679ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 544 transition count 1240
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 53 place count 520 transition count 1235
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 71 place count 520 transition count 1217
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 89 place count 502 transition count 1217
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 502 transition count 1216
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 502 transition count 1216
Applied a total of 91 rules in 106 ms. Remains 502 /544 variables (removed 42) and now considering 1216/1264 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 502/544 places, 1216/1264 transitions.
RANDOM walk for 40000 steps (672 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (150 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 261720 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 261720 steps, saw 130973 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :0
// Phase 1: matrix 1216 rows 502 cols
[2024-06-01 01:43:19] [INFO ] Computed 61 invariants in 11 ms
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) 78/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/92 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 257/349 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/376 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 92/468 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/486 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/502 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1216/1718 variables, 502/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1718 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1718 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 563 constraints, problems are : Problem set: 0 solved, 1 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 502/502 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) 78/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/92 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 257/349 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/376 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 92/468 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/486 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/502 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1216/1718 variables, 502/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1718 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1718 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1718 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 564 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2712ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8397 steps, including 991 resets, run visited all 1 properties in 24 ms. (steps per millisecond=349 )
Parikh walk visited 1 properties in 26 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1442 reset in 251 ms.
Product exploration explored 100000 steps with 1377 reset in 269 ms.
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Applied a total of 0 rules in 21 ms. Remains 544 /544 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
// Phase 1: matrix 1264 rows 544 cols
[2024-06-01 01:43:23] [INFO ] Computed 61 invariants in 11 ms
[2024-06-01 01:43:24] [INFO ] Implicit Places using invariants in 670 ms returned []
[2024-06-01 01:43:24] [INFO ] Invariant cache hit.
[2024-06-01 01:43:26] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned []
Implicit Place search using SMT with State Equation took 2617 ms to find 0 implicit places.
[2024-06-01 01:43:26] [INFO ] Redundant transitions in 28 ms returned []
Running 1228 sub problems to find dead transitions.
[2024-06-01 01:43:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/1808 variables, and 56 constraints, problems are : Problem set: 0 solved, 1228 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 47/49 constraints, State Equation: 0/544 constraints, PredecessorRefiner: 1228/1228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/543 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 3 (OVERLAPS) 1/544 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
[2024-06-01 01:44:23] [INFO ] Deduced a trap composed of 87 places in 440 ms of which 5 ms to minimize.
[2024-06-01 01:44:23] [INFO ] Deduced a trap composed of 94 places in 460 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/1808 variables, and 63 constraints, problems are : Problem set: 0 solved, 1228 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 0/544 constraints, PredecessorRefiner: 0/1228 constraints, Known Traps: 2/2 constraints]
After SMT, in 60837ms problems are : Problem set: 0 solved, 1228 unsolved
Search for dead transitions found 0 dead transitions in 60854ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63530 ms. Remains : 544/544 places, 1264/1264 transitions.
Treatment of property ASLink-PT-06a-LTLCardinality-10 finished in 157336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 1952/1952 transitions.
Applied a total of 0 rules in 46 ms. Remains 1255 /1255 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1255 cols
[2024-06-01 01:44:27] [INFO ] Computed 170 invariants in 18 ms
[2024-06-01 01:44:28] [INFO ] Implicit Places using invariants in 1180 ms returned [572, 916, 936]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1182 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1252/1255 places, 1952/1952 transitions.
Applied a total of 0 rules in 56 ms. Remains 1252 /1252 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1285 ms. Remains : 1252/1255 places, 1952/1952 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-12
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-12 finished in 1423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F((X(G(p1))&&F(p2)))))))'
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 1952/1952 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 1254 transition count 1714
Reduce places removed 243 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 249 rules applied. Total rules applied 486 place count 1011 transition count 1708
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 493 place count 1005 transition count 1707
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 494 place count 1004 transition count 1707
Performed 166 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 166 Pre rules applied. Total rules applied 494 place count 1004 transition count 1541
Deduced a syphon composed of 166 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 4 with 384 rules applied. Total rules applied 878 place count 786 transition count 1541
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 42 rules applied. Total rules applied 920 place count 769 transition count 1516
Reduce places removed 26 places and 0 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 5 with 28 rules applied. Total rules applied 948 place count 743 transition count 1514
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 950 place count 741 transition count 1514
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 950 place count 741 transition count 1494
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 990 place count 721 transition count 1494
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1002 place count 709 transition count 1475
Iterating global reduction 7 with 12 rules applied. Total rules applied 1014 place count 709 transition count 1475
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 10 rules applied. Total rules applied 1024 place count 709 transition count 1465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1025 place count 708 transition count 1465
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1025 place count 708 transition count 1464
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1027 place count 707 transition count 1464
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1028 place count 706 transition count 1456
Iterating global reduction 9 with 1 rules applied. Total rules applied 1029 place count 706 transition count 1456
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1030 place count 705 transition count 1448
Iterating global reduction 9 with 1 rules applied. Total rules applied 1031 place count 705 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1032 place count 704 transition count 1440
Iterating global reduction 9 with 1 rules applied. Total rules applied 1033 place count 704 transition count 1440
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1034 place count 703 transition count 1432
Iterating global reduction 9 with 1 rules applied. Total rules applied 1035 place count 703 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1036 place count 702 transition count 1424
Iterating global reduction 9 with 1 rules applied. Total rules applied 1037 place count 702 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1038 place count 701 transition count 1416
Iterating global reduction 9 with 1 rules applied. Total rules applied 1039 place count 701 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1040 place count 700 transition count 1408
Iterating global reduction 9 with 1 rules applied. Total rules applied 1041 place count 700 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1042 place count 699 transition count 1400
Iterating global reduction 9 with 1 rules applied. Total rules applied 1043 place count 699 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1044 place count 698 transition count 1392
Iterating global reduction 9 with 1 rules applied. Total rules applied 1045 place count 698 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1046 place count 697 transition count 1384
Iterating global reduction 9 with 1 rules applied. Total rules applied 1047 place count 697 transition count 1384
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 9 with 134 rules applied. Total rules applied 1181 place count 630 transition count 1317
Applied a total of 1181 rules in 353 ms. Remains 630 /1255 variables (removed 625) and now considering 1317/1952 (removed 635) transitions.
// Phase 1: matrix 1317 rows 630 cols
[2024-06-01 01:44:28] [INFO ] Computed 94 invariants in 12 ms
[2024-06-01 01:44:29] [INFO ] Implicit Places using invariants in 713 ms returned [72, 92, 98, 103, 162, 180, 186, 191, 193, 253, 287, 296, 348, 366, 373, 378, 380, 443, 460, 466, 471, 473, 474, 534, 551, 557, 562, 564, 627]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 726 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 601/1255 places, 1317/1952 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 601 transition count 1315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 599 transition count 1315
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 599 transition count 1311
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 595 transition count 1311
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 21 place count 586 transition count 1302
Iterating global reduction 2 with 9 rules applied. Total rules applied 30 place count 586 transition count 1302
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 38 place count 578 transition count 1294
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 578 transition count 1294
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 575 transition count 1291
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 575 transition count 1291
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 78 place count 562 transition count 1278
Applied a total of 78 rules in 100 ms. Remains 562 /601 variables (removed 39) and now considering 1278/1317 (removed 39) transitions.
// Phase 1: matrix 1278 rows 562 cols
[2024-06-01 01:44:29] [INFO ] Computed 65 invariants in 12 ms
[2024-06-01 01:44:30] [INFO ] Implicit Places using invariants in 716 ms returned [248, 254, 259]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 720 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 559/1255 places, 1278/1952 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 557 transition count 1276
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 557 transition count 1276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 555 transition count 1274
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 555 transition count 1274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 554 transition count 1273
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 554 transition count 1273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 553 transition count 1272
Applied a total of 12 rules in 85 ms. Remains 553 /559 variables (removed 6) and now considering 1272/1278 (removed 6) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-06-01 01:44:30] [INFO ] Computed 62 invariants in 12 ms
[2024-06-01 01:44:31] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-06-01 01:44:31] [INFO ] Invariant cache hit.
[2024-06-01 01:44:32] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2305 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 553/1255 places, 1272/1952 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4292 ms. Remains : 553/1255 places, 1272/1952 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-13
Stuttering criterion allowed to conclude after 60 steps with 2 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-13 finished in 4471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1255/1255 places, 1952/1952 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1254 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1254 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1253 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1253 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1252 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1252 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1251 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1251 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1250 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1250 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1249 transition count 1904
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1249 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1248 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1248 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1247 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1247 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1246 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1246 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1245 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1245 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1244 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1244 transition count 1864
Applied a total of 22 rules in 555 ms. Remains 1244 /1255 variables (removed 11) and now considering 1864/1952 (removed 88) transitions.
// Phase 1: matrix 1864 rows 1244 cols
[2024-06-01 01:44:33] [INFO ] Computed 170 invariants in 17 ms
[2024-06-01 01:44:34] [INFO ] Implicit Places using invariants in 1146 ms returned [572, 916, 936]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1148 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1241/1255 places, 1864/1952 transitions.
Applied a total of 0 rules in 46 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1751 ms. Remains : 1241/1255 places, 1864/1952 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-15
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLCardinality-15 finished in 1834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&F(G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ASLink-PT-06a-LTLCardinality-02
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1255/1255 places, 1952/1952 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1255 transition count 1714
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 1017 transition count 1714
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 476 place count 1017 transition count 1558
Deduced a syphon composed of 156 places in 2 ms
Ensure Unique test removed 53 places
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 2 with 365 rules applied. Total rules applied 841 place count 808 transition count 1558
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 23 rules applied. Total rules applied 864 place count 798 transition count 1545
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 877 place count 785 transition count 1545
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 877 place count 785 transition count 1529
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 909 place count 769 transition count 1529
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 915 place count 763 transition count 1516
Iterating global reduction 4 with 6 rules applied. Total rules applied 921 place count 763 transition count 1516
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 925 place count 763 transition count 1512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 926 place count 762 transition count 1512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 926 place count 762 transition count 1511
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 928 place count 761 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 929 place count 760 transition count 1503
Iterating global reduction 6 with 1 rules applied. Total rules applied 930 place count 760 transition count 1503
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 931 place count 759 transition count 1495
Iterating global reduction 6 with 1 rules applied. Total rules applied 932 place count 759 transition count 1495
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 933 place count 758 transition count 1487
Iterating global reduction 6 with 1 rules applied. Total rules applied 934 place count 758 transition count 1487
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 935 place count 757 transition count 1479
Iterating global reduction 6 with 1 rules applied. Total rules applied 936 place count 757 transition count 1479
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 937 place count 756 transition count 1471
Iterating global reduction 6 with 1 rules applied. Total rules applied 938 place count 756 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 939 place count 755 transition count 1463
Iterating global reduction 6 with 1 rules applied. Total rules applied 940 place count 755 transition count 1463
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 941 place count 754 transition count 1455
Iterating global reduction 6 with 1 rules applied. Total rules applied 942 place count 754 transition count 1455
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 943 place count 753 transition count 1447
Iterating global reduction 6 with 1 rules applied. Total rules applied 944 place count 753 transition count 1447
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 945 place count 752 transition count 1439
Iterating global reduction 6 with 1 rules applied. Total rules applied 946 place count 752 transition count 1439
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 947 place count 751 transition count 1431
Iterating global reduction 6 with 1 rules applied. Total rules applied 948 place count 751 transition count 1431
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 144 rules applied. Total rules applied 1092 place count 679 transition count 1359
Applied a total of 1092 rules in 366 ms. Remains 679 /1255 variables (removed 576) and now considering 1359/1952 (removed 593) transitions.
// Phase 1: matrix 1359 rows 679 cols
[2024-06-01 01:44:35] [INFO ] Computed 107 invariants in 12 ms
[2024-06-01 01:44:36] [INFO ] Implicit Places using invariants in 905 ms returned [90, 96, 101, 117, 187, 193, 198, 214, 315, 316, 387, 393, 399, 418, 521, 522, 592, 598, 603, 622, 676]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 910 ms to find 21 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 658/1255 places, 1359/1952 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 658 transition count 1357
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 656 transition count 1357
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 4 place count 656 transition count 1337
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 44 place count 636 transition count 1337
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 51 place count 629 transition count 1330
Iterating global reduction 2 with 7 rules applied. Total rules applied 58 place count 629 transition count 1330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 622 transition count 1323
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 622 transition count 1323
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 618 transition count 1319
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 618 transition count 1319
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 100 place count 608 transition count 1309
Applied a total of 100 rules in 107 ms. Remains 608 /658 variables (removed 50) and now considering 1309/1359 (removed 50) transitions.
// Phase 1: matrix 1309 rows 608 cols
[2024-06-01 01:44:36] [INFO ] Computed 86 invariants in 11 ms
[2024-06-01 01:44:37] [INFO ] Implicit Places using invariants in 666 ms returned [93, 96, 177, 180, 257, 263, 268, 270, 273, 358, 361, 441, 447, 452, 454, 458, 539, 542]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 673 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 590/1255 places, 1309/1952 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 590 transition count 1303
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 584 transition count 1303
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 22 place count 574 transition count 1293
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 574 transition count 1293
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 38 place count 574 transition count 1287
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 42 place count 570 transition count 1283
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 570 transition count 1283
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 568 transition count 1281
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 568 transition count 1281
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 565 transition count 1278
Applied a total of 56 rules in 97 ms. Remains 565 /590 variables (removed 25) and now considering 1278/1309 (removed 31) transitions.
// Phase 1: matrix 1278 rows 565 cols
[2024-06-01 01:44:37] [INFO ] Computed 68 invariants in 11 ms
[2024-06-01 01:44:37] [INFO ] Implicit Places using invariants in 704 ms returned [72, 151, 231, 311, 398, 479]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 708 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 559/1255 places, 1278/1952 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 553 transition count 1272
Applied a total of 12 rules in 36 ms. Remains 553 /559 variables (removed 6) and now considering 1272/1278 (removed 6) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-06-01 01:44:37] [INFO ] Computed 62 invariants in 11 ms
[2024-06-01 01:44:38] [INFO ] Implicit Places using invariants in 688 ms returned []
[2024-06-01 01:44:38] [INFO ] Invariant cache hit.
[2024-06-01 01:44:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 01:44:40] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2590 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 4 : 553/1255 places, 1272/1952 transitions.
Finished structural reductions in LI_LTL mode , in 4 iterations and 5492 ms. Remains : 553/1255 places, 1272/1952 transitions.
Running random walk in product with property : ASLink-PT-06a-LTLCardinality-02
Product exploration explored 100000 steps with 1337 reset in 263 ms.
Product exploration explored 100000 steps with 1331 reset in 296 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (513 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (118 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 373640 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 373640 steps, saw 85414 distinct states, run finished after 3004 ms. (steps per millisecond=124 ) properties seen :0
[2024-06-01 01:44:44] [INFO ] Invariant cache hit.
[2024-06-01 01:44:44] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/117 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/525 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/553 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1272/1825 variables, 553/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1825 variables, 6/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1825 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1825 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1825/1825 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 553/553 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/117 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/525 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/553 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1272/1825 variables, 553/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1825 variables, 6/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1825 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1825 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:44:46] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/1825 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1825 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1825 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1825/1825 variables, and 623 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1781 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 553/553 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2383ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 233 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 553 transition count 1248
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 54 place count 529 transition count 1242
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 529 transition count 1225
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 88 place count 512 transition count 1225
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 512 transition count 1225
Applied a total of 90 rules in 91 ms. Remains 512 /553 variables (removed 41) and now considering 1225/1272 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 512/553 places, 1225/1272 transitions.
RANDOM walk for 40000 steps (702 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (148 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 251305 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 251305 steps, saw 146454 distinct states, run finished after 3006 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 1225 rows 512 cols
[2024-06-01 01:44:50] [INFO ] Computed 62 invariants in 11 ms
[2024-06-01 01:44:50] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/104 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/450 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/512 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1737 variables, 512/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1737 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1737/1737 variables, and 580 constraints, problems are : Problem set: 0 solved, 1 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 512/512 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/104 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/450 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/512 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1737 variables, 512/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1737 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1737 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1737/1737 variables, and 581 constraints, problems are : Problem set: 0 solved, 1 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 512/512 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1630ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 220 ms.
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 19 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 512/512 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 20 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 01:44:52] [INFO ] Invariant cache hit.
[2024-06-01 01:44:52] [INFO ] Implicit Places using invariants in 663 ms returned [89, 90, 160, 161, 231, 232, 382, 383]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 687 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 504/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 736 ms. Remains : 504/512 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (661 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (144 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 262664 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 262664 steps, saw 153503 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
// Phase 1: matrix 1225 rows 504 cols
[2024-06-01 01:44:55] [INFO ] Computed 54 invariants in 11 ms
[2024-06-01 01:44:55] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/123 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/469 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/504 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1729 variables, 504/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 6/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1729 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 564 constraints, problems are : Problem set: 0 solved, 1 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 504/504 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/123 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:44:56] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 346/469 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 35/504 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1225/1729 variables, 504/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 6/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1729 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1729 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1729/1729 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 504/504 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1658ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 230 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 504/504 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 01:44:57] [INFO ] Invariant cache hit.
[2024-06-01 01:44:58] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-06-01 01:44:58] [INFO ] Invariant cache hit.
[2024-06-01 01:44:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 01:45:00] [INFO ] Implicit Places using invariants and state equation in 2325 ms returned []
Implicit Place search using SMT with State Equation took 2997 ms to find 0 implicit places.
[2024-06-01 01:45:00] [INFO ] Redundant transitions in 26 ms returned []
Running 1224 sub problems to find dead transitions.
[2024-06-01 01:45:00] [INFO ] Invariant cache hit.
[2024-06-01 01:45:00] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/1729 variables, and 54 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/504 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 01:45:55] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 3 ms to minimize.
[2024-06-01 01:45:58] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/1729 variables, and 56 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/504 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 2/2 constraints]
After SMT, in 60919ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 60934ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63985 ms. Remains : 504/504 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 01:46:01] [INFO ] Invariant cache hit.
[2024-06-01 01:46:01] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 01:46:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 01:46:01] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 28 ms returned sat
[2024-06-01 01:46:02] [INFO ] After 868ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 01:46:02] [INFO ] After 963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 01:46:03] [INFO ] After 1163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1300 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Applied a total of 0 rules in 21 ms. Remains 553 /553 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-06-01 01:46:03] [INFO ] Computed 62 invariants in 11 ms
[2024-06-01 01:46:03] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-06-01 01:46:03] [INFO ] Invariant cache hit.
[2024-06-01 01:46:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 01:46:05] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2570 ms to find 0 implicit places.
[2024-06-01 01:46:05] [INFO ] Redundant transitions in 29 ms returned []
Running 1271 sub problems to find dead transitions.
[2024-06-01 01:46:05] [INFO ] Invariant cache hit.
[2024-06-01 01:46:05] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 2 (OVERLAPS) 1/553 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1825 variables, and 62 constraints, problems are : Problem set: 0 solved, 1271 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/553 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1271/1271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 2 (OVERLAPS) 1/553 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/1825 variables, and 62 constraints, problems are : Problem set: 0 solved, 1271 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/553 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1271 constraints, Known Traps: 0/0 constraints]
After SMT, in 60870ms problems are : Problem set: 0 solved, 1271 unsolved
Search for dead transitions found 0 dead transitions in 60884ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63514 ms. Remains : 553/553 places, 1272/1272 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (538 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (117 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 372772 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 372772 steps, saw 85172 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-06-01 01:47:09] [INFO ] Invariant cache hit.
[2024-06-01 01:47:09] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/117 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/525 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/553 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1272/1825 variables, 553/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1825 variables, 6/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1825 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1825 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1825/1825 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 553/553 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/117 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/525 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/553 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1272/1825 variables, 553/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1825 variables, 6/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1825 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1825 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:47:12] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/1825 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1825 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1825 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1825/1825 variables, and 623 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1721 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 553/553 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2335ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 229 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 553 transition count 1248
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 54 place count 529 transition count 1242
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 529 transition count 1225
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 88 place count 512 transition count 1225
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 512 transition count 1225
Applied a total of 90 rules in 83 ms. Remains 512 /553 variables (removed 41) and now considering 1225/1272 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 512/553 places, 1225/1272 transitions.
RANDOM walk for 40000 steps (632 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (135 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 251780 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 251780 steps, saw 146728 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 1225 rows 512 cols
[2024-06-01 01:47:15] [INFO ] Computed 62 invariants in 11 ms
[2024-06-01 01:47:15] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/104 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/450 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/512 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1737 variables, 512/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1737 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1737/1737 variables, and 580 constraints, problems are : Problem set: 0 solved, 1 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 512/512 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/104 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/450 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/512 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1737 variables, 512/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1737 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1737 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1737 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1737 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1737/1737 variables, and 581 constraints, problems are : Problem set: 0 solved, 1 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 512/512 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 212 ms.
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 20 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 512/512 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 20 ms. Remains 512 /512 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 01:47:17] [INFO ] Invariant cache hit.
[2024-06-01 01:47:18] [INFO ] Implicit Places using invariants in 597 ms returned [89, 90, 160, 161, 231, 232, 382, 383]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 598 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 504/512 places, 1225/1225 transitions.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 638 ms. Remains : 504/512 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (705 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (146 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 258811 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 258811 steps, saw 151004 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
// Phase 1: matrix 1225 rows 504 cols
[2024-06-01 01:47:21] [INFO ] Computed 54 invariants in 11 ms
[2024-06-01 01:47:21] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/123 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/469 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/504 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1225/1729 variables, 504/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1729 variables, 6/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1729 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 564 constraints, problems are : Problem set: 0 solved, 1 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 504/504 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/123 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 01:47:21] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 346/469 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 35/504 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1225/1729 variables, 504/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1729 variables, 6/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1729 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1729 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1729/1729 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 504/504 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1612ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 252 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 504/504 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1225/1225 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2024-06-01 01:47:23] [INFO ] Invariant cache hit.
[2024-06-01 01:47:23] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-06-01 01:47:23] [INFO ] Invariant cache hit.
[2024-06-01 01:47:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 01:47:25] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2530 ms to find 0 implicit places.
[2024-06-01 01:47:25] [INFO ] Redundant transitions in 27 ms returned []
Running 1224 sub problems to find dead transitions.
[2024-06-01 01:47:25] [INFO ] Invariant cache hit.
[2024-06-01 01:47:25] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/1729 variables, and 54 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/504 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 01:48:20] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 4 ms to minimize.
[2024-06-01 01:48:23] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/1729 variables, and 56 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/504 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 2/2 constraints]
After SMT, in 60897ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 60912ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63495 ms. Remains : 504/504 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 01:48:26] [INFO ] Invariant cache hit.
[2024-06-01 01:48:26] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 01:48:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 01:48:26] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 22 ms returned sat
[2024-06-01 01:48:27] [INFO ] After 837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 01:48:27] [INFO ] After 931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 01:48:27] [INFO ] After 1121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1273 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1320 reset in 263 ms.
Product exploration explored 100000 steps with 1328 reset in 294 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 1272/1272 transitions.
Applied a total of 0 rules in 20 ms. Remains 553 /553 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
// Phase 1: matrix 1272 rows 553 cols
[2024-06-01 01:48:28] [INFO ] Computed 62 invariants in 11 ms
[2024-06-01 01:48:29] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-06-01 01:48:29] [INFO ] Invariant cache hit.
[2024-06-01 01:48:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 01:48:31] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 2570 ms to find 0 implicit places.
[2024-06-01 01:48:31] [INFO ] Redundant transitions in 28 ms returned []
Running 1271 sub problems to find dead transitions.
[2024-06-01 01:48:31] [INFO ] Invariant cache hit.
[2024-06-01 01:48:31] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 2 (OVERLAPS) 1/553 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1825 variables, and 62 constraints, problems are : Problem set: 0 solved, 1271 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/553 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1271/1271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 2 (OVERLAPS) 1/553 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/1825 variables, and 62 constraints, problems are : Problem set: 0 solved, 1271 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/553 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1271 constraints, Known Traps: 0/0 constraints]
After SMT, in 60845ms problems are : Problem set: 0 solved, 1271 unsolved
Search for dead transitions found 0 dead transitions in 60861ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63491 ms. Remains : 553/553 places, 1272/1272 transitions.
Treatment of property ASLink-PT-06a-LTLCardinality-02 finished in 297281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 01:49:32] [INFO ] Flatten gal took : 116 ms
[2024-06-01 01:49:32] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 01:49:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1255 places, 1952 transitions and 6852 arcs took 24 ms.
Total runtime 1635545 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-06a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-06a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117800091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06a.tgz
mv ASLink-PT-06a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;