MCC'2024- Execution of r464-smll-171620117700067

About the Execution of LTSMin+red for ASLink-PT-04b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2029.323	2704741.00	5757394.00	4506.20	FFFFTFTFFFF?TFFF	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-171620117700067.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-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K 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 57K 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:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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 669K 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-04b-LTLCardinality-00
FORMULA_NAME ASLink-PT-04b-LTLCardinality-01
FORMULA_NAME ASLink-PT-04b-LTLCardinality-02
FORMULA_NAME ASLink-PT-04b-LTLCardinality-03
FORMULA_NAME ASLink-PT-04b-LTLCardinality-04
FORMULA_NAME ASLink-PT-04b-LTLCardinality-05
FORMULA_NAME ASLink-PT-04b-LTLCardinality-06
FORMULA_NAME ASLink-PT-04b-LTLCardinality-07
FORMULA_NAME ASLink-PT-04b-LTLCardinality-08
FORMULA_NAME ASLink-PT-04b-LTLCardinality-09
FORMULA_NAME ASLink-PT-04b-LTLCardinality-10
FORMULA_NAME ASLink-PT-04b-LTLCardinality-11
FORMULA_NAME ASLink-PT-04b-LTLCardinality-12
FORMULA_NAME ASLink-PT-04b-LTLCardinality-13
FORMULA_NAME ASLink-PT-04b-LTLCardinality-14
FORMULA_NAME ASLink-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717194005482

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-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:20:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:20:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:20:07] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2024-05-31 22:20:07] [INFO ] Transformed 2034 places.
[2024-05-31 22:20:07] [INFO ] Transformed 2567 transitions.
[2024-05-31 22:20:07] [INFO ] Found NUPN structural information;
[2024-05-31 22:20:07] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 511 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-04b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2034 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Discarding 124 places :
Symmetric choice reduction at 0 with 124 rule applications. Total rules 124 place count 1910 transition count 2443
Iterating global reduction 0 with 124 rules applied. Total rules applied 248 place count 1910 transition count 2443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 249 place count 1910 transition count 2442
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 297 place count 1862 transition count 2366
Iterating global reduction 1 with 48 rules applied. Total rules applied 345 place count 1862 transition count 2366
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 360 place count 1862 transition count 2351
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 368 place count 1854 transition count 2343
Iterating global reduction 2 with 8 rules applied. Total rules applied 376 place count 1854 transition count 2343
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 380 place count 1850 transition count 2332
Iterating global reduction 2 with 4 rules applied. Total rules applied 384 place count 1850 transition count 2332
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 387 place count 1847 transition count 2329
Iterating global reduction 2 with 3 rules applied. Total rules applied 390 place count 1847 transition count 2329
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 393 place count 1844 transition count 2319
Iterating global reduction 2 with 3 rules applied. Total rules applied 396 place count 1844 transition count 2319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 1843 transition count 2311
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 1843 transition count 2311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 1842 transition count 2310
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 1842 transition count 2310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 1841 transition count 2302
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 1841 transition count 2302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 403 place count 1840 transition count 2294
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 1840 transition count 2294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 405 place count 1839 transition count 2293
Iterating global reduction 2 with 1 rules applied. Total rules applied 406 place count 1839 transition count 2293
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 407 place count 1838 transition count 2285
Iterating global reduction 2 with 1 rules applied. Total rules applied 408 place count 1838 transition count 2285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 409 place count 1837 transition count 2277
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 place count 1837 transition count 2277
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 411 place count 1836 transition count 2276
Iterating global reduction 2 with 1 rules applied. Total rules applied 412 place count 1836 transition count 2276
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 413 place count 1835 transition count 2268
Iterating global reduction 2 with 1 rules applied. Total rules applied 414 place count 1835 transition count 2268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 415 place count 1834 transition count 2260
Iterating global reduction 2 with 1 rules applied. Total rules applied 416 place count 1834 transition count 2260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 417 place count 1833 transition count 2259
Iterating global reduction 2 with 1 rules applied. Total rules applied 418 place count 1833 transition count 2259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 419 place count 1832 transition count 2251
Iterating global reduction 2 with 1 rules applied. Total rules applied 420 place count 1832 transition count 2251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 421 place count 1831 transition count 2243
Iterating global reduction 2 with 1 rules applied. Total rules applied 422 place count 1831 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 423 place count 1830 transition count 2242
Iterating global reduction 2 with 1 rules applied. Total rules applied 424 place count 1830 transition count 2242
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 425 place count 1829 transition count 2234
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 1829 transition count 2234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 427 place count 1828 transition count 2226
Iterating global reduction 2 with 1 rules applied. Total rules applied 428 place count 1828 transition count 2226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 429 place count 1827 transition count 2225
Iterating global reduction 2 with 1 rules applied. Total rules applied 430 place count 1827 transition count 2225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 431 place count 1826 transition count 2217
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 1826 transition count 2217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 433 place count 1825 transition count 2209
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 1825 transition count 2209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 435 place count 1824 transition count 2208
Iterating global reduction 2 with 1 rules applied. Total rules applied 436 place count 1824 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 437 place count 1823 transition count 2200
Iterating global reduction 2 with 1 rules applied. Total rules applied 438 place count 1823 transition count 2200
Applied a total of 438 rules in 4684 ms. Remains 1823 /2034 variables (removed 211) and now considering 2200/2567 (removed 367) transitions.
// Phase 1: matrix 2200 rows 1823 cols
[2024-05-31 22:20:13] [INFO ] Computed 199 invariants in 263 ms
[2024-05-31 22:20:14] [INFO ] Implicit Places using invariants in 2067 ms returned [1657, 1668, 1679, 1687, 1695, 1703, 1711, 1722, 1730, 1738, 1749]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2123 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1812/2034 places, 2200/2567 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1799 transition count 2187
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1799 transition count 2187
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1789 transition count 2177
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1789 transition count 2177
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 1781 transition count 2169
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 1781 transition count 2169
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1777 transition count 2165
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1777 transition count 2165
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 1775 transition count 2163
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 1775 transition count 2163
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 1773 transition count 2161
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 1773 transition count 2161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 1771 transition count 2159
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1771 transition count 2159
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 1769 transition count 2157
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1769 transition count 2157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1768 transition count 2156
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1768 transition count 2156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1767 transition count 2155
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1767 transition count 2155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1766 transition count 2154
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1766 transition count 2154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 1765 transition count 2153
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1765 transition count 2153
Applied a total of 94 rules in 1171 ms. Remains 1765 /1812 variables (removed 47) and now considering 2153/2200 (removed 47) transitions.
// Phase 1: matrix 2153 rows 1765 cols
[2024-05-31 22:20:16] [INFO ] Computed 188 invariants in 45 ms
[2024-05-31 22:20:17] [INFO ] Implicit Places using invariants in 1558 ms returned []
[2024-05-31 22:20:17] [INFO ] Invariant cache hit.
[2024-05-31 22:20:24] [INFO ] Implicit Places using invariants and state equation in 6870 ms returned []
Implicit Place search using SMT with State Equation took 8441 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1765/2034 places, 2153/2567 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16455 ms. Remains : 1765/2034 places, 2153/2567 transitions.
Support contains 29 out of 1765 places after structural reductions.
[2024-05-31 22:20:25] [INFO ] Flatten gal took : 264 ms
[2024-05-31 22:20:25] [INFO ] Flatten gal took : 158 ms
[2024-05-31 22:20:25] [INFO ] Input system was already deterministic with 2153 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (97 resets) in 2318 ms. (17 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40003 steps (13 resets) in 407 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 225 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
[2024-05-31 22:20:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 120/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 433/562 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1167/1729 variables, 137/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1729 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 36/1765 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1765 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2153/3918 variables, 1765/1953 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3918 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/3918 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3918/3918 variables, and 1953 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3298 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 1765/1765 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 120/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 433/562 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1167/1729 variables, 137/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 24 places in 599 ms of which 49 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1729 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1729 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 36/1765 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1765 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2153/3918 variables, 1765/1954 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3918 variables, 5/1959 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3918/3918 variables, and 1959 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 1765/1765 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 8373ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 1765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 1765 transition count 1831
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 325 rules applied. Total rules applied 647 place count 1443 transition count 1828
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 649 place count 1441 transition count 1828
Performed 470 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 470 Pre rules applied. Total rules applied 649 place count 1441 transition count 1358
Deduced a syphon composed of 470 places in 3 ms
Ensure Unique test removed 43 places
Reduce places removed 513 places and 0 transitions.
Iterating global reduction 3 with 983 rules applied. Total rules applied 1632 place count 928 transition count 1358
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 32 rules applied. Total rules applied 1664 place count 923 transition count 1331
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1691 place count 896 transition count 1331
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1691 place count 896 transition count 1315
Deduced a syphon composed of 16 places in 3 ms
Ensure Unique test removed 16 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1739 place count 864 transition count 1315
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 1739 place count 864 transition count 1300
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1769 place count 849 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1770 place count 848 transition count 1299
Iterating global reduction 5 with 1 rules applied. Total rules applied 1771 place count 848 transition count 1299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1771 place count 848 transition count 1298
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1773 place count 847 transition count 1298
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 5 with 291 rules applied. Total rules applied 2064 place count 701 transition count 1153
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2068 place count 697 transition count 1149
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2073 place count 696 transition count 1149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2073 place count 696 transition count 1148
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2075 place count 695 transition count 1148
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2077 place count 693 transition count 1146
Iterating global reduction 5 with 2 rules applied. Total rules applied 2079 place count 693 transition count 1146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2081 place count 693 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2082 place count 692 transition count 1144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2084 place count 691 transition count 1149
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 2089 place count 691 transition count 1144
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2094 place count 686 transition count 1144
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2098 place count 686 transition count 1140
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2102 place count 682 transition count 1140
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2105 place count 682 transition count 1140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2106 place count 681 transition count 1139
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 10 rules applied. Total rules applied 2116 place count 674 transition count 1136
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2119 place count 671 transition count 1136
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 10 Pre rules applied. Total rules applied 2119 place count 671 transition count 1126
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 2139 place count 661 transition count 1126
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 11 with 4 rules applied. Total rules applied 2143 place count 657 transition count 1126
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 12 with 16 rules applied. Total rules applied 2159 place count 649 transition count 1118
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2163 place count 645 transition count 1114
Iterating global reduction 12 with 4 rules applied. Total rules applied 2167 place count 645 transition count 1114
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 2171 place count 645 transition count 1110
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2175 place count 641 transition count 1110
Applied a total of 2175 rules in 888 ms. Remains 641 /1765 variables (removed 1124) and now considering 1110/2153 (removed 1043) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 890 ms. Remains : 641/1765 places, 1110/2153 transitions.
RANDOM walk for 40000 steps (506 resets) in 626 ms. (63 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (113 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (121 resets) in 229 ms. (173 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (118 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (106 resets) in 186 ms. (213 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (114 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 226790 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 5
Probabilistic random walk after 226790 steps, saw 49346 distinct states, run finished after 3009 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 1110 rows 641 cols
[2024-05-31 22:20:40] [INFO ] Computed 111 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 72/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/99 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/100 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 315/415 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 58/473 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4/477 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 135/612 variables, 37/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 4/616 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/616 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 23/639 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/639 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/641 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1110/1751 variables, 641/752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1751 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/1751 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1751/1751 variables, and 752 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1463 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 78/78 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 72/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/99 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/100 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 315/415 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 58/473 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4/477 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 135/612 variables, 37/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 4/616 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/616 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 23/639 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/639 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/641 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1110/1751 variables, 641/752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1751 variables, 5/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1751 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/1751 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1751/1751 variables, and 757 constraints, problems are : Problem set: 0 solved, 5 unsolved in 10946 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 78/78 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 12462ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 15005 ms.
Support contains 7 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1110/1110 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 641 transition count 1109
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 640 transition count 1109
Applied a total of 2 rules in 32 ms. Remains 640 /641 variables (removed 1) and now considering 1109/1110 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 640/641 places, 1109/1110 transitions.
RANDOM walk for 40000 steps (515 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (111 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (117 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (109 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (110 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 211007 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 4
Probabilistic random walk after 211007 steps, saw 46543 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 1109 rows 640 cols
[2024-05-31 22:21:10] [INFO ] Computed 111 invariants in 20 ms
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/62 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 171/234 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 43/277 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 17/294 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 168/462 variables, 33/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 37/499 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/499 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/502 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 122/624 variables, 21/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/624 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/626 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/626 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 14/640 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/640 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1109/1749 variables, 640/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1749 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/1749 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1749/1749 variables, and 751 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1313 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 78/78 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/62 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 171/234 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 43/277 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 17/294 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 168/462 variables, 33/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 37/499 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/499 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/502 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/502 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 122/624 variables, 21/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/624 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/626 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/626 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 14/640 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/640 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1109/1749 variables, 640/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1749 variables, 4/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1749 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/1749 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1749/1749 variables, and 755 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7081 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 78/78 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8457ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 36136 steps, including 1530 resets, run visited all 4 properties in 306 ms. (steps per millisecond=118 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 318 ms.
Computed a total of 72 stabilizing places and 72 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((F(p0)&&F(G((p1 U (G(!p1)||p2)))))))'
Support contains 5 out of 1765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 1764 transition count 1838
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 317 rules applied. Total rules applied 631 place count 1450 transition count 1835
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 634 place count 1448 transition count 1834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 635 place count 1447 transition count 1834
Performed 474 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 474 Pre rules applied. Total rules applied 635 place count 1447 transition count 1360
Deduced a syphon composed of 474 places in 3 ms
Ensure Unique test removed 43 places
Reduce places removed 517 places and 0 transitions.
Iterating global reduction 4 with 991 rules applied. Total rules applied 1626 place count 930 transition count 1360
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 4 with 32 rules applied. Total rules applied 1658 place count 926 transition count 1332
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 1686 place count 898 transition count 1332
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1686 place count 898 transition count 1316
Deduced a syphon composed of 16 places in 3 ms
Ensure Unique test removed 15 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 47 rules applied. Total rules applied 1733 place count 867 transition count 1316
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 1733 place count 867 transition count 1302
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 1761 place count 853 transition count 1302
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1763 place count 851 transition count 1300
Iterating global reduction 6 with 2 rules applied. Total rules applied 1765 place count 851 transition count 1300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1765 place count 851 transition count 1299
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 1767 place count 850 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1768 place count 849 transition count 1298
Iterating global reduction 6 with 1 rules applied. Total rules applied 1769 place count 849 transition count 1298
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 6 with 291 rules applied. Total rules applied 2060 place count 702 transition count 1154
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2064 place count 698 transition count 1150
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2069 place count 697 transition count 1150
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2070 place count 697 transition count 1149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2071 place count 696 transition count 1149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2071 place count 696 transition count 1148
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 2073 place count 695 transition count 1148
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2075 place count 693 transition count 1146
Iterating global reduction 8 with 2 rules applied. Total rules applied 2077 place count 693 transition count 1146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2079 place count 693 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2080 place count 692 transition count 1144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2082 place count 691 transition count 1149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2084 place count 689 transition count 1147
Reduce places removed 8 places and 0 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 10 with 12 rules applied. Total rules applied 2096 place count 681 transition count 1143
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2100 place count 677 transition count 1143
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 12 Pre rules applied. Total rules applied 2100 place count 677 transition count 1131
Deduced a syphon composed of 12 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 25 rules applied. Total rules applied 2125 place count 664 transition count 1131
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 12 with 9 rules applied. Total rules applied 2134 place count 655 transition count 1131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2134 place count 655 transition count 1130
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2136 place count 654 transition count 1130
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 13 with 26 rules applied. Total rules applied 2162 place count 641 transition count 1117
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 2170 place count 633 transition count 1109
Iterating global reduction 13 with 8 rules applied. Total rules applied 2178 place count 633 transition count 1109
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 2182 place count 629 transition count 1105
Iterating global reduction 13 with 4 rules applied. Total rules applied 2186 place count 629 transition count 1105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 2190 place count 629 transition count 1101
Applied a total of 2190 rules in 674 ms. Remains 629 /1765 variables (removed 1136) and now considering 1101/2153 (removed 1052) transitions.
// Phase 1: matrix 1101 rows 629 cols
[2024-05-31 22:21:20] [INFO ] Computed 104 invariants in 12 ms
[2024-05-31 22:21:22] [INFO ] Implicit Places using invariants in 1401 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 259, 260, 272, 273, 275, 292, 310, 330, 372, 385, 386, 398, 399, 401, 418, 436, 456, 507, 508, 511, 522, 523, 524, 542, 563, 564, 565, 566]
[2024-05-31 22:21:22] [INFO ] Actually due to overlaps returned [542, 524, 48, 167, 292, 418, 31, 147, 150, 272, 275, 398, 401, 522, 563, 148, 273, 399, 523, 564, 1, 18, 259, 260, 385, 386, 507, 508, 565, 19, 66, 86, 137, 185, 205, 310, 330, 436, 456, 511, 566]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1413 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/1765 places, 1101/2153 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 586 transition count 1030
Reduce places removed 71 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 515 transition count 1028
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 148 place count 513 transition count 1028
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 148 place count 513 transition count 1005
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 195 place count 489 transition count 1005
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 207 place count 485 transition count 997
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 215 place count 477 transition count 997
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 218 place count 474 transition count 994
Iterating global reduction 5 with 3 rules applied. Total rules applied 221 place count 474 transition count 994
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 224 place count 474 transition count 991
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 290 place count 441 transition count 958
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 294 place count 439 transition count 959
Applied a total of 294 rules in 77 ms. Remains 439 /588 variables (removed 149) and now considering 959/1101 (removed 142) transitions.
// Phase 1: matrix 959 rows 439 cols
[2024-05-31 22:21:22] [INFO ] Computed 56 invariants in 9 ms
[2024-05-31 22:21:23] [INFO ] Implicit Places using invariants in 796 ms returned [88, 94, 99, 174, 180, 266, 279, 356, 362, 367, 436]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 810 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 428/1765 places, 959/2153 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 428 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 427 transition count 958
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 421 transition count 952
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 421 transition count 952
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 415 transition count 946
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 415 transition count 946
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 412 transition count 943
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 412 transition count 943
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 2 with 8 rules applied. Total rules applied 40 place count 408 transition count 939
Applied a total of 40 rules in 65 ms. Remains 408 /428 variables (removed 20) and now considering 939/959 (removed 20) transitions.
// Phase 1: matrix 939 rows 408 cols
[2024-05-31 22:21:23] [INFO ] Computed 45 invariants in 9 ms
[2024-05-31 22:21:23] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-31 22:21:23] [INFO ] Invariant cache hit.
[2024-05-31 22:21:24] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1675 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 408/1765 places, 939/2153 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4716 ms. Remains : 408/1765 places, 939/2153 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-00
Product exploration explored 100000 steps with 1815 reset in 486 ms.
Product exploration explored 100000 steps with 1760 reset in 400 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 p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 11 factoid took 367 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
RANDOM walk for 40000 steps (631 resets) in 359 ms. (111 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (132 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
[2024-05-31 22:21:27] [INFO ] Invariant cache hit.
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) 42/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 241/287 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/313 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/408 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 939/1347 variables, 408/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1347 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1347 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1347/1347 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 408/408 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) 42/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 241/287 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/313 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Int declared 408/1347 variables, and 45 constraints, problems are : Problem set: 1 solved, 0 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/408 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 612ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 12 factoid took 472 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 4 out of 408 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 : 408/408 places, 939/939 transitions.
Applied a total of 0 rules in 16 ms. Remains 408 /408 variables (removed 0) and now considering 939/939 (removed 0) transitions.
[2024-05-31 22:21:28] [INFO ] Invariant cache hit.
[2024-05-31 22:21:28] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-31 22:21:28] [INFO ] Invariant cache hit.
[2024-05-31 22:21:29] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
[2024-05-31 22:21:30] [INFO ] Redundant transitions in 64 ms returned []
Running 906 sub problems to find dead transitions.
[2024-05-31 22:21:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (OVERLAPS) 2/405 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/1347 variables, and 36 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/408 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (OVERLAPS) 2/405 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 7 (OVERLAPS) 3/408 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 90 places in 363 ms of which 4 ms to minimize.
[2024-05-31 22:22:28] [INFO ] Deduced a trap composed of 100 places in 335 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/1347 variables, and 48 constraints, problems are : Problem set: 0 solved, 906 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/408 constraints, PredecessorRefiner: 0/906 constraints, Known Traps: 3/3 constraints]
After SMT, in 60810ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 60830ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62545 ms. Remains : 408/408 places, 939/939 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 2286 steps (33 resets) in 20 ms. (108 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 1811 reset in 238 ms.
Product exploration explored 100000 steps with 1875 reset in 259 ms.
Support contains 4 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 939/939 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 408 transition count 938
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 407 transition count 938
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 406 transition count 937
Applied a total of 4 rules in 61 ms. Remains 406 /408 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 406 cols
[2024-05-31 22:22:32] [INFO ] Computed 45 invariants in 9 ms
[2024-05-31 22:22:33] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2024-05-31 22:22:33] [INFO ] Invariant cache hit.
[2024-05-31 22:22:34] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
[2024-05-31 22:22:34] [INFO ] Redundant transitions in 142 ms returned []
Running 904 sub problems to find dead transitions.
[2024-05-31 22:22:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 3 (OVERLAPS) 2/403 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 904 unsolved
[2024-05-31 22:23:01] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 14 ms to minimize.
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 403/1343 variables, and 36 constraints, problems are : Problem set: 0 solved, 904 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/406 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 904 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 3 (OVERLAPS) 2/403 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 7 (OVERLAPS) 3/406 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 904 unsolved
[2024-05-31 22:23:31] [INFO ] Deduced a trap composed of 120 places in 342 ms of which 10 ms to minimize.
[2024-05-31 22:23:32] [INFO ] Deduced a trap composed of 83 places in 309 ms of which 4 ms to minimize.
[2024-05-31 22:23:34] [INFO ] Deduced a trap composed of 71 places in 280 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1343 variables, and 49 constraints, problems are : Problem set: 0 solved, 904 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/406 constraints, PredecessorRefiner: 0/904 constraints, Known Traps: 4/4 constraints]
After SMT, in 60675ms problems are : Problem set: 0 solved, 904 unsolved
Search for dead transitions found 0 dead transitions in 60695ms
Starting structural reductions in SI_LTL mode, iteration 1 : 406/408 places, 937/939 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63060 ms. Remains : 406/408 places, 937/939 transitions.
Treatment of property ASLink-PT-04b-LTLCardinality-00 finished in 135698 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((p0||X(p1))))))'
Support contains 6 out of 1765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1762 transition count 2150
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1762 transition count 2150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1761 transition count 2149
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1761 transition count 2149
Applied a total of 8 rules in 316 ms. Remains 1761 /1765 variables (removed 4) and now considering 2149/2153 (removed 4) transitions.
// Phase 1: matrix 2149 rows 1761 cols
[2024-05-31 22:23:36] [INFO ] Computed 188 invariants in 28 ms
[2024-05-31 22:23:37] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2024-05-31 22:23:37] [INFO ] Invariant cache hit.
[2024-05-31 22:23:42] [INFO ] Implicit Places using invariants and state equation in 5187 ms returned []
Implicit Place search using SMT with State Equation took 6324 ms to find 0 implicit places.
Running 2148 sub problems to find dead transitions.
[2024-05-31 22:23:42] [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 13.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 6.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 3.0)
(s48 6.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 18.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 timeout
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 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 0.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 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 1.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 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 23.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 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 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.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 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 4.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 13.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 13.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 10.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 4.0)
(s413 1.0)
(s414 93.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 2148/2148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 0/2148 constraints, Known Traps: 0/0 constraints]
After SMT, in 61103ms problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 61133ms
Starting structural reductions in LTL mode, iteration 1 : 1761/1765 places, 2149/2153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67782 ms. Remains : 1761/1765 places, 2149/2153 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-02
Product exploration explored 100000 steps with 2587 reset in 518 ms.
Product exploration explored 100000 steps with 2560 reset in 363 ms.
Computed a total of 71 stabilizing places and 71 stable transitions
Computed a total of 71 stabilizing places and 71 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 35941 steps (77 resets) in 305 ms. (117 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 22:24:45] [INFO ] Invariant cache hit.
[2024-05-31 22:24:47] [INFO ] [Real]Absence check using 46 positive place invariants in 53 ms returned sat
[2024-05-31 22:24:48] [INFO ] [Real]Absence check using 46 positive and 142 generalized place invariants in 910 ms returned sat
[2024-05-31 22:25:00] [INFO ] [Real]Absence check using state equation in 12006 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 1761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1761/1761 places, 2149/2149 transitions.
Applied a total of 0 rules in 91 ms. Remains 1761 /1761 variables (removed 0) and now considering 2149/2149 (removed 0) transitions.
[2024-05-31 22:25:00] [INFO ] Invariant cache hit.
[2024-05-31 22:25:02] [INFO ] Implicit Places using invariants in 1178 ms returned []
[2024-05-31 22:25:02] [INFO ] Invariant cache hit.
[2024-05-31 22:25:07] [INFO ] Implicit Places using invariants and state equation in 5159 ms returned []
Implicit Place search using SMT with State Equation took 6352 ms to find 0 implicit places.
Running 2148 sub problems to find dead transitions.
[2024-05-31 22:25:07] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 2148/2148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 13)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 4)
(s25 0)
(s26 0)
(s27 1)
(s28 1)
(s29 0)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(s37 0)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 3)
(s48 6)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 18)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 23)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 0)
(s250 1)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 1)
(s268 0)
(s269 1)
(s270 1)
(s271 1)
(s272 0)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 1)
(s298 1)
(s299 1)
(s300 0)
(s301 1)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 0)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 4)
(s361 1)
(s362 1)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 13)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 13)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 10)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 4)
(s413 1)
(s414 93)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 0)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 0)
(s459 1)
(s460 1)
(s461 0)
(s462 0)
(s463 1)
(s464 1)
(s465 0)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 0)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 0)
(s486 1)
(s487 1)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 1)
(s493 1)
(s494 0)
(s495 1)
(s496 1)
(s497 0)
(s498 1)
(s499 1)
(s500 0)
(s501 1)
(s502 1)
(s503 0)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 16)
(s637 1)
(s638 0)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 0)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 10)
(s673 1)
(s674 1)
(s675 0)
(s676 1)
(s677 1)
(s678 0)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 7)
(s706 1)
(s707 1)
(s708 1)
(s709 0)
(s710 1)
(s711 0)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 0)
(s722 4)
(s723 0)
(s724 1)
(s725 0)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 9)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 9)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 6)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 4)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 28)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 0)
(s809 1)
(s810 1)
(s811 1)
(s812 0)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 0)
(s819 1)
(s820 0)
(s821 0)
(s822 0)
(s823 1)
(s824 1)
(s825 0)
(s826 0)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 16)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 0)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 0)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 0)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 0)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 7)
(s1065 1)
(s1066 1)
(s1067 0)
(s1068 1)
(s1069 1)
(s1070 0)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 4)
(s1079 1)
(s1080 0)
(s1081 1)
(s1082 0)
(s1083 0)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 23)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 5)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 5)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 2)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 4)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 89)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 0)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 0)
(s1174 1)
(s1175 0)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 1)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 1)
(s1187 0)
(s1188 1)
(s1189 0)
(s1190 1)
(s1191 0)
(s1192 1)
(s1193 0)
(s1194 1)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 23)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 0)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 0)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 10)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 0)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 0)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 7)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 0)
(s1428 1)
(s1429 1)
(s1430 0)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 4)
(s1438 1)
(s1439 0)
(s1440 1)
(s1441 0)
(s1442 0)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 0)
(s1470 0)
(s1471 1)
(s1472 3)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 0)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 4)
(s1489 1)
(s1490 81)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 0)
(s1522 1)
(s1523 1)
(s1524 0)
(s1525 1)
(s1526 1)
(s1527 0)
(s1528 1)
(s1529 1)
(s1530 0)
(s1531 1)
(s1532 1)
(s1533 0)
(s1534 1)
(s1535 1)
(s1536 0)
(s1537 1)
(s1538 1)
(s1539 0)
(s1540 1)
(s1541 1)
(s1542 0)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 4)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 69)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 7)
(s1587 1)
(s1588 1)
(s1589 6)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 13)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 0/2148 constraints, Known Traps: 0/0 constraints]
After SMT, in 61065ms problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 61097ms
Finished structural reductions in LTL mode , in 1 iterations and 67546 ms. Remains : 1761/1761 places, 2149/2149 transitions.
Computed a total of 71 stabilizing places and 71 stable transitions
Computed a total of 71 stabilizing places and 71 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (92 resets) in 325 ms. (122 steps per ms) remains 1/3 properties
BEST_FIRST walk for 35563 steps (8 resets) in 118 ms. (298 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 22:26:09] [INFO ] Invariant cache hit.
[2024-05-31 22:26:11] [INFO ] [Real]Absence check using 46 positive place invariants in 64 ms returned sat
[2024-05-31 22:26:12] [INFO ] [Real]Absence check using 46 positive and 142 generalized place invariants in 926 ms returned sat
[2024-05-31 22:26:24] [INFO ] [Real]Absence check using state equation in 11977 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2599 reset in 278 ms.
Product exploration explored 100000 steps with 2616 reset in 291 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 1761 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1761/1761 places, 2149/2149 transitions.
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 312 rules applied. Total rules applied 312 place count 1761 transition count 2149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 313 place count 1761 transition count 2148
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 313 place count 1761 transition count 2233
Deduced a syphon composed of 630 places in 5 ms
Iterating global reduction 2 with 318 rules applied. Total rules applied 631 place count 1761 transition count 2233
Discarding 168 places :
Symmetric choice reduction at 2 with 168 rule applications. Total rules 799 place count 1593 transition count 2065
Deduced a syphon composed of 462 places in 4 ms
Iterating global reduction 2 with 168 rules applied. Total rules applied 967 place count 1593 transition count 2065
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 967 place count 1593 transition count 2068
Deduced a syphon composed of 465 places in 4 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 970 place count 1593 transition count 2068
Performed 304 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 769 places in 4 ms
Iterating global reduction 2 with 304 rules applied. Total rules applied 1274 place count 1593 transition count 2070
Discarding 122 places :
Symmetric choice reduction at 2 with 122 rule applications. Total rules 1396 place count 1471 transition count 1946
Deduced a syphon composed of 651 places in 6 ms
Iterating global reduction 2 with 122 rules applied. Total rules applied 1518 place count 1471 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1520 place count 1469 transition count 1943
Deduced a syphon composed of 651 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1522 place count 1469 transition count 1943
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1524 place count 1469 transition count 1941
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -89
Deduced a syphon composed of 676 places in 2 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 1549 place count 1469 transition count 2030
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1557 place count 1461 transition count 2012
Deduced a syphon composed of 668 places in 3 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1565 place count 1461 transition count 2012
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 669 places in 2 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1566 place count 1461 transition count 2014
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1567 place count 1460 transition count 2012
Deduced a syphon composed of 668 places in 3 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1568 place count 1460 transition count 2012
Deduced a syphon composed of 668 places in 2 ms
Applied a total of 1568 rules in 1500 ms. Remains 1460 /1761 variables (removed 301) and now considering 2012/2149 (removed 137) transitions.
[2024-05-31 22:26:27] [INFO ] Redundant transitions in 60 ms returned []
Running 2011 sub problems to find dead transitions.
// Phase 1: matrix 2012 rows 1460 cols
[2024-05-31 22:26:27] [INFO ] Computed 188 invariants in 31 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1459 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1459/3472 variables, and 129 constraints, problems are : Problem set: 0 solved, 2011 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/43 constraints, Generalized P Invariants (flows): 129/145 constraints, State Equation: 0/1460 constraints, PredecessorRefiner: 2011/2011 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2011 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1459 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2011 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 4)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 0)
(s44 1)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 0)
(s53 0)
(s54 1)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 1)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 41)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 0)
(s106 1)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 1)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 1)
(s125 1)
(s126 0)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 23)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 16)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 2)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 16)
(s232 1)
(s233 1)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 10)
(s259 1)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 0)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 6)
(s282 1)
(s283 1)
(s284 0)
(s285 1)
(s286 0)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 2)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 5)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 0)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 45)
(s358 1)
(s359 78)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 12)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 3)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 23)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 3)
(s476 1)
(s477 1)
(s478 12)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 2)
(s502 1)
(s503 1)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 0)
(s509 0)
(s510 1)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 1)
(s516 0)
(s517 0)
(s518 1)
(s519 1)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 0)
(s531 1)
(s532 0)
(s533 1)
(s534 1)
(s535 1)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 1)
(s542 0)
(s543 0)
(s544 1)
(s545 0)
(s546 0)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 0)
(s557 1)
(s558 0)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 0)
(s564 0)
(s565 1)
(s566 1)
(s567 1)
(s568 0)
(s569 1)
(s570 0)
(s571 0)
(s572 0)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 0)
(s580 1)
(s581 0)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 2)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 13)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 0)
(s626 1)
(s627 1)
(s628 1)
(s629 0)
(s630 0)
(s631 0)
(s632 1)
(s633 14)
(s634 0)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 2)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 16)
(s655 1)
(s656 75)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 34)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 4)
(s698 1)
(s699 1)
(s700 0)
(s701 0)
(s702 1)
(s703 0)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 1)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 1)
(s715 0)
(s716 0)
(s717 1)
(s718 0)
(s719 0)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 23)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 14)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 2)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 16)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 0)
(s828 0)
(s829 1)
(s830 1)
(s831 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1459/3472 variables, and 129 constraints, problems are : Problem set: 0 solved, 2011 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/43 constraints, Generalized P Invariants (flows): 129/145 constraints, State Equation: 0/1460 constraints, PredecessorRefiner: 0/2011 constraints, Known Traps: 0/0 constraints]
After SMT, in 61341ms problems are : Problem set: 0 solved, 2011 unsolved
Search for dead transitions found 0 dead transitions in 61368ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1460/1761 places, 2012/2149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62952 ms. Remains : 1460/1761 places, 2012/2149 transitions.
Support contains 6 out of 1761 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1761/1761 places, 2149/2149 transitions.
Applied a total of 0 rules in 141 ms. Remains 1761 /1761 variables (removed 0) and now considering 2149/2149 (removed 0) transitions.
// Phase 1: matrix 2149 rows 1761 cols
[2024-05-31 22:27:28] [INFO ] Computed 188 invariants in 39 ms
[2024-05-31 22:27:30] [INFO ] Implicit Places using invariants in 1503 ms returned []
[2024-05-31 22:27:30] [INFO ] Invariant cache hit.
[2024-05-31 22:27:35] [INFO ] Implicit Places using invariants and state equation in 5039 ms returned []
Implicit Place search using SMT with State Equation took 6575 ms to find 0 implicit places.
Running 2148 sub problems to find dead transitions.
[2024-05-31 22:27:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 2148/2148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 0/2148 constraints, Known Traps: 0/0 constraints]
After SMT, in 61132ms problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 61161ms
Finished structural reductions in LTL mode , in 1 iterations and 67883 ms. Remains : 1761/1761 places, 2149/2149 transitions.
Treatment of property ASLink-PT-04b-LTLCardinality-02 finished in 300900 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(X(F(p0)))))'
Support contains 2 out of 1765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1763 transition count 2151
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1763 transition count 2151
Applied a total of 4 rules in 220 ms. Remains 1763 /1765 variables (removed 2) and now considering 2151/2153 (removed 2) transitions.
// Phase 1: matrix 2151 rows 1763 cols
[2024-05-31 22:28:36] [INFO ] Computed 188 invariants in 25 ms
[2024-05-31 22:28:38] [INFO ] Implicit Places using invariants in 1303 ms returned []
[2024-05-31 22:28:38] [INFO ] Invariant cache hit.
[2024-05-31 22:28:44] [INFO ] Implicit Places using invariants and state equation in 6277 ms returned []
Implicit Place search using SMT with State Equation took 7602 ms to find 0 implicit places.
Running 2150 sub problems to find dead transitions.
[2024-05-31 22:28:44] [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 13.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 3.0)
(s48 6.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 18.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 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 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 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.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 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.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 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 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 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 4.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 13.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 13.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 10.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 4.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 71.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.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 1.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 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 1.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 1.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 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.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 1.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 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.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 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.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 1.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 16.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 0.0)
(s641 1.0)
(s642 1.0)
(s643 0.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 1.0)
(s669 1.0)
(s670 10.0)
(s671 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1762 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 2150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1762/3914 variables, and 103 constraints, problems are : Problem set: 0 solved, 2150 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 103/142 constraints, State Equation: 0/1763 constraints, PredecessorRefiner: 2150/2150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1762 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 2150 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 13)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 3)
(s48 6)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 18)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 1)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(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 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 0)
(s263 1)
(s264 1)
(s265 0)
(s266 0)
(s267 1)
(s268 0)
(s269 0)
(s270 1)
(s271 1)
(s272 0)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 0)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 0)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 0)
(s319 0)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 0)
(s328 0)
(s329 1)
(s330 1)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 0)
(s339 1)
(s340 1)
(s341 0)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 0)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 0)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 0)
(s362 1)
(s363 4)
(s364 1)
(s365 0)
(s366 0)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 13)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 13)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 10)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 4)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 71)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 0)
(s451 0)
(s452 1)
(s453 1)
(s454 0)
(s455 0)
(s456 1)
(s457 1)
(s458 0)
(s459 0)
(s460 1)
(s461 1)
(s462 0)
(s463 0)
(s464 1)
(s465 1)
(s466 0)
(s467 0)
(s468 1)
(s469 1)
(s470 0)
(s471 0)
(s472 1)
(s473 1)
(s474 0)
(s475 0)
(s476 1)
(s477 1)
(s478 0)
(s479 0)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 0)
(s485 0)
(s486 0)
(s487 1)
(s488 1)
(s489 0)
(s490 1)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 1)
(s497 1)
(s498 0)
(s499 1)
(s500 0)
(s501 1)
(s502 1)
(s503 1)
(s504 0)
(s505 1)
(s506 1)
(s507 0)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 16)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 0)
(s641 1)
(s642 1)
(s643 0)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 10)
(s671 1)
(s672 1)
(s673 1)
(s674 0)
(s675 1)
(s676 1)
(s677 1)
(s678 0)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 7)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 0)
(s710 1)
(s711 0)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 4)
(s720 1)
(s721 0)
(s722 1)
(s723 0)
(s724 1)
(s725 0)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 9)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 9)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 6)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 4)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 28)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 0)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 0)
(s823 1)
(s824 1)
(s825 0)
(s826 0)
(s827 1)
(s828 0)
(s829 1)
(s830 1)
(s831 1)
(s832 0)
(s833 0)
(s834 0)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 0)
(s873 1)
(s874 0)
(s875 0)
(s876 1)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 0)
(s886 1)
(s887 1)
(s888 0)
(s889 1)
(s890 1)
(s891 0)
(s892 1)
(s893 1)
(s894 0)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 16)
(s995 1)
(s996 1)
(s997 0)
(s998 1)
(s999 1)
(s1000 1)
(s1001 0)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 0)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 0)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 7)
(s1065 1)
(s1066 1)
(s1067 0)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 0)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 4)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 12)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 5)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 5)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 2)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 4)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 78)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1762/3914 variables, and 103 constraints, problems are : Problem set: 0 solved, 2150 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 103/142 constraints, State Equation: 0/1763 constraints, PredecessorRefiner: 0/2150 constraints, Known Traps: 0/0 constraints]
After SMT, in 60997ms problems are : Problem set: 0 solved, 2150 unsolved
Search for dead transitions found 0 dead transitions in 61036ms
Starting structural reductions in LTL mode, iteration 1 : 1763/1765 places, 2151/2153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68862 ms. Remains : 1763/1765 places, 2151/2153 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 476 ms.
Product exploration explored 100000 steps with 25000 reset in 495 ms.
Computed a total of 71 stabilizing places and 71 stable transitions
Computed a total of 71 stabilizing places and 71 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (99 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 228960 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 228960 steps, saw 40345 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-31 22:29:50] [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) 121/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 397/520 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1204/1724 variables, 137/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1724 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/1763 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1763 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3914/3914 variables, and 1951 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1935 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 142/142 constraints, State Equation: 1763/1763 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) 121/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 397/520 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:29:52] [INFO ] Deduced a trap composed of 109 places in 134 ms of which 3 ms to minimize.
[2024-05-31 22:29:52] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1204/1724 variables, 137/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:29:54] [INFO ] Deduced a trap composed of 20 places in 1318 ms of which 14 ms to minimize.
[2024-05-31 22:29:56] [INFO ] Deduced a trap composed of 26 places in 1547 ms of which 19 ms to minimize.
[2024-05-31 22:29:57] [INFO ] Deduced a trap composed of 21 places in 1586 ms of which 20 ms to minimize.
SMT process timed out in 7506ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1763/1763 places, 2151/2151 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 1763 transition count 1830
Reduce places removed 321 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 324 rules applied. Total rules applied 645 place count 1442 transition count 1827
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 647 place count 1440 transition count 1827
Performed 474 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 474 Pre rules applied. Total rules applied 647 place count 1440 transition count 1353
Deduced a syphon composed of 474 places in 3 ms
Ensure Unique test removed 43 places
Reduce places removed 517 places and 0 transitions.
Iterating global reduction 3 with 991 rules applied. Total rules applied 1638 place count 923 transition count 1353
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 32 rules applied. Total rules applied 1670 place count 918 transition count 1326
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1697 place count 891 transition count 1326
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1697 place count 891 transition count 1309
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1748 place count 857 transition count 1309
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1748 place count 857 transition count 1293
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 1780 place count 841 transition count 1293
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 5 with 291 rules applied. Total rules applied 2071 place count 695 transition count 1148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2075 place count 691 transition count 1144
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2080 place count 690 transition count 1144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2080 place count 690 transition count 1143
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2082 place count 689 transition count 1143
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2084 place count 687 transition count 1141
Iterating global reduction 5 with 2 rules applied. Total rules applied 2086 place count 687 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2088 place count 687 transition count 1139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2089 place count 686 transition count 1139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2091 place count 685 transition count 1144
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 2096 place count 685 transition count 1139
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2101 place count 680 transition count 1139
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2105 place count 680 transition count 1135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2109 place count 676 transition count 1135
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2113 place count 676 transition count 1135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2114 place count 675 transition count 1134
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 10 rules applied. Total rules applied 2124 place count 668 transition count 1131
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2127 place count 665 transition count 1131
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 10 Pre rules applied. Total rules applied 2127 place count 665 transition count 1121
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 2147 place count 655 transition count 1121
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 11 with 4 rules applied. Total rules applied 2151 place count 651 transition count 1121
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 12 with 16 rules applied. Total rules applied 2167 place count 643 transition count 1113
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2171 place count 639 transition count 1109
Iterating global reduction 12 with 4 rules applied. Total rules applied 2175 place count 639 transition count 1109
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 2179 place count 639 transition count 1105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2183 place count 635 transition count 1105
Applied a total of 2183 rules in 487 ms. Remains 635 /1763 variables (removed 1128) and now considering 1105/2151 (removed 1046) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 635/1763 places, 1105/2151 transitions.
RANDOM walk for 40000 steps (534 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (107 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 346127 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 346127 steps, saw 68882 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 1105 rows 635 cols
[2024-05-31 22:30:01] [INFO ] Computed 110 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) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/50 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/109 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/141 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/156 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 166/322 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 36/358 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/361 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/361 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 173/534 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 15/549 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/549 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 83/632 variables, 17/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/632 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/633 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/633 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/635 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/635 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1105/1740 variables, 635/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1740 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1740 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1740/1740 variables, and 745 constraints, problems are : Problem set: 0 solved, 1 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 78/78 constraints, State Equation: 635/635 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) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/50 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/109 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/141 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/156 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 166/322 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 36/358 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/361 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/361 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 173/534 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 15/549 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/549 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 83/632 variables, 17/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/632 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/633 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/633 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/635 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/635 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1105/1740 variables, 635/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1740 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1740 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/1740 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1740/1740 variables, and 746 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 78/78 constraints, State Equation: 635/635 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2161ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 157 ms.
Support contains 2 out of 635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1105/1105 transitions.
Applied a total of 0 rules in 33 ms. Remains 635 /635 variables (removed 0) and now considering 1105/1105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 635/635 places, 1105/1105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1105/1105 transitions.
Applied a total of 0 rules in 35 ms. Remains 635 /635 variables (removed 0) and now considering 1105/1105 (removed 0) transitions.
[2024-05-31 22:30:03] [INFO ] Invariant cache hit.
[2024-05-31 22:30:04] [INFO ] Implicit Places using invariants in 1073 ms returned [1, 18, 19, 22, 32, 49, 67, 142, 157, 158, 160, 177, 195, 264, 268, 269, 280, 281, 283, 300, 318, 387, 391, 392, 403, 404, 406, 423, 441, 510, 514, 515, 518, 529, 530, 531, 549, 553, 571, 572, 573, 574]
[2024-05-31 22:30:04] [INFO ] Actually due to overlaps returned [549, 531, 49, 177, 300, 423, 32, 160, 283, 406, 157, 280, 403, 529, 571, 158, 281, 404, 530, 572, 1, 18, 268, 269, 391, 392, 514, 515, 67, 195, 318, 441, 573, 19, 22, 142, 518, 553, 574]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1078 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 596/635 places, 1105/1105 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 593 transition count 1030
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 518 transition count 1027
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 156 place count 518 transition count 1005
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 201 place count 495 transition count 1005
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 213 place count 491 transition count 997
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 221 place count 483 transition count 997
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 224 place count 480 transition count 994
Iterating global reduction 4 with 3 rules applied. Total rules applied 227 place count 480 transition count 994
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 230 place count 480 transition count 991
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 298 place count 446 transition count 957
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 301 place count 443 transition count 954
Iterating global reduction 5 with 3 rules applied. Total rules applied 304 place count 443 transition count 954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 307 place count 443 transition count 951
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 311 place count 441 transition count 952
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 321 place count 441 transition count 942
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 332 place count 430 transition count 942
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 333 place count 430 transition count 941
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 345 place count 430 transition count 941
Applied a total of 345 rules in 171 ms. Remains 430 /596 variables (removed 166) and now considering 941/1105 (removed 164) transitions.
// Phase 1: matrix 941 rows 430 cols
[2024-05-31 22:30:04] [INFO ] Computed 62 invariants in 8 ms
[2024-05-31 22:30:05] [INFO ] Implicit Places using invariants in 506 ms returned [88, 94, 97, 99, 102, 109, 110, 165, 181, 187, 190, 192, 197, 198, 251, 267, 273, 276, 278, 283, 284, 337, 353, 359, 362, 364]
[2024-05-31 22:30:05] [INFO ] Actually due to overlaps returned [109, 197, 283, 110, 198, 284, 88, 94, 99, 181, 187, 192, 267, 273, 278, 353, 359, 364, 102, 165, 251, 337]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 510 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 408/635 places, 941/1105 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 391 transition count 924
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 391 transition count 924
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 387 transition count 920
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 387 transition count 920
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 380 transition count 913
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 380 transition count 901
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 80 place count 368 transition count 901
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 368 transition count 898
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 365 transition count 898
Applied a total of 86 rules in 113 ms. Remains 365 /408 variables (removed 43) and now considering 898/941 (removed 43) transitions.
// Phase 1: matrix 898 rows 365 cols
[2024-05-31 22:30:05] [INFO ] Computed 40 invariants in 8 ms
[2024-05-31 22:30:06] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-31 22:30:06] [INFO ] Invariant cache hit.
[2024-05-31 22:30:07] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 365/635 places, 898/1105 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3971 ms. Remains : 365/635 places, 898/1105 transitions.
RANDOM walk for 40000 steps (794 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (209 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 377253 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 377253 steps, saw 101790 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2024-05-31 22:30:10] [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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/189 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 149/338 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/354 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/365 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 898/1263 variables, 365/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1263 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1263/1263 variables, and 405 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 365/365 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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/189 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 149/338 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/354 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/365 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 898/1263 variables, 365/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1263 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1263 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1263/1263 variables, and 406 constraints, problems are : Problem set: 0 solved, 1 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1096ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 2 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 898/898 transitions.
Applied a total of 0 rules in 13 ms. Remains 365 /365 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 365/365 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 898/898 transitions.
Applied a total of 0 rules in 14 ms. Remains 365 /365 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-05-31 22:30:11] [INFO ] Invariant cache hit.
[2024-05-31 22:30:12] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-31 22:30:12] [INFO ] Invariant cache hit.
[2024-05-31 22:30:13] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
[2024-05-31 22:30:13] [INFO ] Redundant transitions in 16 ms returned []
Running 873 sub problems to find dead transitions.
[2024-05-31 22:30:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 3 (OVERLAPS) 1/365 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 873 unsolved
SMT process timed out in 30952ms, After SMT, problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 30971ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32871 ms. Remains : 365/365 places, 898/898 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 365 transition count 897
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 364 transition count 897
Applied a total of 2 rules in 25 ms. Remains 364 /365 variables (removed 1) and now considering 897/898 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 897 rows 364 cols
[2024-05-31 22:30:44] [INFO ] Computed 40 invariants in 11 ms
[2024-05-31 22:30:45] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:30:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-31 22:30:45] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 17 ms returned sat
[2024-05-31 22:30:45] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:30:45] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:30:45] [INFO ] After 605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 790 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1763/1763 places, 2151/2151 transitions.
Applied a total of 0 rules in 122 ms. Remains 1763 /1763 variables (removed 0) and now considering 2151/2151 (removed 0) transitions.
// Phase 1: matrix 2151 rows 1763 cols
[2024-05-31 22:30:46] [INFO ] Computed 188 invariants in 24 ms
[2024-05-31 22:30:47] [INFO ] Implicit Places using invariants in 1427 ms returned []
[2024-05-31 22:30:47] [INFO ] Invariant cache hit.
[2024-05-31 22:30:55] [INFO ] Implicit Places using invariants and state equation in 7764 ms returned []
Implicit Place search using SMT with State Equation took 9197 ms to find 0 implicit places.
Running 2150 sub problems to find dead transitions.
[2024-05-31 22:30:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1762 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 2150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1762/3914 variables, and 103 constraints, problems are : Problem set: 0 solved, 2150 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 103/142 constraints, State Equation: 0/1763 constraints, PredecessorRefiner: 2150/2150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1762 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 2150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1762/3914 variables, and 103 constraints, problems are : Problem set: 0 solved, 2150 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 103/142 constraints, State Equation: 0/1763 constraints, PredecessorRefiner: 0/2150 constraints, Known Traps: 0/0 constraints]
After SMT, in 61268ms problems are : Problem set: 0 solved, 2150 unsolved
Search for dead transitions found 0 dead transitions in 61312ms
Finished structural reductions in LTL mode , in 1 iterations and 70651 ms. Remains : 1763/1763 places, 2151/2151 transitions.
Computed a total of 71 stabilizing places and 71 stable transitions
Computed a total of 71 stabilizing places and 71 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (90 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (11 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 207783 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 207783 steps, saw 37299 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-31 22:32:00] [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) 121/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 397/520 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1204/1724 variables, 137/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1724 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/1763 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1763 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3914/3914 variables, and 1951 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1738 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 142/142 constraints, State Equation: 1763/1763 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) 121/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 397/520 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:32:02] [INFO ] Deduced a trap composed of 109 places in 95 ms of which 3 ms to minimize.
[2024-05-31 22:32:02] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1204/1724 variables, 137/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:32:04] [INFO ] Deduced a trap composed of 20 places in 1997 ms of which 21 ms to minimize.
[2024-05-31 22:32:06] [INFO ] Deduced a trap composed of 26 places in 1950 ms of which 21 ms to minimize.
[2024-05-31 22:32:08] [INFO ] Deduced a trap composed of 21 places in 1929 ms of which 21 ms to minimize.
SMT process timed out in 8536ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1763/1763 places, 2151/2151 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 1763 transition count 1830
Reduce places removed 321 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 324 rules applied. Total rules applied 645 place count 1442 transition count 1827
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 647 place count 1440 transition count 1827
Performed 474 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 474 Pre rules applied. Total rules applied 647 place count 1440 transition count 1353
Deduced a syphon composed of 474 places in 4 ms
Ensure Unique test removed 43 places
Reduce places removed 517 places and 0 transitions.
Iterating global reduction 3 with 991 rules applied. Total rules applied 1638 place count 923 transition count 1353
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 32 rules applied. Total rules applied 1670 place count 918 transition count 1326
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1697 place count 891 transition count 1326
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1697 place count 891 transition count 1309
Deduced a syphon composed of 17 places in 4 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1748 place count 857 transition count 1309
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1748 place count 857 transition count 1293
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1780 place count 841 transition count 1293
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 5 with 291 rules applied. Total rules applied 2071 place count 695 transition count 1148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2075 place count 691 transition count 1144
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2080 place count 690 transition count 1144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2080 place count 690 transition count 1143
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2082 place count 689 transition count 1143
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2084 place count 687 transition count 1141
Iterating global reduction 5 with 2 rules applied. Total rules applied 2086 place count 687 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2088 place count 687 transition count 1139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2089 place count 686 transition count 1139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2091 place count 685 transition count 1144
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 2096 place count 685 transition count 1139
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2101 place count 680 transition count 1139
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2105 place count 680 transition count 1135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2109 place count 676 transition count 1135
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2113 place count 676 transition count 1135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2114 place count 675 transition count 1134
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 10 rules applied. Total rules applied 2124 place count 668 transition count 1131
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2127 place count 665 transition count 1131
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 10 Pre rules applied. Total rules applied 2127 place count 665 transition count 1121
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 2147 place count 655 transition count 1121
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 11 with 4 rules applied. Total rules applied 2151 place count 651 transition count 1121
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 12 with 16 rules applied. Total rules applied 2167 place count 643 transition count 1113
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2171 place count 639 transition count 1109
Iterating global reduction 12 with 4 rules applied. Total rules applied 2175 place count 639 transition count 1109
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 2179 place count 639 transition count 1105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2183 place count 635 transition count 1105
Applied a total of 2183 rules in 611 ms. Remains 635 /1763 variables (removed 1128) and now considering 1105/2151 (removed 1046) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 635/1763 places, 1105/2151 transitions.
RANDOM walk for 40000 steps (505 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (115 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 303462 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 303462 steps, saw 61641 distinct states, run finished after 3007 ms. (steps per millisecond=100 ) properties seen :0
// Phase 1: matrix 1105 rows 635 cols
[2024-05-31 22:32:12] [INFO ] Computed 110 invariants in 23 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) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/50 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/109 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/141 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/156 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 166/322 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 36/358 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/361 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/361 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 173/534 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 15/549 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/549 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 83/632 variables, 17/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/632 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/633 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/633 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/635 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/635 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1105/1740 variables, 635/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1740 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1740 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1740/1740 variables, and 745 constraints, problems are : Problem set: 0 solved, 1 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 78/78 constraints, State Equation: 635/635 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) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/50 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/109 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/141 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/156 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 166/322 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 36/358 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/361 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/361 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 173/534 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 15/549 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/549 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 83/632 variables, 17/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/632 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/633 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/633 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/635 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/635 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1105/1740 variables, 635/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1740 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1740 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/1740 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1740/1740 variables, and 746 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1236 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 78/78 constraints, State Equation: 635/635 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2262ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 160 ms.
Support contains 2 out of 635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1105/1105 transitions.
Applied a total of 0 rules in 31 ms. Remains 635 /635 variables (removed 0) and now considering 1105/1105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 635/635 places, 1105/1105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1105/1105 transitions.
Applied a total of 0 rules in 31 ms. Remains 635 /635 variables (removed 0) and now considering 1105/1105 (removed 0) transitions.
[2024-05-31 22:32:14] [INFO ] Invariant cache hit.
[2024-05-31 22:32:16] [INFO ] Implicit Places using invariants in 1315 ms returned [1, 18, 19, 22, 32, 49, 67, 142, 157, 158, 160, 177, 195, 264, 268, 269, 280, 281, 283, 300, 318, 387, 391, 392, 403, 404, 406, 423, 441, 510, 514, 515, 518, 529, 530, 531, 549, 553, 571, 572, 573, 574]
[2024-05-31 22:32:16] [INFO ] Actually due to overlaps returned [549, 531, 49, 177, 300, 423, 32, 160, 283, 406, 157, 280, 403, 529, 571, 158, 281, 404, 530, 572, 1, 18, 268, 269, 391, 392, 514, 515, 67, 195, 318, 441, 573, 19, 22, 142, 518, 553, 574]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1321 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 596/635 places, 1105/1105 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 593 transition count 1030
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 518 transition count 1027
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 156 place count 518 transition count 1005
Deduced a syphon composed of 22 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 201 place count 495 transition count 1005
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 213 place count 491 transition count 997
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 221 place count 483 transition count 997
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 224 place count 480 transition count 994
Iterating global reduction 4 with 3 rules applied. Total rules applied 227 place count 480 transition count 994
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 230 place count 480 transition count 991
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 298 place count 446 transition count 957
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 301 place count 443 transition count 954
Iterating global reduction 5 with 3 rules applied. Total rules applied 304 place count 443 transition count 954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 307 place count 443 transition count 951
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 311 place count 441 transition count 952
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 321 place count 441 transition count 942
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 332 place count 430 transition count 942
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 333 place count 430 transition count 941
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 345 place count 430 transition count 941
Applied a total of 345 rules in 181 ms. Remains 430 /596 variables (removed 166) and now considering 941/1105 (removed 164) transitions.
// Phase 1: matrix 941 rows 430 cols
[2024-05-31 22:32:16] [INFO ] Computed 62 invariants in 13 ms
[2024-05-31 22:32:17] [INFO ] Implicit Places using invariants in 907 ms returned [88, 94, 97, 99, 102, 109, 110, 165, 181, 187, 190, 192, 197, 198, 251, 267, 273, 276, 278, 283, 284, 337, 353, 359, 362, 364]
[2024-05-31 22:32:17] [INFO ] Actually due to overlaps returned [109, 197, 283, 110, 198, 284, 88, 94, 99, 181, 187, 192, 267, 273, 278, 353, 359, 364, 102, 165, 251, 337]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 910 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 408/635 places, 941/1105 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 391 transition count 924
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 391 transition count 924
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 387 transition count 920
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 387 transition count 920
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 380 transition count 913
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 380 transition count 901
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 80 place count 368 transition count 901
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 368 transition count 898
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 365 transition count 898
Applied a total of 86 rules in 107 ms. Remains 365 /408 variables (removed 43) and now considering 898/941 (removed 43) transitions.
// Phase 1: matrix 898 rows 365 cols
[2024-05-31 22:32:17] [INFO ] Computed 40 invariants in 11 ms
[2024-05-31 22:32:18] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-31 22:32:18] [INFO ] Invariant cache hit.
[2024-05-31 22:32:19] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 2387 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 365/635 places, 898/1105 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4938 ms. Remains : 365/635 places, 898/1105 transitions.
RANDOM walk for 40000 steps (796 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (222 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 366698 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 366698 steps, saw 99320 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-31 22:32: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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/189 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 149/338 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/354 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/365 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 898/1263 variables, 365/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1263 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1263/1263 variables, and 405 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 365/365 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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/189 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 149/338 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/354 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/365 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 898/1263 variables, 365/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1263 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1263 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1263/1263 variables, and 406 constraints, problems are : Problem set: 0 solved, 1 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1016ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 2 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 898/898 transitions.
Applied a total of 0 rules in 12 ms. Remains 365 /365 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 365/365 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 898/898 transitions.
Applied a total of 0 rules in 11 ms. Remains 365 /365 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-05-31 22:32:24] [INFO ] Invariant cache hit.
[2024-05-31 22:32:24] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-31 22:32:24] [INFO ] Invariant cache hit.
[2024-05-31 22:32:26] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2236 ms to find 0 implicit places.
[2024-05-31 22:32:26] [INFO ] Redundant transitions in 15 ms returned []
Running 873 sub problems to find dead transitions.
[2024-05-31 22:32:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 3 (OVERLAPS) 1/365 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 873 unsolved
SMT process timed out in 30854ms, After SMT, problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 30873ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33147 ms. Remains : 365/365 places, 898/898 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 365 transition count 897
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 364 transition count 897
Applied a total of 2 rules in 25 ms. Remains 364 /365 variables (removed 1) and now considering 897/898 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 897 rows 364 cols
[2024-05-31 22:32:57] [INFO ] Computed 40 invariants in 11 ms
[2024-05-31 22:32:57] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:32:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-31 22:32:57] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 27 ms returned sat
[2024-05-31 22:32:58] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:32:58] [INFO ] After 604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:32:58] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 974 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 497 ms.
Product exploration explored 100000 steps with 25000 reset in 433 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1763/1763 places, 2151/2151 transitions.
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 1763 transition count 2151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 314 place count 1763 transition count 2150
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 314 place count 1763 transition count 2233
Deduced a syphon composed of 632 places in 7 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 633 place count 1763 transition count 2233
Discarding 170 places :
Symmetric choice reduction at 2 with 170 rule applications. Total rules 803 place count 1593 transition count 2063
Deduced a syphon composed of 462 places in 7 ms
Iterating global reduction 2 with 170 rules applied. Total rules applied 973 place count 1593 transition count 2063
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 973 place count 1593 transition count 2067
Deduced a syphon composed of 466 places in 6 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 977 place count 1593 transition count 2067
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 772 places in 4 ms
Iterating global reduction 2 with 306 rules applied. Total rules applied 1283 place count 1593 transition count 2068
Discarding 125 places :
Symmetric choice reduction at 2 with 125 rule applications. Total rules 1408 place count 1468 transition count 1941
Deduced a syphon composed of 651 places in 4 ms
Iterating global reduction 2 with 125 rules applied. Total rules applied 1533 place count 1468 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1535 place count 1466 transition count 1938
Deduced a syphon composed of 651 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1537 place count 1466 transition count 1938
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1539 place count 1466 transition count 1936
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 677 places in 2 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 1565 place count 1466 transition count 2027
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1573 place count 1458 transition count 2009
Deduced a syphon composed of 669 places in 3 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1581 place count 1458 transition count 2009
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 670 places in 2 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1582 place count 1458 transition count 2011
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1583 place count 1457 transition count 2009
Deduced a syphon composed of 669 places in 2 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1584 place count 1457 transition count 2009
Deduced a syphon composed of 669 places in 2 ms
Applied a total of 1584 rules in 729 ms. Remains 1457 /1763 variables (removed 306) and now considering 2009/2151 (removed 142) transitions.
[2024-05-31 22:33:00] [INFO ] Redundant transitions in 55 ms returned []
Running 2008 sub problems to find dead transitions.
// Phase 1: matrix 2009 rows 1457 cols
[2024-05-31 22:33:00] [INFO ] Computed 188 invariants in 28 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 5.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 6.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 1.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 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 33.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 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.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 1.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 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 14.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 2.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 0.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 14.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.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 0.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 9.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 0.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 24.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 23.0)
(s308 1.0)
(s309 6.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 0.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 1.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 37.0)
(s359 78.0)
(s360 1.0)
(s361 1.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 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 42.0)
(s387 1.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 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 1.0)
(s424 1.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 1.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 23.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 16.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.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 1.0)
(s500 1.0)
(s501 2.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.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 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 16.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 0.0)
(s531 0.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 1.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 9.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 2.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.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 6.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 2.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 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 2.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 6.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 0.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 1.0)
(s625 1.0)
(s626 0.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 2.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 83.0)
(s651 1.0)
(s652 1.0)
(s653 41.0)
(s654 1.0)
(s655 1.0)
(s656 10.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 1.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 42.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.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 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 1.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 1.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.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 1.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 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.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 23.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 14.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 2.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 16.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 0.0)
(s827 0.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 10.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 0.0)
(s853 0.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 7.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 0.0)
(s876 0.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 2.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 7.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 0.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 4.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 99.0)
(s947 1.0)
(s948 1.0)
(s949 25.0)
(s950 1.0)
(s951 1.0)
(s952 18.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 27.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 0.0)
(s996 0.0)
(s997 1.0)
(s998 0.0)
(s999 0.0)
(s1000 1.0)
(s1001 0.0)
(s1002 0.0)
(s1003 1.0)
(s1004 1.0)
(s1005 0.0)
(s1006 1.0)
(s1007 0.0)
(s1008 0.0)
(s1009 1.0)
(s1010 0.0)
(s1011 0.0)
(s1012 1.0)
(s1013 0.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 23.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 14.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 2.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 0.0)
(s1123 0.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 10.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 0.0)
(s1149 0.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 6.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 2.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 2.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 0.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 17.0)
(s1246 1.0)
(s1247 92.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 0.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 0.0)
(s1259 1.0)
(s1260 1.0)
(s1261 0.0)
(s1262 1.0)
(s1263 1.0)
(s1264 0.0)
(s1265 1.0)
(s1266 1.0)
(s1267 0.0)
(s1268 1.0)
(s1269 1.0)
(s1270 0.0)
(s1271 1.0)
(s1272 1.0)
(s1273 0.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 0.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 2.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 2.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 7.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 13.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1456 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2008 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1456/3466 variables, and 131 constraints, problems are : Problem set: 0 solved, 2008 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/42 constraints, Generalized P Invariants (flows): 131/146 constraints, State Equation: 0/1457 constraints, PredecessorRefiner: 2008/2008 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2008 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1456 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2008 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 1456/3466 variables, and 131 constraints, problems are : Problem set: 0 solved, 2008 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/42 constraints, Generalized P Invariants (flows): 131/146 constraints, State Equation: 0/1457 constraints, PredecessorRefiner: 0/2008 constraints, Known Traps: 0/0 constraints]
After SMT, in 61514ms problems are : Problem set: 0 solved, 2008 unsolved
Search for dead transitions found 0 dead transitions in 61539ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1457/1763 places, 2009/2151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62335 ms. Remains : 1457/1763 places, 2009/2151 transitions.
Support contains 2 out of 1763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1763/1763 places, 2151/2151 transitions.
Applied a total of 0 rules in 150 ms. Remains 1763 /1763 variables (removed 0) and now considering 2151/2151 (removed 0) transitions.
// Phase 1: matrix 2151 rows 1763 cols
[2024-05-31 22:34:02] [INFO ] Computed 188 invariants in 36 ms
[2024-05-31 22:34:03] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2024-05-31 22:34:03] [INFO ] Invariant cache hit.
[2024-05-31 22:34:11] [INFO ] Implicit Places using invariants and state equation in 7465 ms returned []
Implicit Place search using SMT with State Equation took 8893 ms to find 0 implicit places.
Running 2150 sub problems to find dead transitions.
[2024-05-31 22:34:11] [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 13.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 3.0)
(s48 6.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 18.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 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 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 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.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 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 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 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.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 0.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 4.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 13.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 13.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 10.0)
(s401 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1762 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 2150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1762/3914 variables, and 103 constraints, problems are : Problem set: 0 solved, 2150 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 103/142 constraints, State Equation: 0/1763 constraints, PredecessorRefiner: 2150/2150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1762 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 2150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1762/3914 variables, and 103 constraints, problems are : Problem set: 0 solved, 2150 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 103/142 constraints, State Equation: 0/1763 constraints, PredecessorRefiner: 0/2150 constraints, Known Traps: 0/0 constraints]
After SMT, in 61176ms problems are : Problem set: 0 solved, 2150 unsolved
Search for dead transitions found 0 dead transitions in 61203ms
Finished structural reductions in LTL mode , in 1 iterations and 70251 ms. Remains : 1763/1763 places, 2151/2151 transitions.
Treatment of property ASLink-PT-04b-LTLCardinality-04 finished in 396109 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 1765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1762 transition count 2150
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1762 transition count 2150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1761 transition count 2149
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1761 transition count 2149
Applied a total of 8 rules in 447 ms. Remains 1761 /1765 variables (removed 4) and now considering 2149/2153 (removed 4) transitions.
// Phase 1: matrix 2149 rows 1761 cols
[2024-05-31 22:35:13] [INFO ] Computed 188 invariants in 36 ms
[2024-05-31 22:35:15] [INFO ] Implicit Places using invariants in 1930 ms returned []
[2024-05-31 22:35:15] [INFO ] Invariant cache hit.
[2024-05-31 22:35:22] [INFO ] Implicit Places using invariants and state equation in 7484 ms returned []
Implicit Place search using SMT with State Equation took 9422 ms to find 0 implicit places.
Running 2148 sub problems to find dead transitions.
[2024-05-31 22:35:22] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 2148/2148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 13)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 6)
(s25 0)
(s26 0)
(s27 1)
(s28 1)
(s29 0)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(s37 0)
(s38 1)
(s39 1)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 3)
(s48 6)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 18)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 1)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 23)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 0)
(s269 0)
(s270 1)
(s271 1)
(s272 0)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 0)
(s319 0)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 0)
(s329 1)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 0)
(s339 1)
(s340 1)
(s341 0)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 0)
(s352 0)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 4)
(s361 1)
(s362 0)
(s363 1)
(s364 1)
(s365 0)
(s366 0)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 13)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 13)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 10)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 4)
(s413 1)
(s414 93)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 0)
(s451 0)
(s452 1)
(s453 1)
(s454 1)
(s455 0)
(s456 1)
(s457 1)
(s458 1)
(s459 0)
(s460 1)
(s461 1)
(s462 0)
(s463 0)
(s464 1)
(s465 1)
(s466 0)
(s467 0)
(s468 1)
(s469 1)
(s470 0)
(s471 0)
(s472 1)
(s473 1)
(s474 0)
(s475 0)
(s476 1)
(s477 1)
(s478 0)
(s479 6)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 0)
(s486 0)
(s487 1)
(s488 1)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 1)
(s494 1)
(s495 0)
(s496 1)
(s497 0)
(s498 0)
(s499 1)
(s500 0)
(s501 0)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 0)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 16)
(s637 1)
(s638 0)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 0)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 10)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 0)
(s678 1)
(s679 1)
(s680 1)
(s681 0)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 7)
(s706 1)
(s707 1)
(s708 1)
(s709 0)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 0)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 0)
(s721 0)
(s722 4)
(s723 1)
(s724 0)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 9)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 9)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 6)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 4)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 28)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 0)
(s809 1)
(s810 1)
(s811 1)
(s812 0)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 0)
(s819 1)
(s820 0)
(s821 0)
(s822 0)
(s823 1)
(s824 1)
(s825 0)
(s826 0)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 16)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 0)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 0)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 0/2148 constraints, Known Traps: 0/0 constraints]
After SMT, in 60977ms problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 61003ms
Starting structural reductions in LTL mode, iteration 1 : 1761/1765 places, 2149/2153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70880 ms. Remains : 1761/1765 places, 2149/2153 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 3274 steps with 4 reset in 19 ms.
FORMULA ASLink-PT-04b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-05 finished in 71075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 1764 transition count 1831
Reduce places removed 321 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 324 rules applied. Total rules applied 645 place count 1443 transition count 1828
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 647 place count 1441 transition count 1828
Performed 475 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 475 Pre rules applied. Total rules applied 647 place count 1441 transition count 1353
Deduced a syphon composed of 475 places in 5 ms
Ensure Unique test removed 44 places
Reduce places removed 519 places and 0 transitions.
Iterating global reduction 3 with 994 rules applied. Total rules applied 1641 place count 922 transition count 1353
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 32 rules applied. Total rules applied 1673 place count 918 transition count 1325
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1701 place count 890 transition count 1325
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1701 place count 890 transition count 1308
Deduced a syphon composed of 17 places in 4 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1752 place count 856 transition count 1308
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1752 place count 856 transition count 1292
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1784 place count 840 transition count 1292
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1786 place count 838 transition count 1290
Iterating global reduction 5 with 2 rules applied. Total rules applied 1788 place count 838 transition count 1290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1788 place count 838 transition count 1289
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1790 place count 837 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1791 place count 836 transition count 1288
Iterating global reduction 5 with 1 rules applied. Total rules applied 1792 place count 836 transition count 1288
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 5 with 286 rules applied. Total rules applied 2078 place count 692 transition count 1146
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2082 place count 688 transition count 1142
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2087 place count 687 transition count 1142
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2088 place count 687 transition count 1141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2089 place count 686 transition count 1141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2089 place count 686 transition count 1140
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 2091 place count 685 transition count 1140
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2093 place count 683 transition count 1138
Iterating global reduction 7 with 2 rules applied. Total rules applied 2095 place count 683 transition count 1138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2097 place count 683 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2098 place count 682 transition count 1136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2100 place count 681 transition count 1141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2102 place count 679 transition count 1139
Reduce places removed 8 places and 0 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 9 with 12 rules applied. Total rules applied 2114 place count 671 transition count 1135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2118 place count 667 transition count 1135
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 12 Pre rules applied. Total rules applied 2118 place count 667 transition count 1123
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 25 rules applied. Total rules applied 2143 place count 654 transition count 1123
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 11 with 9 rules applied. Total rules applied 2152 place count 645 transition count 1123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2152 place count 645 transition count 1122
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2154 place count 644 transition count 1122
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 2180 place count 631 transition count 1109
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 2188 place count 623 transition count 1101
Iterating global reduction 12 with 8 rules applied. Total rules applied 2196 place count 623 transition count 1101
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2200 place count 619 transition count 1097
Iterating global reduction 12 with 4 rules applied. Total rules applied 2204 place count 619 transition count 1097
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2208 place count 619 transition count 1093
Applied a total of 2208 rules in 632 ms. Remains 619 /1765 variables (removed 1146) and now considering 1093/2153 (removed 1060) transitions.
// Phase 1: matrix 1093 rows 619 cols
[2024-05-31 22:36:24] [INFO ] Computed 102 invariants in 17 ms
[2024-05-31 22:36:25] [INFO ] Implicit Places using invariants in 1427 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 450, 501, 502, 505, 516, 517, 518, 536, 557, 558, 559, 560]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1433 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 578/1765 places, 1093/2153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 578 transition count 1020
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 505 transition count 1020
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 146 place count 505 transition count 997
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 193 place count 481 transition count 997
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 205 place count 477 transition count 989
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 213 place count 469 transition count 989
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 216 place count 466 transition count 986
Iterating global reduction 4 with 3 rules applied. Total rules applied 219 place count 466 transition count 986
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 222 place count 466 transition count 983
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 290 place count 432 transition count 949
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 294 place count 430 transition count 950
Applied a total of 294 rules in 96 ms. Remains 430 /578 variables (removed 148) and now considering 950/1093 (removed 143) transitions.
// Phase 1: matrix 950 rows 430 cols
[2024-05-31 22:36:26] [INFO ] Computed 56 invariants in 12 ms
[2024-05-31 22:36:26] [INFO ] Implicit Places using invariants in 883 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 351, 357, 362, 427]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 886 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 417/1765 places, 950/2153 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 417 transition count 949
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 416 transition count 949
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 408 transition count 941
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 408 transition count 941
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 400 transition count 933
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 400 transition count 933
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 396 transition count 929
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 396 transition count 929
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 2 with 8 rules applied. Total rules applied 50 place count 392 transition count 925
Applied a total of 50 rules in 85 ms. Remains 392 /417 variables (removed 25) and now considering 925/950 (removed 25) transitions.
// Phase 1: matrix 925 rows 392 cols
[2024-05-31 22:36:27] [INFO ] Computed 43 invariants in 12 ms
[2024-05-31 22:36:27] [INFO ] Implicit Places using invariants in 808 ms returned []
[2024-05-31 22:36:27] [INFO ] Invariant cache hit.
[2024-05-31 22:36:29] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2536 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 392/1765 places, 925/2153 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5669 ms. Remains : 392/1765 places, 925/2153 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-09
Product exploration explored 100000 steps with 1562 reset in 448 ms.
Stack based approach found an accepted trace after 94252 steps with 1529 reset with depth 36 and stack size 36 in 559 ms.
FORMULA ASLink-PT-04b-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-09 finished in 6761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 1764 transition count 1830
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 325 rules applied. Total rules applied 647 place count 1442 transition count 1827
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 649 place count 1440 transition count 1827
Performed 475 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 475 Pre rules applied. Total rules applied 649 place count 1440 transition count 1352
Deduced a syphon composed of 475 places in 3 ms
Ensure Unique test removed 44 places
Reduce places removed 519 places and 0 transitions.
Iterating global reduction 3 with 994 rules applied. Total rules applied 1643 place count 921 transition count 1352
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 32 rules applied. Total rules applied 1675 place count 917 transition count 1324
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1703 place count 889 transition count 1324
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1703 place count 889 transition count 1307
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1754 place count 855 transition count 1307
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 1754 place count 855 transition count 1292
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1784 place count 840 transition count 1292
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1786 place count 838 transition count 1290
Iterating global reduction 5 with 2 rules applied. Total rules applied 1788 place count 838 transition count 1290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1788 place count 838 transition count 1289
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1790 place count 837 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1791 place count 836 transition count 1288
Iterating global reduction 5 with 1 rules applied. Total rules applied 1792 place count 836 transition count 1288
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 5 with 286 rules applied. Total rules applied 2078 place count 692 transition count 1146
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2082 place count 688 transition count 1142
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2087 place count 687 transition count 1142
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2088 place count 687 transition count 1141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2089 place count 686 transition count 1141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2089 place count 686 transition count 1140
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2091 place count 685 transition count 1140
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2093 place count 683 transition count 1138
Iterating global reduction 7 with 2 rules applied. Total rules applied 2095 place count 683 transition count 1138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2097 place count 683 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2098 place count 682 transition count 1136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2100 place count 681 transition count 1141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2102 place count 679 transition count 1139
Reduce places removed 8 places and 0 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 9 with 12 rules applied. Total rules applied 2114 place count 671 transition count 1135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2118 place count 667 transition count 1135
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 12 Pre rules applied. Total rules applied 2118 place count 667 transition count 1123
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 25 rules applied. Total rules applied 2143 place count 654 transition count 1123
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 11 with 9 rules applied. Total rules applied 2152 place count 645 transition count 1123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2152 place count 645 transition count 1122
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2154 place count 644 transition count 1122
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 12 with 26 rules applied. Total rules applied 2180 place count 631 transition count 1109
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 2188 place count 623 transition count 1101
Iterating global reduction 12 with 8 rules applied. Total rules applied 2196 place count 623 transition count 1101
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2200 place count 619 transition count 1097
Iterating global reduction 12 with 4 rules applied. Total rules applied 2204 place count 619 transition count 1097
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2208 place count 619 transition count 1093
Applied a total of 2208 rules in 368 ms. Remains 619 /1765 variables (removed 1146) and now considering 1093/2153 (removed 1060) transitions.
// Phase 1: matrix 1093 rows 619 cols
[2024-05-31 22:36:31] [INFO ] Computed 102 invariants in 10 ms
[2024-05-31 22:36:32] [INFO ] Implicit Places using invariants in 1242 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 505, 516, 517, 518, 536, 557, 558, 559, 560]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1250 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 578/1765 places, 1093/2153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 578 transition count 1021
Reduce places removed 72 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 145 place count 506 transition count 1020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 505 transition count 1020
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 146 place count 505 transition count 998
Deduced a syphon composed of 22 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 191 place count 482 transition count 998
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 203 place count 478 transition count 990
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 211 place count 470 transition count 990
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 214 place count 467 transition count 987
Iterating global reduction 5 with 3 rules applied. Total rules applied 217 place count 467 transition count 987
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 220 place count 467 transition count 984
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 288 place count 433 transition count 950
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 292 place count 431 transition count 951
Applied a total of 292 rules in 99 ms. Remains 431 /578 variables (removed 147) and now considering 951/1093 (removed 142) transitions.
// Phase 1: matrix 951 rows 431 cols
[2024-05-31 22:36:32] [INFO ] Computed 56 invariants in 13 ms
[2024-05-31 22:36:33] [INFO ] Implicit Places using invariants in 865 ms returned [88, 94, 99, 182, 187, 264, 270, 275, 352, 358, 363, 428]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 867 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 419/1765 places, 951/2153 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 419 transition count 950
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 418 transition count 950
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 9 place count 411 transition count 943
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 411 transition count 943
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 23 place count 404 transition count 936
Iterating global reduction 2 with 7 rules applied. Total rules applied 30 place count 404 transition count 936
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 401 transition count 933
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 401 transition count 933
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 2 with 8 rules applied. Total rules applied 44 place count 397 transition count 929
Applied a total of 44 rules in 86 ms. Remains 397 /419 variables (removed 22) and now considering 929/951 (removed 22) transitions.
// Phase 1: matrix 929 rows 397 cols
[2024-05-31 22:36:33] [INFO ] Computed 44 invariants in 11 ms
[2024-05-31 22:36:34] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-05-31 22:36:34] [INFO ] Invariant cache hit.
[2024-05-31 22:36:35] [INFO ] Implicit Places using invariants and state equation in 1840 ms returned []
Implicit Place search using SMT with State Equation took 2668 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 397/1765 places, 929/2153 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5341 ms. Remains : 397/1765 places, 929/2153 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-10
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-10 finished in 5487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(!p0) U p1))))'
Support contains 4 out of 1765 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 1764 transition count 1830
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 325 rules applied. Total rules applied 647 place count 1442 transition count 1827
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 649 place count 1440 transition count 1827
Performed 473 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 473 Pre rules applied. Total rules applied 649 place count 1440 transition count 1354
Deduced a syphon composed of 473 places in 5 ms
Ensure Unique test removed 44 places
Reduce places removed 517 places and 0 transitions.
Iterating global reduction 3 with 990 rules applied. Total rules applied 1639 place count 923 transition count 1354
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 31 rules applied. Total rules applied 1670 place count 919 transition count 1327
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1697 place count 892 transition count 1327
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1697 place count 892 transition count 1310
Deduced a syphon composed of 17 places in 4 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1748 place count 858 transition count 1310
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1748 place count 858 transition count 1294
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1780 place count 842 transition count 1294
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1782 place count 840 transition count 1292
Iterating global reduction 5 with 2 rules applied. Total rules applied 1784 place count 840 transition count 1292
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1784 place count 840 transition count 1291
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1786 place count 839 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1787 place count 838 transition count 1290
Iterating global reduction 5 with 1 rules applied. Total rules applied 1788 place count 838 transition count 1290
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 5 with 286 rules applied. Total rules applied 2074 place count 694 transition count 1148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2078 place count 690 transition count 1144
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2083 place count 689 transition count 1144
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2084 place count 689 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2085 place count 688 transition count 1143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2085 place count 688 transition count 1142
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2087 place count 687 transition count 1142
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2089 place count 685 transition count 1140
Iterating global reduction 7 with 2 rules applied. Total rules applied 2091 place count 685 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2093 place count 685 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2094 place count 684 transition count 1138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2096 place count 683 transition count 1143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2098 place count 681 transition count 1141
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 10 rules applied. Total rules applied 2108 place count 674 transition count 1138
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2111 place count 671 transition count 1138
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 10 Pre rules applied. Total rules applied 2111 place count 671 transition count 1128
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 2131 place count 661 transition count 1128
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 11 with 7 rules applied. Total rules applied 2138 place count 654 transition count 1128
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 2160 place count 643 transition count 1117
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 2167 place count 636 transition count 1110
Iterating global reduction 12 with 7 rules applied. Total rules applied 2174 place count 636 transition count 1110
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 2177 place count 633 transition count 1107
Iterating global reduction 12 with 3 rules applied. Total rules applied 2180 place count 633 transition count 1107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2183 place count 633 transition count 1104
Applied a total of 2183 rules in 590 ms. Remains 633 /1765 variables (removed 1132) and now considering 1104/2153 (removed 1049) transitions.
// Phase 1: matrix 1104 rows 633 cols
[2024-05-31 22:36:36] [INFO ] Computed 106 invariants in 17 ms
[2024-05-31 22:36:38] [INFO ] Implicit Places using invariants in 1339 ms returned [1, 18, 19, 22, 32, 49, 67, 145, 161, 162, 164, 181, 199, 219, 270, 271, 283, 284, 286, 303, 321, 341, 393, 394, 406, 407, 409, 426, 444, 464, 515, 516, 519, 530, 531, 532, 550, 571, 572, 573, 574]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1342 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 592/1765 places, 1104/2153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 592 transition count 1034
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 141 place count 522 transition count 1033
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 521 transition count 1033
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 142 place count 521 transition count 1011
Deduced a syphon composed of 22 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 187 place count 498 transition count 1011
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 199 place count 494 transition count 1003
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 207 place count 486 transition count 1003
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 210 place count 483 transition count 1000
Iterating global reduction 5 with 3 rules applied. Total rules applied 213 place count 483 transition count 1000
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 216 place count 483 transition count 997
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 288 place count 447 transition count 961
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 292 place count 445 transition count 962
Applied a total of 292 rules in 103 ms. Remains 445 /592 variables (removed 147) and now considering 962/1104 (removed 142) transitions.
// Phase 1: matrix 962 rows 445 cols
[2024-05-31 22:36:38] [INFO ] Computed 60 invariants in 13 ms
[2024-05-31 22:36:39] [INFO ] Implicit Places using invariants in 903 ms returned [91, 97, 102, 187, 193, 198, 277, 283, 288, 366, 372, 377, 442]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 906 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 432/1765 places, 962/2153 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 432 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 431 transition count 961
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 423 transition count 953
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 423 transition count 953
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 25 place count 416 transition count 946
Iterating global reduction 2 with 7 rules applied. Total rules applied 32 place count 416 transition count 946
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 413 transition count 943
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 413 transition count 943
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 2 with 8 rules applied. Total rules applied 46 place count 409 transition count 939
Applied a total of 46 rules in 90 ms. Remains 409 /432 variables (removed 23) and now considering 939/962 (removed 23) transitions.
// Phase 1: matrix 939 rows 409 cols
[2024-05-31 22:36:39] [INFO ] Computed 47 invariants in 11 ms
[2024-05-31 22:36:39] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-05-31 22:36:40] [INFO ] Invariant cache hit.
[2024-05-31 22:36:41] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 2502 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 409/1765 places, 939/2153 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5534 ms. Remains : 409/1765 places, 939/2153 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-11
Product exploration explored 100000 steps with 1581 reset in 237 ms.
Product exploration explored 100000 steps with 1603 reset in 273 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), (X (NOT (AND (NOT p1) p0))), (X p1), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (634 resets) in 228 ms. (174 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (163 resets) in 670 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (167 resets) in 501 ms. (79 steps per ms) remains 2/2 properties
[2024-05-31 22:36:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/233 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/267 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 142/409 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 939/1348 variables, 409/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1348 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1348 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1348/1348 variables, and 456 constraints, problems are : Problem set: 0 solved, 2 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/233 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/267 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 142/409 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 939/1348 variables, 409/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1348 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1348 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1348 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1348/1348 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1788ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 298 ms.
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 939/939 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 409 transition count 919
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 43 place count 389 transition count 916
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 58 place count 389 transition count 901
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 75 place count 373 transition count 900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 75 place count 373 transition count 899
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 77 place count 372 transition count 899
Applied a total of 77 rules in 68 ms. Remains 372 /409 variables (removed 37) and now considering 899/939 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 372/409 places, 899/939 transitions.
RANDOM walk for 40000 steps (825 resets) in 1048 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (219 resets) in 470 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (196 resets) in 490 ms. (81 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 258720 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 2
Probabilistic random walk after 258720 steps, saw 82473 distinct states, run finished after 3004 ms. (steps per millisecond=86 ) properties seen :0
// Phase 1: matrix 899 rows 372 cols
[2024-05-31 22:36:48] [INFO ] Computed 46 invariants in 7 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/214 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/244 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 128/372 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 899/1271 variables, 372/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1271 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1271 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1271/1271 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/214 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/244 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 128/372 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 899/1271 variables, 372/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1271 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1271 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1271 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1271/1271 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1670ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 698 ms.
Support contains 4 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 899/899 transitions.
Applied a total of 0 rules in 18 ms. Remains 372 /372 variables (removed 0) and now considering 899/899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 372/372 places, 899/899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 899/899 transitions.
Applied a total of 0 rules in 17 ms. Remains 372 /372 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2024-05-31 22:36:51] [INFO ] Invariant cache hit.
[2024-05-31 22:36:51] [INFO ] Implicit Places using invariants in 707 ms returned [93, 94, 99, 100, 170, 171, 242, 243]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 714 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 364/372 places, 899/899 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 363 transition count 898
Applied a total of 2 rules in 26 ms. Remains 363 /364 variables (removed 1) and now considering 898/899 (removed 1) transitions.
// Phase 1: matrix 898 rows 363 cols
[2024-05-31 22:36:51] [INFO ] Computed 38 invariants in 11 ms
[2024-05-31 22:36:52] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-05-31 22:36:52] [INFO ] Invariant cache hit.
[2024-05-31 22:36:53] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 363/372 places, 898/899 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2706 ms. Remains : 363/372 places, 898/899 transitions.
RANDOM walk for 40000 steps (800 resets) in 1481 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (216 resets) in 450 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (213 resets) in 456 ms. (87 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 223644 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 2
Probabilistic random walk after 223644 steps, saw 72261 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-31 22:36:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 243/282 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/314 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 49/363 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 898/1261 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1261 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1261 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1261/1261 variables, and 401 constraints, problems are : Problem set: 0 solved, 2 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 243/282 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/314 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 49/363 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 898/1261 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1261 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1261 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1261 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1261/1261 variables, and 403 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1474ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 923 ms.
Support contains 4 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 898/898 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 363/363 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 898/898 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-05-31 22:37:00] [INFO ] Invariant cache hit.
[2024-05-31 22:37:00] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-31 22:37:00] [INFO ] Invariant cache hit.
[2024-05-31 22:37:02] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 2097 ms to find 0 implicit places.
[2024-05-31 22:37:02] [INFO ] Redundant transitions in 14 ms returned []
Running 873 sub problems to find dead transitions.
[2024-05-31 22:37:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 3 (OVERLAPS) 1/363 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 873 unsolved
SMT process timed out in 30799ms, After SMT, problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 30816ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32959 ms. Remains : 363/363 places, 898/898 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 14 ms. Remains 363 /363 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-31 22:37:33] [INFO ] Invariant cache hit.
[2024-05-31 22:37:33] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:37:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-31 22:37:33] [INFO ] [Nat]Absence check using 10 positive and 28 generalized place invariants in 25 ms returned sat
[2024-05-31 22:37:34] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:37:34] [INFO ] After 861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:37:34] [INFO ] After 1149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1313 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (AND p1 p0)), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 249 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 939/939 transitions.
Applied a total of 0 rules in 30 ms. Remains 409 /409 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 409 cols
[2024-05-31 22:37:34] [INFO ] Computed 47 invariants in 12 ms
[2024-05-31 22:37:35] [INFO ] Implicit Places using invariants in 845 ms returned []
[2024-05-31 22:37:35] [INFO ] Invariant cache hit.
[2024-05-31 22:37:37] [INFO ] Implicit Places using invariants and state equation in 1735 ms returned []
Implicit Place search using SMT with State Equation took 2589 ms to find 0 implicit places.
[2024-05-31 22:37:37] [INFO ] Redundant transitions in 16 ms returned []
Running 906 sub problems to find dead transitions.
[2024-05-31 22:37:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 2/406 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
SMT process timed out in 30728ms, After SMT, problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 30750ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33399 ms. Remains : 409/409 places, 939/939 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 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 160 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (676 resets) in 2475 ms. (16 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (171 resets) in 425 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (180 resets) in 340 ms. (117 steps per ms) remains 2/2 properties
[2024-05-31 22:38:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/233 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/267 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 142/409 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 939/1348 variables, 409/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1348 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1348 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1348/1348 variables, and 456 constraints, problems are : Problem set: 0 solved, 2 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 187/233 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/267 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 142/409 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 939/1348 variables, 409/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1348 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1348 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1348 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1348/1348 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1779ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 366 ms.
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 939/939 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 409 transition count 919
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 43 place count 389 transition count 916
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 58 place count 389 transition count 901
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 75 place count 373 transition count 900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 75 place count 373 transition count 899
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 77 place count 372 transition count 899
Applied a total of 77 rules in 73 ms. Remains 372 /409 variables (removed 37) and now considering 899/939 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 372/409 places, 899/939 transitions.
RANDOM walk for 40000 steps (794 resets) in 1240 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (216 resets) in 366 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (211 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 176104 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 176104 steps, saw 58234 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 899 rows 372 cols
[2024-05-31 22:38:15] [INFO ] Computed 46 invariants in 11 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/214 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/244 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 128/372 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 899/1271 variables, 372/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1271 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1271 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1271/1271 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/214 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/244 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 128/372 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 899/1271 variables, 372/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1271 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1271 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1271 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1271/1271 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1771ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 720 ms.
Support contains 4 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 899/899 transitions.
Applied a total of 0 rules in 20 ms. Remains 372 /372 variables (removed 0) and now considering 899/899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 372/372 places, 899/899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 899/899 transitions.
Applied a total of 0 rules in 20 ms. Remains 372 /372 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2024-05-31 22:38:18] [INFO ] Invariant cache hit.
[2024-05-31 22:38:18] [INFO ] Implicit Places using invariants in 818 ms returned [93, 94, 99, 100, 170, 171, 242, 243]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 842 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 364/372 places, 899/899 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 363 transition count 898
Applied a total of 2 rules in 34 ms. Remains 363 /364 variables (removed 1) and now considering 898/899 (removed 1) transitions.
// Phase 1: matrix 898 rows 363 cols
[2024-05-31 22:38:19] [INFO ] Computed 38 invariants in 11 ms
[2024-05-31 22:38:19] [INFO ] Implicit Places using invariants in 787 ms returned []
[2024-05-31 22:38:19] [INFO ] Invariant cache hit.
[2024-05-31 22:38:21] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned []
Implicit Place search using SMT with State Equation took 2495 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 363/372 places, 898/899 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3392 ms. Remains : 363/372 places, 898/899 transitions.
RANDOM walk for 40000 steps (751 resets) in 1745 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (214 resets) in 475 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (222 resets) in 430 ms. (92 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 200667 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 200667 steps, saw 65437 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-31 22:38:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 243/282 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/314 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 49/363 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 898/1261 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1261 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1261 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1261/1261 variables, and 401 constraints, problems are : Problem set: 0 solved, 2 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 243/282 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/314 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 49/363 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 898/1261 variables, 363/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1261 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1261 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1261 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1261/1261 variables, and 403 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1724ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1116 ms.
Support contains 4 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 898/898 transitions.
Applied a total of 0 rules in 20 ms. Remains 363 /363 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 363/363 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 898/898 transitions.
Applied a total of 0 rules in 19 ms. Remains 363 /363 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-05-31 22:38:28] [INFO ] Invariant cache hit.
[2024-05-31 22:38:28] [INFO ] Implicit Places using invariants in 772 ms returned []
[2024-05-31 22:38:28] [INFO ] Invariant cache hit.
[2024-05-31 22:38:30] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
[2024-05-31 22:38:30] [INFO ] Redundant transitions in 9 ms returned []
Running 873 sub problems to find dead transitions.
[2024-05-31 22:38:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.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 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.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 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.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 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.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 1.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 0.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 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.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 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.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 0.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 1.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.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 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/363 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 873 unsolved
SMT process timed out in 30752ms, After SMT, problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 30762ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32879 ms. Remains : 363/363 places, 898/898 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 23 ms. Remains 363 /363 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-31 22:39:01] [INFO ] Invariant cache hit.
[2024-05-31 22:39:01] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:39:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-31 22:39:01] [INFO ] [Nat]Absence check using 10 positive and 28 generalized place invariants in 24 ms returned sat
[2024-05-31 22:39:02] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:39:02] [INFO ] After 885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:39:02] [INFO ] After 1171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1351 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 258 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1673 reset in 376 ms.
Product exploration explored 100000 steps with 1618 reset in 388 ms.
Support contains 4 out of 409 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 409/409 places, 939/939 transitions.
Applied a total of 0 rules in 21 ms. Remains 409 /409 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 409 cols
[2024-05-31 22:39:03] [INFO ] Computed 47 invariants in 12 ms
[2024-05-31 22:39:04] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-31 22:39:04] [INFO ] Invariant cache hit.
[2024-05-31 22:39:06] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2641 ms to find 0 implicit places.
[2024-05-31 22:39:06] [INFO ] Redundant transitions in 16 ms returned []
Running 906 sub problems to find dead transitions.
[2024-05-31 22:39:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (OVERLAPS) 2/406 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
SMT process timed out in 30717ms, After SMT, problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 30735ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33429 ms. Remains : 409/409 places, 939/939 transitions.
Treatment of property ASLink-PT-04b-LTLCardinality-11 finished in 181261 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||(p1&&F(p0))))))'
Support contains 2 out of 1765 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 : 1765/1765 places, 2153/2153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 1764 transition count 1830
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 325 rules applied. Total rules applied 647 place count 1442 transition count 1827
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 649 place count 1440 transition count 1827
Performed 474 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 474 Pre rules applied. Total rules applied 649 place count 1440 transition count 1353
Deduced a syphon composed of 474 places in 2 ms
Ensure Unique test removed 44 places
Reduce places removed 518 places and 0 transitions.
Iterating global reduction 3 with 992 rules applied. Total rules applied 1641 place count 922 transition count 1353
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 32 rules applied. Total rules applied 1673 place count 918 transition count 1325
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1701 place count 890 transition count 1325
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1701 place count 890 transition count 1309
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1749 place count 858 transition count 1309
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 1749 place count 858 transition count 1294
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1779 place count 843 transition count 1294
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1781 place count 841 transition count 1292
Iterating global reduction 5 with 2 rules applied. Total rules applied 1783 place count 841 transition count 1292
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1783 place count 841 transition count 1291
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1785 place count 840 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1786 place count 839 transition count 1290
Iterating global reduction 5 with 1 rules applied. Total rules applied 1787 place count 839 transition count 1290
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 5 with 286 rules applied. Total rules applied 2073 place count 695 transition count 1148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2077 place count 691 transition count 1144
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2082 place count 690 transition count 1144
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2083 place count 690 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2084 place count 689 transition count 1143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2084 place count 689 transition count 1142
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2086 place count 688 transition count 1142
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2088 place count 686 transition count 1140
Iterating global reduction 7 with 2 rules applied. Total rules applied 2090 place count 686 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2092 place count 686 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2093 place count 685 transition count 1138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2095 place count 684 transition count 1143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2097 place count 682 transition count 1141
Reduce places removed 8 places and 0 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 9 with 12 rules applied. Total rules applied 2109 place count 674 transition count 1137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2113 place count 670 transition count 1137
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 12 Pre rules applied. Total rules applied 2113 place count 670 transition count 1125
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 25 rules applied. Total rules applied 2138 place count 657 transition count 1125
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 11 with 9 rules applied. Total rules applied 2147 place count 648 transition count 1125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2147 place count 648 transition count 1124
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2149 place count 647 transition count 1124
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 12 with 26 rules applied. Total rules applied 2175 place count 634 transition count 1111
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 2183 place count 626 transition count 1103
Iterating global reduction 12 with 8 rules applied. Total rules applied 2191 place count 626 transition count 1103
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2195 place count 622 transition count 1099
Iterating global reduction 12 with 4 rules applied. Total rules applied 2199 place count 622 transition count 1099
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2203 place count 622 transition count 1095
Applied a total of 2203 rules in 456 ms. Remains 622 /1765 variables (removed 1143) and now considering 1095/2153 (removed 1058) transitions.
// Phase 1: matrix 1095 rows 622 cols
[2024-05-31 22:39:37] [INFO ] Computed 103 invariants in 10 ms
[2024-05-31 22:39:38] [INFO ] Implicit Places using invariants in 1002 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 206, 239, 260, 261, 273, 274, 276, 293, 311, 331, 382, 383, 395, 396, 398, 415, 433, 453, 504, 505, 508, 519, 520, 521, 539, 560, 561, 562, 563]
[2024-05-31 22:39:38] [INFO ] Actually due to overlaps returned [539, 521, 48, 167, 293, 415, 31, 147, 150, 273, 276, 395, 398, 519, 560, 148, 274, 396, 520, 561, 1, 18, 260, 261, 382, 383, 504, 505, 562, 19, 66, 86, 137, 185, 206, 311, 331, 433, 453, 508, 563]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1005 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/1765 places, 1095/2153 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 580 transition count 1026
Reduce places removed 69 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 74 rules applied. Total rules applied 144 place count 511 transition count 1021
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 149 place count 506 transition count 1021
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 149 place count 506 transition count 998
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 196 place count 482 transition count 998
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 208 place count 478 transition count 990
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 216 place count 470 transition count 990
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 219 place count 467 transition count 987
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 467 transition count 987
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 225 place count 467 transition count 984
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 291 place count 434 transition count 951
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 295 place count 432 transition count 952
Applied a total of 295 rules in 99 ms. Remains 432 /581 variables (removed 149) and now considering 952/1095 (removed 143) transitions.
// Phase 1: matrix 952 rows 432 cols
[2024-05-31 22:39:38] [INFO ] Computed 56 invariants in 8 ms
[2024-05-31 22:39:39] [INFO ] Implicit Places using invariants in 682 ms returned [88, 94, 99, 183, 188, 265, 271, 276, 353, 359, 364, 429]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 684 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 420/1765 places, 952/2153 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 420 transition count 951
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 419 transition count 951
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 9 place count 412 transition count 944
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 412 transition count 944
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 23 place count 405 transition count 937
Iterating global reduction 2 with 7 rules applied. Total rules applied 30 place count 405 transition count 937
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 402 transition count 934
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 402 transition count 934
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 2 with 8 rules applied. Total rules applied 44 place count 398 transition count 930
Applied a total of 44 rules in 57 ms. Remains 398 /420 variables (removed 22) and now considering 930/952 (removed 22) transitions.
// Phase 1: matrix 930 rows 398 cols
[2024-05-31 22:39:39] [INFO ] Computed 44 invariants in 8 ms
[2024-05-31 22:39:40] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-31 22:39:40] [INFO ] Invariant cache hit.
[2024-05-31 22:39:41] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 398/1765 places, 930/2153 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4104 ms. Remains : 398/1765 places, 930/2153 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-13
Stuttering criterion allowed to conclude after 178 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-04b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-13 finished in 4195 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)||X(X(((G(p2)||p1) U X(p3)))))))'
Support contains 5 out of 1765 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1763 transition count 2151
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1763 transition count 2151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1762 transition count 2150
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1762 transition count 2150
Applied a total of 6 rules in 291 ms. Remains 1762 /1765 variables (removed 3) and now considering 2150/2153 (removed 3) transitions.
// Phase 1: matrix 2150 rows 1762 cols
[2024-05-31 22:39:41] [INFO ] Computed 188 invariants in 23 ms
[2024-05-31 22:39:43] [INFO ] Implicit Places using invariants in 1432 ms returned []
[2024-05-31 22:39:43] [INFO ] Invariant cache hit.
[2024-05-31 22:39:50] [INFO ] Implicit Places using invariants and state equation in 7487 ms returned []
Implicit Place search using SMT with State Equation took 8922 ms to find 0 implicit places.
Running 2149 sub problems to find dead transitions.
[2024-05-31 22:39:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1761 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1761/3912 variables, and 110 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 110/142 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 2149/2149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1761 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1761/3912 variables, and 110 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 110/142 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 0/2149 constraints, Known Traps: 0/0 constraints]
After SMT, in 60947ms problems are : Problem set: 0 solved, 2149 unsolved
Search for dead transitions found 0 dead transitions in 60979ms
Starting structural reductions in LTL mode, iteration 1 : 1762/1765 places, 2150/2153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70198 ms. Remains : 1762/1765 places, 2150/2153 transitions.
Stuttering acceptance computed with spot in 706 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-15
Stuttering criterion allowed to conclude after 8949 steps with 25 reset in 35 ms.
FORMULA ASLink-PT-04b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-15 finished in 70981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U (G(!p1)||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(X(F((p0||X(p1))))))'
Found a Shortening insensitive property : ASLink-PT-04b-LTLCardinality-02
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 1765 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 1764 transition count 1837
Reduce places removed 315 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 318 rules applied. Total rules applied 633 place count 1449 transition count 1834
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 640 place count 1447 transition count 1829
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 645 place count 1442 transition count 1829
Performed 470 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 470 Pre rules applied. Total rules applied 645 place count 1442 transition count 1359
Deduced a syphon composed of 470 places in 2 ms
Ensure Unique test removed 43 places
Reduce places removed 513 places and 0 transitions.
Iterating global reduction 4 with 983 rules applied. Total rules applied 1628 place count 929 transition count 1359
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 4 with 33 rules applied. Total rules applied 1661 place count 923 transition count 1332
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 28 rules applied. Total rules applied 1689 place count 896 transition count 1331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1690 place count 895 transition count 1331
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 17 Pre rules applied. Total rules applied 1690 place count 895 transition count 1314
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 16 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 1740 place count 862 transition count 1314
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 15 Pre rules applied. Total rules applied 1740 place count 862 transition count 1299
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 1770 place count 847 transition count 1299
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1772 place count 845 transition count 1297
Iterating global reduction 7 with 2 rules applied. Total rules applied 1774 place count 845 transition count 1297
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1774 place count 845 transition count 1296
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 1776 place count 844 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1777 place count 843 transition count 1295
Iterating global reduction 7 with 1 rules applied. Total rules applied 1778 place count 843 transition count 1295
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 2064 place count 699 transition count 1153
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2068 place count 695 transition count 1149
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 2073 place count 694 transition count 1149
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 2074 place count 694 transition count 1148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2075 place count 693 transition count 1148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2075 place count 693 transition count 1147
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2077 place count 692 transition count 1147
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2079 place count 690 transition count 1145
Iterating global reduction 9 with 2 rules applied. Total rules applied 2081 place count 690 transition count 1145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 2083 place count 690 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2084 place count 689 transition count 1143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2086 place count 688 transition count 1148
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2088 place count 686 transition count 1146
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 11 with 10 rules applied. Total rules applied 2098 place count 679 transition count 1143
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2101 place count 676 transition count 1143
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 11 Pre rules applied. Total rules applied 2101 place count 676 transition count 1132
Deduced a syphon composed of 11 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 13 with 23 rules applied. Total rules applied 2124 place count 664 transition count 1132
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 13 with 8 rules applied. Total rules applied 2132 place count 656 transition count 1132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2132 place count 656 transition count 1131
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2134 place count 655 transition count 1131
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 14 with 24 rules applied. Total rules applied 2158 place count 643 transition count 1119
Discarding 7 places :
Symmetric choice reduction at 14 with 7 rule applications. Total rules 2165 place count 636 transition count 1112
Iterating global reduction 14 with 7 rules applied. Total rules applied 2172 place count 636 transition count 1112
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2176 place count 632 transition count 1108
Iterating global reduction 14 with 4 rules applied. Total rules applied 2180 place count 632 transition count 1108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2184 place count 632 transition count 1104
Applied a total of 2184 rules in 467 ms. Remains 632 /1765 variables (removed 1133) and now considering 1104/2153 (removed 1049) transitions.
// Phase 1: matrix 1104 rows 632 cols
[2024-05-31 22:40:53] [INFO ] Computed 104 invariants in 11 ms
[2024-05-31 22:40:54] [INFO ] Implicit Places using invariants in 731 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 206, 264, 265, 277, 278, 279, 281, 298, 316, 336, 387, 388, 401, 404, 421, 439, 459, 514, 515, 518, 529, 530, 531, 549, 570, 571, 572, 573]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 735 ms to find 41 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 591/1765 places, 1104/2153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 591 transition count 1035
Reduce places removed 69 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 74 rules applied. Total rules applied 143 place count 522 transition count 1030
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 148 place count 517 transition count 1030
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 148 place count 517 transition count 1010
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 189 place count 496 transition count 1010
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 201 place count 492 transition count 1002
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 209 place count 484 transition count 1002
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 212 place count 481 transition count 999
Iterating global reduction 5 with 3 rules applied. Total rules applied 215 place count 481 transition count 999
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 218 place count 481 transition count 996
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 284 place count 448 transition count 963
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 288 place count 446 transition count 964
Applied a total of 288 rules in 75 ms. Remains 446 /591 variables (removed 145) and now considering 964/1104 (removed 140) transitions.
// Phase 1: matrix 964 rows 446 cols
[2024-05-31 22:40:54] [INFO ] Computed 58 invariants in 7 ms
[2024-05-31 22:40:54] [INFO ] Implicit Places using invariants in 480 ms returned [88, 94, 99, 175, 181, 186, 373, 378, 443]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 487 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 437/1765 places, 964/2153 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 437 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 436 transition count 963
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 7 place count 431 transition count 958
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 431 transition count 958
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 426 transition count 953
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 426 transition count 953
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 424 transition count 951
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 424 transition count 951
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 421 transition count 948
Applied a total of 32 rules in 58 ms. Remains 421 /437 variables (removed 16) and now considering 948/964 (removed 16) transitions.
// Phase 1: matrix 948 rows 421 cols
[2024-05-31 22:40:54] [INFO ] Computed 49 invariants in 7 ms
[2024-05-31 22:40:55] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-31 22:40:55] [INFO ] Invariant cache hit.
[2024-05-31 22:40:56] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 421/1765 places, 948/2153 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 3404 ms. Remains : 421/1765 places, 948/2153 transitions.
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-02
Product exploration explored 100000 steps with 11942 reset in 297 ms.
Product exploration explored 100000 steps with 11912 reset in 304 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 195 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 9011 steps (122 resets) in 38 ms. (231 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 22:40:57] [INFO ] Invariant cache hit.
[2024-05-31 22:40:58] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-31 22:40:58] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 34 ms returned sat
[2024-05-31 22:40:59] [INFO ] [Real]Absence check using state equation in 1230 ms returned sat
[2024-05-31 22:40:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:41:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-31 22:41:00] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 29 ms returned sat
[2024-05-31 22:41:02] [INFO ] [Nat]Absence check using state equation in 1558 ms returned sat
[2024-05-31 22:41:02] [INFO ] Computed and/alt/rep : 283/1341/283 causal constraints (skipped 636 transitions) in 99 ms.
[2024-05-31 22:41:03] [INFO ] Added : 85 causal constraints over 18 iterations in 1440 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 948/948 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 948/948 (removed 0) transitions.
[2024-05-31 22:41:03] [INFO ] Invariant cache hit.
[2024-05-31 22:41:04] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-31 22:41:04] [INFO ] Invariant cache hit.
[2024-05-31 22:41:05] [INFO ] Implicit Places using invariants and state equation in 1159 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
Running 919 sub problems to find dead transitions.
[2024-05-31 22:41:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (OVERLAPS) 4/419 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1369 variables, and 42 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/36 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 919/919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (OVERLAPS) 4/419 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 919 unsolved
[2024-05-31 22:41:52] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 3 ms to minimize.
[2024-05-31 22:41:52] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 2 ms to minimize.
[2024-05-31 22:41:52] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 3 ms to minimize.
[2024-05-31 22:41:53] [INFO ] Deduced a trap composed of 87 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/1369 variables, and 46 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/36 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 0/919 constraints, Known Traps: 4/4 constraints]
After SMT, in 60600ms problems are : Problem set: 0 solved, 919 unsolved
Search for dead transitions found 0 dead transitions in 60611ms
Finished structural reductions in LTL mode , in 1 iterations and 62313 ms. Remains : 421/421 places, 948/948 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 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 11247 steps (160 resets) in 33 ms. (330 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 22:42:06] [INFO ] Invariant cache hit.
[2024-05-31 22:42:07] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-31 22:42:07] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 52 ms returned sat
[2024-05-31 22:42:09] [INFO ] [Real]Absence check using state equation in 1375 ms returned sat
[2024-05-31 22:42:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:42:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-31 22:42:09] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 32 ms returned sat
[2024-05-31 22:42:11] [INFO ] [Nat]Absence check using state equation in 1584 ms returned sat
[2024-05-31 22:42:11] [INFO ] Computed and/alt/rep : 283/1341/283 causal constraints (skipped 636 transitions) in 98 ms.
[2024-05-31 22:42:12] [INFO ] Added : 85 causal constraints over 18 iterations in 1409 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11919 reset in 302 ms.
Product exploration explored 100000 steps with 11906 reset in 321 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 948/948 transitions.
Applied a total of 0 rules in 13 ms. Remains 421 /421 variables (removed 0) and now considering 948/948 (removed 0) transitions.
[2024-05-31 22:42:14] [INFO ] Redundant transitions in 10 ms returned []
Running 919 sub problems to find dead transitions.
[2024-05-31 22:42:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (OVERLAPS) 4/419 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1369 variables, and 42 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/36 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 919/919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (OVERLAPS) 4/419 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 919 unsolved
[2024-05-31 22:43:01] [INFO ] Deduced a trap composed of 82 places in 199 ms of which 3 ms to minimize.
[2024-05-31 22:43:01] [INFO ] Deduced a trap composed of 99 places in 185 ms of which 3 ms to minimize.
[2024-05-31 22:43:01] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 3 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 87 places in 206 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/1369 variables, and 46 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/36 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 0/919 constraints, Known Traps: 4/4 constraints]
After SMT, in 60610ms problems are : Problem set: 0 solved, 919 unsolved
Search for dead transitions found 0 dead transitions in 60621ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60654 ms. Remains : 421/421 places, 948/948 transitions.
Support contains 6 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 948/948 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 948/948 (removed 0) transitions.
[2024-05-31 22:43:14] [INFO ] Invariant cache hit.
[2024-05-31 22:43:15] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-31 22:43:15] [INFO ] Invariant cache hit.
[2024-05-31 22:43:16] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
Running 919 sub problems to find dead transitions.
[2024-05-31 22:43:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (OVERLAPS) 4/419 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 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 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.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 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.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)
(s72 1.0)
(s73 1.0)
(s74 4.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 6.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.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 1.0)
(s149 1.0)
(s150 4.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 6.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 2.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 1.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 0.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 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.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 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.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 0.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 0.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 1.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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1369 variables, and 42 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/36 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 919/919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (OVERLAPS) 4/419 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 919 unsolved
[2024-05-31 22:44:02] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 3 ms to minimize.
[2024-05-31 22:44:03] [INFO ] Deduced a trap composed of 99 places in 185 ms of which 2 ms to minimize.
[2024-05-31 22:44:03] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 2 ms to minimize.
[2024-05-31 22:44:03] [INFO ] Deduced a trap composed of 87 places in 187 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 919 unsolved
(s42 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/1369 variables, and 46 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/36 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 0/919 constraints, Known Traps: 4/4 constraints]
After SMT, in 60606ms problems are : Problem set: 0 solved, 919 unsolved
Search for dead transitions found 0 dead transitions in 60619ms
Finished structural reductions in LTL mode , in 1 iterations and 62530 ms. Remains : 421/421 places, 948/948 transitions.
Treatment of property ASLink-PT-04b-LTLCardinality-02 finished in 204518 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(X(F(p0)))))'
Found a Shortening insensitive property : ASLink-PT-04b-LTLCardinality-04
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1765 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1765/1765 places, 2153/2153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 1764 transition count 1830
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 325 rules applied. Total rules applied 647 place count 1442 transition count 1827
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 649 place count 1440 transition count 1827
Performed 473 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 473 Pre rules applied. Total rules applied 649 place count 1440 transition count 1354
Deduced a syphon composed of 473 places in 3 ms
Ensure Unique test removed 43 places
Reduce places removed 516 places and 0 transitions.
Iterating global reduction 3 with 989 rules applied. Total rules applied 1638 place count 924 transition count 1354
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 32 rules applied. Total rules applied 1670 place count 919 transition count 1327
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1697 place count 892 transition count 1327
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1697 place count 892 transition count 1310
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1748 place count 858 transition count 1310
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1748 place count 858 transition count 1294
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 1780 place count 842 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1781 place count 841 transition count 1293
Iterating global reduction 5 with 1 rules applied. Total rules applied 1782 place count 841 transition count 1293
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1782 place count 841 transition count 1292
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1784 place count 840 transition count 1292
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 5 with 287 rules applied. Total rules applied 2071 place count 696 transition count 1149
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2075 place count 692 transition count 1145
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2080 place count 691 transition count 1145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2080 place count 691 transition count 1144
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2082 place count 690 transition count 1144
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2084 place count 688 transition count 1142
Iterating global reduction 5 with 2 rules applied. Total rules applied 2086 place count 688 transition count 1142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2088 place count 688 transition count 1140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2089 place count 687 transition count 1140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2091 place count 686 transition count 1145
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2093 place count 684 transition count 1143
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 10 rules applied. Total rules applied 2103 place count 677 transition count 1140
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2106 place count 674 transition count 1140
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 2106 place count 674 transition count 1130
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 2126 place count 664 transition count 1130
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 9 with 7 rules applied. Total rules applied 2133 place count 657 transition count 1130
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 2155 place count 646 transition count 1119
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 2162 place count 639 transition count 1112
Iterating global reduction 10 with 7 rules applied. Total rules applied 2169 place count 639 transition count 1112
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2172 place count 636 transition count 1109
Iterating global reduction 10 with 3 rules applied. Total rules applied 2175 place count 636 transition count 1109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2178 place count 636 transition count 1106
Applied a total of 2178 rules in 386 ms. Remains 636 /1765 variables (removed 1129) and now considering 1106/2153 (removed 1047) transitions.
// Phase 1: matrix 1106 rows 636 cols
[2024-05-31 22:44:17] [INFO ] Computed 107 invariants in 11 ms
[2024-05-31 22:44:18] [INFO ] Implicit Places using invariants in 1013 ms returned [1, 18, 19, 22, 32, 49, 67, 144, 161, 162, 164, 181, 199, 219, 270, 271, 283, 284, 286, 303, 321, 341, 392, 393, 405, 406, 408, 425, 443, 463, 514, 515, 518, 529, 530, 531, 549, 553, 571, 572, 573, 574]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 1024 ms to find 42 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 594/1765 places, 1106/2153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 594 transition count 1033
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 521 transition count 1033
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 146 place count 521 transition count 1011
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 191 place count 498 transition count 1011
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 203 place count 494 transition count 1003
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 211 place count 486 transition count 1003
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 214 place count 483 transition count 1000
Iterating global reduction 4 with 3 rules applied. Total rules applied 217 place count 483 transition count 1000
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 220 place count 483 transition count 997
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 294 place count 446 transition count 960
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 298 place count 444 transition count 961
Applied a total of 298 rules in 63 ms. Remains 444 /594 variables (removed 150) and now considering 961/1106 (removed 145) transitions.
// Phase 1: matrix 961 rows 444 cols
[2024-05-31 22:44:18] [INFO ] Computed 60 invariants in 11 ms
[2024-05-31 22:44:19] [INFO ] Implicit Places using invariants in 618 ms returned [90, 96, 101, 187, 193, 198, 275, 281, 286, 363, 369, 374, 441]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 620 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 431/1765 places, 961/2153 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 431 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 960
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 422 transition count 952
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 422 transition count 952
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 414 transition count 944
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 414 transition count 944
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 410 transition count 940
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 410 transition count 940
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 2 with 8 rules applied. Total rules applied 50 place count 406 transition count 936
Applied a total of 50 rules in 56 ms. Remains 406 /431 variables (removed 25) and now considering 936/961 (removed 25) transitions.
// Phase 1: matrix 936 rows 406 cols
[2024-05-31 22:44:19] [INFO ] Computed 47 invariants in 7 ms
[2024-05-31 22:44:20] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-31 22:44:20] [INFO ] Invariant cache hit.
[2024-05-31 22:44:21] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 406/1765 places, 936/2153 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 3914 ms. Remains : 406/1765 places, 936/2153 transitions.
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 325 ms.
Product exploration explored 100000 steps with 25000 reset in 340 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (629 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (170 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 419409 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 419409 steps, saw 111630 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2024-05-31 22:44:25] [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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/38 variables, 3/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) 32/70 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 148/218 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/257 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 147/404 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/406 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 936/1342 variables, 406/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1342 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1342/1342 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 406/406 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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/38 variables, 3/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) 32/70 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 148/218 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/257 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 147/404 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/406 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 936/1342 variables, 406/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1342 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1342/1342 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 406/406 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1116ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 936/936 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 406 transition count 916
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 43 place count 386 transition count 913
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 386 transition count 900
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 69 place count 373 transition count 900
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 70 place count 373 transition count 899
Applied a total of 70 rules in 55 ms. Remains 373 /406 variables (removed 33) and now considering 899/936 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 373/406 places, 899/936 transitions.
RANDOM walk for 40000 steps (819 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (217 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 388939 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 388939 steps, saw 131782 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
// Phase 1: matrix 899 rows 373 cols
[2024-05-31 22:44:29] [INFO ] Computed 47 invariants in 6 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) 31/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:44:29] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/105 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/129 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/249 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/257 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 116/373 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 899/1272 variables, 373/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1272 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 31/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/105 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/129 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/249 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/257 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 116/373 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 899/1272 variables, 373/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1272 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 899/899 transitions.
Applied a total of 0 rules in 12 ms. Remains 373 /373 variables (removed 0) and now considering 899/899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 373/373 places, 899/899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 899/899 transitions.
Applied a total of 0 rules in 12 ms. Remains 373 /373 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2024-05-31 22:44:30] [INFO ] Invariant cache hit.
[2024-05-31 22:44:31] [INFO ] Implicit Places using invariants in 546 ms returned [90, 97, 98, 170, 171, 241, 242]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 548 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 366/373 places, 899/899 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 365 transition count 898
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 365 transition count 898
Applied a total of 2 rules in 21 ms. Remains 365 /366 variables (removed 1) and now considering 898/899 (removed 1) transitions.
// Phase 1: matrix 898 rows 365 cols
[2024-05-31 22:44:31] [INFO ] Computed 40 invariants in 7 ms
[2024-05-31 22:44:31] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-31 22:44:31] [INFO ] Invariant cache hit.
[2024-05-31 22:44:32] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 365/373 places, 898/899 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2155 ms. Remains : 365/373 places, 898/899 transitions.
RANDOM walk for 40000 steps (790 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (222 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 399108 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 399108 steps, saw 134764 distinct states, run finished after 3004 ms. (steps per millisecond=132 ) properties seen :0
[2024-05-31 22:44:36] [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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/189 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 149/338 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/354 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/365 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 898/1263 variables, 365/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1263 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1263/1263 variables, and 405 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 365/365 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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/189 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 149/338 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/354 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/365 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 898/1263 variables, 365/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1263 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1263 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1263/1263 variables, and 406 constraints, problems are : Problem set: 0 solved, 1 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 926ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 2 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 898/898 transitions.
Applied a total of 0 rules in 12 ms. Remains 365 /365 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 365/365 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 898/898 transitions.
Applied a total of 0 rules in 11 ms. Remains 365 /365 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-05-31 22:44:37] [INFO ] Invariant cache hit.
[2024-05-31 22:44:37] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-31 22:44:37] [INFO ] Invariant cache hit.
[2024-05-31 22:44:38] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
[2024-05-31 22:44:38] [INFO ] Redundant transitions in 10 ms returned []
Running 873 sub problems to find dead transitions.
[2024-05-31 22:44:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 3 (OVERLAPS) 1/365 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 873 unsolved
[2024-05-31 22:45:02] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:45:05] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-05-31 22:45:08] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 3 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 Real declared 365/1263 variables, and 43 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/365 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 3 (OVERLAPS) 1/365 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 873 unsolved
[2024-05-31 22:45:30] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1263 variables, and 44 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/365 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 4/4 constraints]
After SMT, in 60619ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60630ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62186 ms. Remains : 365/365 places, 898/898 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 365 transition count 897
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 364 transition count 897
Applied a total of 2 rules in 16 ms. Remains 364 /365 variables (removed 1) and now considering 897/898 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 897 rows 364 cols
[2024-05-31 22:45:39] [INFO ] Computed 40 invariants in 7 ms
[2024-05-31 22:45:39] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:45:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-31 22:45:39] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 21 ms returned sat
[2024-05-31 22:45:39] [INFO ] After 445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:45:39] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:45:39] [INFO ] After 638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 757 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 406/406 places, 936/936 transitions.
Applied a total of 0 rules in 7 ms. Remains 406 /406 variables (removed 0) and now considering 936/936 (removed 0) transitions.
// Phase 1: matrix 936 rows 406 cols
[2024-05-31 22:45:40] [INFO ] Computed 47 invariants in 7 ms
[2024-05-31 22:45:40] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-31 22:45:40] [INFO ] Invariant cache hit.
[2024-05-31 22:45:41] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
Running 903 sub problems to find dead transitions.
[2024-05-31 22:45:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 3 (OVERLAPS) 2/403 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-05-31 22:46:07] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 3 ms to minimize.
[2024-05-31 22:46:08] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:46:08] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.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 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.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 0.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s72 8.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 4.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.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 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s162 1.0)
(s163 1.0)
(s164 4.0)
(s165 0.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 6.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 0.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)
(s241 1.0)
(s242 1.0)
(s243 4.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 6.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.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 1.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 0.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 0.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 1.0)
(s324 1.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/1342 variables, and 41 constraints, problems are : Problem set: 0 solved, 903 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/406 constraints, PredecessorRefiner: 903/903 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 903 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 3 (OVERLAPS) 2/403 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-05-31 22:46:27] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-05-31 22:46:38] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 903 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/1342 variables, and 43 constraints, problems are : Problem set: 0 solved, 903 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/406 constraints, PredecessorRefiner: 0/903 constraints, Known Traps: 5/5 constraints]
After SMT, in 60567ms problems are : Problem set: 0 solved, 903 unsolved
Search for dead transitions found 0 dead transitions in 60579ms
Finished structural reductions in LTL mode , in 1 iterations and 62251 ms. Remains : 406/406 places, 936/936 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (642 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (177 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 419943 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 419943 steps, saw 111791 distinct states, run finished after 3002 ms. (steps per millisecond=139 ) properties seen :0
[2024-05-31 22:46: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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/38 variables, 3/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) 32/70 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 148/218 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/257 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 147/404 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/406 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 936/1342 variables, 406/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1342 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1342/1342 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 406/406 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) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/38 variables, 3/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) 32/70 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 148/218 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/257 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 147/404 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/406 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 936/1342 variables, 406/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1342 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1342/1342 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 406/406 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1077ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 2 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 936/936 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 406 transition count 916
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 43 place count 386 transition count 913
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 386 transition count 900
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 69 place count 373 transition count 900
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 70 place count 373 transition count 899
Applied a total of 70 rules in 55 ms. Remains 373 /406 variables (removed 33) and now considering 899/936 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 373/406 places, 899/936 transitions.
RANDOM walk for 40000 steps (766 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (220 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 391149 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 391149 steps, saw 132639 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
// Phase 1: matrix 899 rows 373 cols
[2024-05-31 22:46:50] [INFO ] Computed 47 invariants in 7 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) 31/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:46:50] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/105 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/129 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/249 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/257 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 116/373 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 899/1272 variables, 373/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1272 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 31/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 65/105 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/129 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/249 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/257 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 116/373 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 899/1272 variables, 373/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1272 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 979ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 899/899 transitions.
Applied a total of 0 rules in 12 ms. Remains 373 /373 variables (removed 0) and now considering 899/899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 373/373 places, 899/899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 899/899 transitions.
Applied a total of 0 rules in 12 ms. Remains 373 /373 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2024-05-31 22:46:51] [INFO ] Invariant cache hit.
[2024-05-31 22:46:51] [INFO ] Implicit Places using invariants in 519 ms returned [90, 97, 98, 170, 171, 241, 242]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 521 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 366/373 places, 899/899 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 365 transition count 898
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 365 transition count 898
Applied a total of 2 rules in 20 ms. Remains 365 /366 variables (removed 1) and now considering 898/899 (removed 1) transitions.
// Phase 1: matrix 898 rows 365 cols
[2024-05-31 22:46:51] [INFO ] Computed 40 invariants in 7 ms
[2024-05-31 22:46:52] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-31 22:46:52] [INFO ] Invariant cache hit.
[2024-05-31 22:46:53] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 365/373 places, 898/899 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2077 ms. Remains : 365/373 places, 898/899 transitions.
RANDOM walk for 40000 steps (744 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (211 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 401188 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 401188 steps, saw 135577 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2024-05-31 22:46:56] [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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/189 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 149/338 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/354 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/365 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 898/1263 variables, 365/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1263 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1263/1263 variables, and 405 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 365/365 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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/189 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 149/338 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/354 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/365 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 898/1263 variables, 365/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1263 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1263 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1263/1263 variables, and 406 constraints, problems are : Problem set: 0 solved, 1 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 935ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 2 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 898/898 transitions.
Applied a total of 0 rules in 12 ms. Remains 365 /365 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 365/365 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 898/898 transitions.
Applied a total of 0 rules in 12 ms. Remains 365 /365 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-05-31 22:46:57] [INFO ] Invariant cache hit.
[2024-05-31 22:46:57] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-31 22:46:57] [INFO ] Invariant cache hit.
[2024-05-31 22:46:58] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
[2024-05-31 22:46:58] [INFO ] Redundant transitions in 9 ms returned []
Running 873 sub problems to find dead transitions.
[2024-05-31 22:46:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 3 (OVERLAPS) 1/365 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 873 unsolved
[2024-05-31 22:47:22] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:47:25] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 3 ms to minimize.
[2024-05-31 22:47:29] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1263 variables, and 43 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/365 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 3 (OVERLAPS) 1/365 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 873 unsolved
[2024-05-31 22:47:50] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 873 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 365/1263 variables, and 44 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/365 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 4/4 constraints]
After SMT, in 60601ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60613ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62173 ms. Remains : 365/365 places, 898/898 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 365 transition count 897
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 364 transition count 897
Applied a total of 2 rules in 16 ms. Remains 364 /365 variables (removed 1) and now considering 897/898 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 897 rows 364 cols
[2024-05-31 22:47:59] [INFO ] Computed 40 invariants in 7 ms
[2024-05-31 22:47:59] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:47:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 22:47:59] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 16 ms returned sat
[2024-05-31 22:48:00] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:48:00] [INFO ] After 476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:48:00] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 732 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 320 ms.
Product exploration explored 100000 steps with 25000 reset in 339 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 406/406 places, 936/936 transitions.
Applied a total of 0 rules in 13 ms. Remains 406 /406 variables (removed 0) and now considering 936/936 (removed 0) transitions.
[2024-05-31 22:48:01] [INFO ] Redundant transitions in 9 ms returned []
Running 903 sub problems to find dead transitions.
// Phase 1: matrix 936 rows 406 cols
[2024-05-31 22:48:01] [INFO ] Computed 47 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 3 (OVERLAPS) 2/403 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-05-31 22:48:27] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-31 22:48:28] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:48:28] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:48:32] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:48:32] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/1342 variables, and 43 constraints, problems are : Problem set: 0 solved, 903 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/406 constraints, PredecessorRefiner: 903/903 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 903 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 3 (OVERLAPS) 2/403 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 7 (OVERLAPS) 3/406 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 903 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1342 variables, and 52 constraints, problems are : Problem set: 0 solved, 903 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 0/406 constraints, PredecessorRefiner: 0/903 constraints, Known Traps: 5/5 constraints]
After SMT, in 60570ms problems are : Problem set: 0 solved, 903 unsolved
Search for dead transitions found 0 dead transitions in 60582ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60614 ms. Remains : 406/406 places, 936/936 transitions.
Support contains 2 out of 406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 406/406 places, 936/936 transitions.
Applied a total of 0 rules in 8 ms. Remains 406 /406 variables (removed 0) and now considering 936/936 (removed 0) transitions.
[2024-05-31 22:49:02] [INFO ] Invariant cache hit.
[2024-05-31 22:49:02] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-31 22:49:02] [INFO ] Invariant cache hit.
[2024-05-31 22:49:03] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
Running 903 sub problems to find dead transitions.
[2024-05-31 22:49:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 3 (OVERLAPS) 2/403 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-05-31 22:49:29] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 5 ms to minimize.
[2024-05-31 22:49:30] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:49:30] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/1342 variables, and 41 constraints, problems are : Problem set: 0 solved, 903 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/406 constraints, PredecessorRefiner: 903/903 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 903 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 3 (OVERLAPS) 2/403 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-05-31 22:49:49] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-05-31 22:50:00] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 903 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/1342 variables, and 43 constraints, problems are : Problem set: 0 solved, 903 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/406 constraints, PredecessorRefiner: 0/903 constraints, Known Traps: 5/5 constraints]
After SMT, in 60593ms problems are : Problem set: 0 solved, 903 unsolved
Search for dead transitions found 0 dead transitions in 60605ms
Finished structural reductions in LTL mode , in 1 iterations and 62284 ms. Remains : 406/406 places, 936/936 transitions.
Treatment of property ASLink-PT-04b-LTLCardinality-04 finished in 347424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(!p0) U p1))))'
[2024-05-31 22:50:04] [INFO ] Flatten gal took : 106 ms
[2024-05-31 22:50:04] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-31 22:50:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1765 places, 2153 transitions and 6665 arcs took 20 ms.
Total runtime 1797772 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ASLink-PT-04b-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-04b-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-04b-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ASLink-PT-04b-LTLCardinality-11

BK_STOP 1717196710223

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ASLink-PT-04b-LTLCardinality-00
ltl formula formula --ltl=/tmp/2746/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1765 places, 2153 transitions and 6665 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.060 user 0.100 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2746/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2746/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2746/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2746/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 1766 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1766, there are 2272 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~266 levels ~10000 states ~45048 transitions
pnml2lts-mc( 1/ 4): ~266 levels ~20000 states ~91852 transitions
pnml2lts-mc( 1/ 4): ~266 levels ~40000 states ~196452 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~12276!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32791
pnml2lts-mc( 0/ 4): unique states count: 55077
pnml2lts-mc( 0/ 4): unique transitions count: 253376
pnml2lts-mc( 0/ 4): - self-loop count: 10
pnml2lts-mc( 0/ 4): - claim dead count: 116675
pnml2lts-mc( 0/ 4): - claim found count: 9907
pnml2lts-mc( 0/ 4): - claim success count: 55086
pnml2lts-mc( 0/ 4): - cum. max stack depth: 22106
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 55086 states 253399 transitions, fanout: 4.600
pnml2lts-mc( 0/ 4): Total exploration time 8.580 sec (8.580 sec minimum, 8.580 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6420, Transitions per second: 29534
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.4MB, 12.0 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2210 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.4MB (~256.0MB paged-in)
ltl formula name ASLink-PT-04b-LTLCardinality-02
ltl formula formula --ltl=/tmp/2746/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1765 places, 2153 transitions and 6665 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.070 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2746/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2746/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2746/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2746/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1767 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1766, there are 2191 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~921!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4991
pnml2lts-mc( 0/ 4): unique states count: 7160
pnml2lts-mc( 0/ 4): unique transitions count: 42943
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12981
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 7171
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2215
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7171 states 42981 transitions, fanout: 5.994
pnml2lts-mc( 0/ 4): Total exploration time 1.150 sec (1.150 sec minimum, 1.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6236, Transitions per second: 37375
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 18.0 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2210 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ASLink-PT-04b-LTLCardinality-04
ltl formula formula --ltl=/tmp/2746/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1765 places, 2153 transitions and 6665 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.090 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2746/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2746/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2746/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2746/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1767 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1766, there are 2160 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 9
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 34 transitions, fanout: 1.545
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2200, Transitions per second: 3400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 112.9 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2210 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ASLink-PT-04b-LTLCardinality-11
ltl formula formula --ltl=/tmp/2746/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1765 places, 2153 transitions and 6665 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2746/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2746/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.090 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2746/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2746/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1766 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1766, there are 2202 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~221 levels ~10000 states ~47564 transitions
pnml2lts-mc( 2/ 4): ~221 levels ~20000 states ~99544 transitions
pnml2lts-mc( 2/ 4): ~221 levels ~40000 states ~203664 transitions
pnml2lts-mc( 2/ 4): ~221 levels ~80000 states ~440484 transitions
pnml2lts-mc( 2/ 4): ~221 levels ~160000 states ~944552 transitions
pnml2lts-mc( 2/ 4): ~221 levels ~320000 states ~2009020 transitions
pnml2lts-mc( 1/ 4): ~541 levels ~640000 states ~3945196 transitions
pnml2lts-mc( 1/ 4): ~541 levels ~1280000 states ~8317104 transitions
pnml2lts-mc( 1/ 4): ~541 levels ~2560000 states ~17841800 transitions
pnml2lts-mc( 1/ 4): ~541 levels ~5120000 states ~37962892 transitions

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-04b"
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-04b, 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-171620117700067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;