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.r003-smll-171620117100140.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ASLink-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117100140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K 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:23 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 839K 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-09a-LTLFireability-00
FORMULA_NAME ASLink-PT-09a-LTLFireability-01
FORMULA_NAME ASLink-PT-09a-LTLFireability-02
FORMULA_NAME ASLink-PT-09a-LTLFireability-03
FORMULA_NAME ASLink-PT-09a-LTLFireability-04
FORMULA_NAME ASLink-PT-09a-LTLFireability-05
FORMULA_NAME ASLink-PT-09a-LTLFireability-06
FORMULA_NAME ASLink-PT-09a-LTLFireability-07
FORMULA_NAME ASLink-PT-09a-LTLFireability-08
FORMULA_NAME ASLink-PT-09a-LTLFireability-09
FORMULA_NAME ASLink-PT-09a-LTLFireability-10
FORMULA_NAME ASLink-PT-09a-LTLFireability-11
FORMULA_NAME ASLink-PT-09a-LTLFireability-12
FORMULA_NAME ASLink-PT-09a-LTLFireability-13
FORMULA_NAME ASLink-PT-09a-LTLFireability-14
FORMULA_NAME ASLink-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716372908095

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 10:15:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 10:15:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:15:11] [INFO ] Load time of PNML (sax parser for PT used): 586 ms
[2024-05-22 10:15:11] [INFO ] Transformed 1991 places.
[2024-05-22 10:15:11] [INFO ] Transformed 2919 transitions.
[2024-05-22 10:15:11] [INFO ] Found NUPN structural information;
[2024-05-22 10:15:11] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 894 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
FORMULA ASLink-PT-09a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 1991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 36 places
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 1937 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 1924 transition count 2827
Ensure Unique test removed 1 places
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 1923 transition count 2827
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 1923 transition count 2825
Applied a total of 83 rules in 796 ms. Remains 1923 /1991 variables (removed 68) and now considering 2825/2888 (removed 63) transitions.
// Phase 1: matrix 2825 rows 1923 cols
[2024-05-22 10:15:13] [INFO ] Computed 329 invariants in 262 ms
[2024-05-22 10:15:16] [INFO ] Implicit Places using invariants in 3691 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 409, 427, 445, 574, 590, 595, 596, 597, 633, 762, 778, 783, 784, 804, 822, 951, 967, 972, 973, 974, 992, 1010, 1139, 1155, 1160, 1161, 1162, 1180, 1198, 1327, 1343, 1348, 1349, 1350, 1368, 1386, 1515, 1531, 1536, 1537, 1538, 1556, 1574, 1703, 1708, 1720, 1725, 1726, 1727, 1761, 1763, 1766, 1784, 1785, 1786, 1787, 1804, 1812, 1820, 1826, 1832, 1838, 1844, 1852, 1858, 1864, 1872]
Discarding 84 places :
Implicit Place search using SMT only with invariants took 3755 ms to find 84 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1839/1991 places, 2825/2888 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1826 transition count 2812
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1826 transition count 2812
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1816 transition count 2802
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1816 transition count 2802
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1811 transition count 2797
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1811 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1809 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1809 transition count 2795
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1807 transition count 2793
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1807 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1806 transition count 2792
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1806 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1805 transition count 2791
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1805 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1804 transition count 2790
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1804 transition count 2790
Applied a total of 70 rules in 1121 ms. Remains 1804 /1839 variables (removed 35) and now considering 2790/2825 (removed 35) transitions.
// Phase 1: matrix 2790 rows 1804 cols
[2024-05-22 10:15:17] [INFO ] Computed 245 invariants in 74 ms
[2024-05-22 10:15:19] [INFO ] Implicit Places using invariants in 1676 ms returned []
[2024-05-22 10:15:19] [INFO ] Invariant cache hit.
[2024-05-22 10:15:25] [INFO ] Implicit Places using invariants and state equation in 6546 ms returned []
Implicit Place search using SMT with State Equation took 8231 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1804/1991 places, 2790/2888 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13942 ms. Remains : 1804/1991 places, 2790/2888 transitions.
Support contains 48 out of 1804 places after structural reductions.
[2024-05-22 10:15:26] [INFO ] Flatten gal took : 467 ms
[2024-05-22 10:15:27] [INFO ] Flatten gal took : 274 ms
[2024-05-22 10:15:27] [INFO ] Input system was already deterministic with 2790 transitions.
RANDOM walk for 40000 steps (179 resets) in 2353 ms. (16 steps per ms) remains 14/22 properties
BEST_FIRST walk for 40004 steps (15 resets) in 484 ms. (82 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (16 resets) in 331 ms. (120 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (13 resets) in 304 ms. (131 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (14 resets) in 243 ms. (163 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (15 resets) in 246 ms. (161 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (13 resets) in 240 ms. (165 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (15 resets) in 209 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (14 resets) in 431 ms. (92 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (15 resets) in 215 ms. (185 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (14 resets) in 199 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (14 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (15 resets) in 220 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (16 resets) in 168 ms. (236 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (14 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
[2024-05-22 10:15:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 294/326 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 434/760 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1011/1771 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1771 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 33/1804 variables, 10/245 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1804 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4594/4594 variables, and 2049 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 188/188 constraints, State Equation: 1804/1804 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 294/326 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 434/760 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 10:15:35] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/760 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1011/1771 variables, 178/236 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 10:15:37] [INFO ] Deduced a trap composed of 67 places in 317 ms of which 8 ms to minimize.
[2024-05-22 10:15:38] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1771 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1771 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 33/1804 variables, 10/248 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1804/4594 variables, and 248 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 188/188 constraints, State Equation: 0/1804 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 3/3 constraints]
After SMT, in 10171ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 1804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1804/1804 places, 2790/2790 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1804 transition count 2464
Reduce places removed 326 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 334 rules applied. Total rules applied 660 place count 1478 transition count 2456
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 668 place count 1470 transition count 2456
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 668 place count 1470 transition count 2219
Deduced a syphon composed of 237 places in 5 ms
Ensure Unique test removed 77 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 551 rules applied. Total rules applied 1219 place count 1156 transition count 2219
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 24 rules applied. Total rules applied 1243 place count 1145 transition count 2206
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1256 place count 1132 transition count 2206
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 1256 place count 1132 transition count 2174
Deduced a syphon composed of 32 places in 7 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1320 place count 1100 transition count 2174
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1326 place count 1094 transition count 2161
Iterating global reduction 5 with 6 rules applied. Total rules applied 1332 place count 1094 transition count 2161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 1336 place count 1094 transition count 2157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1337 place count 1093 transition count 2157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1337 place count 1093 transition count 2156
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1339 place count 1092 transition count 2156
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 9 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 7 with 194 rules applied. Total rules applied 1533 place count 995 transition count 2059
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1539 place count 995 transition count 2053
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1545 place count 989 transition count 2053
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1579 place count 989 transition count 2019
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 8 with 35 rules applied. Total rules applied 1614 place count 954 transition count 2019
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1619 place count 954 transition count 2014
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 1644 place count 954 transition count 2014
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1645 place count 953 transition count 2013
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 11 rules applied. Total rules applied 1656 place count 943 transition count 2012
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1657 place count 942 transition count 2012
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 22 Pre rules applied. Total rules applied 1657 place count 942 transition count 1990
Deduced a syphon composed of 22 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 53 rules applied. Total rules applied 1710 place count 911 transition count 1990
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1719 place count 902 transition count 1981
Iterating global reduction 11 with 9 rules applied. Total rules applied 1728 place count 902 transition count 1981
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1737 place count 902 transition count 1972
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 1743 place count 899 transition count 1969
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1744 place count 899 transition count 1968
Applied a total of 1744 rules in 1380 ms. Remains 899 /1804 variables (removed 905) and now considering 1968/2790 (removed 822) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1381 ms. Remains : 899/1804 places, 1968/2790 transitions.
RANDOM walk for 40000 steps (566 resets) in 1300 ms. (30 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (78 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (75 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (79 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (73 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (78 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 91 ms. (434 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (70 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (80 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (71 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (74 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (74 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 147583 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :2 out of 13
Probabilistic random walk after 147583 steps, saw 62911 distinct states, run finished after 3019 ms. (steps per millisecond=48 ) properties seen :2
// Phase 1: matrix 1968 rows 899 cols
[2024-05-22 10:15:45] [INFO ] Computed 137 invariants in 44 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 42/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 291/358 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 70/428 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 264/692 variables, 52/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/692 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 23/715 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/715 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1/716 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/716 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 152/868 variables, 25/129 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/868 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 1/869 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/869 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 30/899 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/899 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 1968/2867 variables, 899/1036 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2867 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/2867 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2867/2867 variables, and 1036 constraints, problems are : Problem set: 0 solved, 11 unsolved in 6557 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 113/113 constraints, State Equation: 899/899 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 42/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 291/358 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 10:15:52] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 70/428 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 264/692 variables, 52/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/692 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 23/715 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/715 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 1/716 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/716 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 152/868 variables, 25/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/868 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 1/869 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/869 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 30/899 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/899 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 22 (OVERLAPS) 1968/2867 variables, 899/1037 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2867 variables, 2/1039 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2867 variables, 0/1039 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2867 variables, 0/1039 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2867/2867 variables, and 1039 constraints, problems are : Problem set: 9 solved, 2 unsolved in 16298 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 113/113 constraints, State Equation: 899/899 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 22981ms problems are : Problem set: 9 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 696 ms.
Support contains 4 out of 899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 899/899 places, 1968/1968 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 899 transition count 1967
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 898 transition count 1967
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 897 transition count 1967
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 895 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 895 transition count 1953
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 894 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 893 transition count 1945
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 893 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 892 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 892 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 891 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 891 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 890 transition count 1921
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 890 transition count 1921
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 889 transition count 1913
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 889 transition count 1913
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 888 transition count 1905
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 888 transition count 1905
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 887 transition count 1897
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 887 transition count 1897
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 886 transition count 1889
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 886 transition count 1889
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 885 transition count 1881
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 885 transition count 1881
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 884 transition count 1873
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 884 transition count 1873
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 883 transition count 1865
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 883 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 882 transition count 1857
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 882 transition count 1857
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 881 transition count 1849
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 881 transition count 1849
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 880 transition count 1841
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 880 transition count 1841
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 878 transition count 1839
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 877 transition count 1838
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 877 transition count 1838
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 877 transition count 1835
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 874 transition count 1832
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 874 transition count 1832
Applied a total of 52 rules in 781 ms. Remains 874 /899 variables (removed 25) and now considering 1832/1968 (removed 136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 782 ms. Remains : 874/899 places, 1832/1968 transitions.
RANDOM walk for 40000 steps (576 resets) in 262 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (78 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199446 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199446 steps, saw 81242 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 1832 rows 874 cols
[2024-05-22 10:16:12] [INFO ] Computed 135 invariants in 25 ms
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) 1/47 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/191 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/230 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 203/433 variables, 37/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/439 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 110/550 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/551 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 86/637 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/637 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 17/654 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/654 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 71/725 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/725 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 13/738 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/738 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 91/829 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/829 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 18/847 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/847 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 27/874 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/874 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1832/2706 variables, 874/1009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2706 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/2706 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2706/2706 variables, and 1009 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 110/110 constraints, State Equation: 874/874 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) 1/47 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/191 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 39/230 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 203/433 variables, 37/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/439 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 110/550 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/551 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 86/637 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/637 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 17/654 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/654 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 71/725 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/725 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 13/738 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/738 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 91/829 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/829 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 18/847 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 10:16:14] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/847 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/847 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 27/874 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/874 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1832/2706 variables, 874/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2706 variables, 1/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2706 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/2706 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2706/2706 variables, and 1011 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6851 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 110/110 constraints, State Equation: 874/874 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 8252ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 686 ms.
Support contains 4 out of 874 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 874/874 places, 1832/1832 transitions.
Applied a total of 0 rules in 77 ms. Remains 874 /874 variables (removed 0) and now considering 1832/1832 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 874/874 places, 1832/1832 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 874/874 places, 1832/1832 transitions.
Applied a total of 0 rules in 69 ms. Remains 874 /874 variables (removed 0) and now considering 1832/1832 (removed 0) transitions.
[2024-05-22 10:16:21] [INFO ] Invariant cache hit.
[2024-05-22 10:16:23] [INFO ] Implicit Places using invariants in 1480 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 176, 182, 185, 187, 188, 193, 194, 246, 263, 269, 272, 274, 275, 280, 281, 299, 334, 355, 363, 369, 370, 375, 376, 377, 430, 451, 457, 460, 462, 463, 468, 469, 521, 538, 544, 547, 549, 550, 555, 556, 608, 625, 631, 634, 636, 637, 642, 643, 695, 712, 718, 721, 723, 724, 729, 730, 782, 799, 805, 808, 810, 811]
[2024-05-22 10:16:23] [INFO ] Actually due to overlaps returned [188, 275, 370, 463, 550, 637, 724, 811, 299, 377, 88, 94, 99, 176, 182, 187, 263, 269, 274, 451, 457, 462, 538, 544, 549, 625, 631, 636, 712, 718, 723, 799, 805, 810, 71, 100, 158, 246, 334, 355, 363, 369, 521, 608, 695, 782]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 1485 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 828/874 places, 1832/1832 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 828 transition count 1823
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 819 transition count 1823
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 53 place count 784 transition count 1788
Iterating global reduction 2 with 35 rules applied. Total rules applied 88 place count 784 transition count 1788
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 98 place count 774 transition count 1778
Iterating global reduction 2 with 10 rules applied. Total rules applied 108 place count 774 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 773 transition count 1777
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 773 transition count 1777
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 150 place count 753 transition count 1757
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 177 place count 753 transition count 1730
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 204 place count 726 transition count 1730
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 211 place count 726 transition count 1723
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 218 place count 719 transition count 1723
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 719 transition count 1723
Applied a total of 219 rules in 401 ms. Remains 719 /828 variables (removed 109) and now considering 1723/1832 (removed 109) transitions.
// Phase 1: matrix 1723 rows 719 cols
[2024-05-22 10:16:23] [INFO ] Computed 89 invariants in 39 ms
[2024-05-22 10:16:24] [INFO ] Implicit Places using invariants in 1176 ms returned [88, 89, 161, 162, 232, 233, 303, 304, 356, 377, 378, 448, 449, 519, 520, 590, 591]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1180 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 702/874 places, 1723/1832 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 701 transition count 1722
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 701 transition count 1721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 700 transition count 1721
Applied a total of 4 rules in 90 ms. Remains 700 /702 variables (removed 2) and now considering 1721/1723 (removed 2) transitions.
// Phase 1: matrix 1721 rows 700 cols
[2024-05-22 10:16:24] [INFO ] Computed 72 invariants in 31 ms
[2024-05-22 10:16:25] [INFO ] Implicit Places using invariants in 785 ms returned []
[2024-05-22 10:16:25] [INFO ] Invariant cache hit.
[2024-05-22 10:16:28] [INFO ] Implicit Places using invariants and state equation in 3236 ms returned []
Implicit Place search using SMT with State Equation took 4025 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 700/874 places, 1721/1832 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7252 ms. Remains : 700/874 places, 1721/1832 transitions.
RANDOM walk for 40000 steps (645 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (104 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 195021 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 195021 steps, saw 121412 distinct states, run finished after 3004 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-22 10:16:32] [INFO ] Invariant cache hit.
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) 160/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/172 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 206/378 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/380 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 134/514 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/518 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 99/617 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/617 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/665 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/665 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/700 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/700 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1721/2421 variables, 700/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2421 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2421 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2421/2421 variables, and 772 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 700/700 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) 160/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/172 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 206/378 variables, 22/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/380 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 134/514 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/518 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 99/617 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/617 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/665 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/665 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/700 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/700 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1721/2421 variables, 700/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2421 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2421 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2421 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2421/2421 variables, and 773 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10563 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 700/700 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 12599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 543 ms.
Support contains 4 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1721/1721 transitions.
Applied a total of 0 rules in 46 ms. Remains 700 /700 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 700/700 places, 1721/1721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1721/1721 transitions.
Applied a total of 0 rules in 46 ms. Remains 700 /700 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
[2024-05-22 10:16:45] [INFO ] Invariant cache hit.
[2024-05-22 10:16:46] [INFO ] Implicit Places using invariants in 1441 ms returned []
[2024-05-22 10:16:46] [INFO ] Invariant cache hit.
[2024-05-22 10:16:49] [INFO ] Implicit Places using invariants and state equation in 2684 ms returned []
Implicit Place search using SMT with State Equation took 4128 ms to find 0 implicit places.
[2024-05-22 10:16:49] [INFO ] Redundant transitions in 225 ms returned []
Running 1679 sub problems to find dead transitions.
[2024-05-22 10:16:49] [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/699 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1679 unsolved
SMT process timed out in 31877ms, After SMT, problems are : Problem set: 0 solved, 1679 unsolved
Search for dead transitions found 0 dead transitions in 31925ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36347 ms. Remains : 700/700 places, 1721/1721 transitions.
FORMULA ASLink-PT-09a-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA ASLink-PT-09a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 1804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1804/1804 places, 2790/2790 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 1804 transition count 2453
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 1 with 337 rules applied. Total rules applied 674 place count 1467 transition count 2453
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 674 place count 1467 transition count 2216
Deduced a syphon composed of 237 places in 5 ms
Ensure Unique test removed 77 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 551 rules applied. Total rules applied 1225 place count 1153 transition count 2216
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 25 rules applied. Total rules applied 1250 place count 1141 transition count 2203
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1263 place count 1128 transition count 2203
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 1263 place count 1128 transition count 2171
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 1327 place count 1096 transition count 2171
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1334 place count 1089 transition count 2152
Iterating global reduction 4 with 7 rules applied. Total rules applied 1341 place count 1089 transition count 2152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 1346 place count 1088 transition count 2148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1347 place count 1087 transition count 2148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1347 place count 1087 transition count 2147
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1349 place count 1086 transition count 2147
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1350 place count 1085 transition count 2139
Iterating global reduction 6 with 1 rules applied. Total rules applied 1351 place count 1085 transition count 2139
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1352 place count 1084 transition count 2131
Iterating global reduction 6 with 1 rules applied. Total rules applied 1353 place count 1084 transition count 2131
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1354 place count 1083 transition count 2123
Iterating global reduction 6 with 1 rules applied. Total rules applied 1355 place count 1083 transition count 2123
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1356 place count 1082 transition count 2115
Iterating global reduction 6 with 1 rules applied. Total rules applied 1357 place count 1082 transition count 2115
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1358 place count 1081 transition count 2107
Iterating global reduction 6 with 1 rules applied. Total rules applied 1359 place count 1081 transition count 2107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1360 place count 1080 transition count 2099
Iterating global reduction 6 with 1 rules applied. Total rules applied 1361 place count 1080 transition count 2099
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1362 place count 1079 transition count 2091
Iterating global reduction 6 with 1 rules applied. Total rules applied 1363 place count 1079 transition count 2091
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1364 place count 1078 transition count 2083
Iterating global reduction 6 with 1 rules applied. Total rules applied 1365 place count 1078 transition count 2083
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1366 place count 1077 transition count 2075
Iterating global reduction 6 with 1 rules applied. Total rules applied 1367 place count 1077 transition count 2075
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1368 place count 1076 transition count 2067
Iterating global reduction 6 with 1 rules applied. Total rules applied 1369 place count 1076 transition count 2067
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1370 place count 1075 transition count 2059
Iterating global reduction 6 with 1 rules applied. Total rules applied 1371 place count 1075 transition count 2059
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1372 place count 1074 transition count 2051
Iterating global reduction 6 with 1 rules applied. Total rules applied 1373 place count 1074 transition count 2051
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1374 place count 1073 transition count 2043
Iterating global reduction 6 with 1 rules applied. Total rules applied 1375 place count 1073 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1376 place count 1072 transition count 2035
Iterating global reduction 6 with 1 rules applied. Total rules applied 1377 place count 1072 transition count 2035
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1378 place count 1071 transition count 2027
Iterating global reduction 6 with 1 rules applied. Total rules applied 1379 place count 1071 transition count 2027
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 3 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 6 with 196 rules applied. Total rules applied 1575 place count 973 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1576 place count 972 transition count 1928
Iterating global reduction 6 with 1 rules applied. Total rules applied 1577 place count 972 transition count 1928
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1578 place count 972 transition count 1928
Applied a total of 1578 rules in 1183 ms. Remains 972 /1804 variables (removed 832) and now considering 1928/2790 (removed 862) transitions.
// Phase 1: matrix 1928 rows 972 cols
[2024-05-22 10:17:23] [INFO ] Computed 155 invariants in 37 ms
[2024-05-22 10:17:24] [INFO ] Implicit Places using invariants in 1772 ms returned [90, 96, 101, 117, 219, 220, 290, 296, 301, 317, 393, 401, 407, 423, 424, 499, 505, 510, 526, 596, 602, 607, 623, 693, 699, 704, 720, 790, 796, 801, 817, 887, 893, 898, 917, 969]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 1777 ms to find 36 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 936/1804 places, 1928/2790 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 936 transition count 1922
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 930 transition count 1922
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 12 place count 930 transition count 1900
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 56 place count 908 transition count 1900
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 72 place count 892 transition count 1884
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 892 transition count 1884
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 104 place count 876 transition count 1868
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 876 transition count 1868
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 129 place count 867 transition count 1859
Iterating global reduction 2 with 9 rules applied. Total rules applied 138 place count 867 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 866 transition count 1858
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 866 transition count 1858
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 865 transition count 1857
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 865 transition count 1857
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 178 place count 847 transition count 1839
Applied a total of 178 rules in 268 ms. Remains 847 /936 variables (removed 89) and now considering 1839/1928 (removed 89) transitions.
// Phase 1: matrix 1839 rows 847 cols
[2024-05-22 10:17:25] [INFO ] Computed 119 invariants in 31 ms
[2024-05-22 10:17:26] [INFO ] Implicit Places using invariants in 1725 ms returned [93, 96, 173, 179, 184, 186, 189, 270, 273, 360, 363, 444, 447, 528, 531, 612, 615, 696, 699, 780, 783]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 1728 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 826/1804 places, 1839/2790 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 826 transition count 1830
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 817 transition count 1830
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 29 place count 806 transition count 1819
Iterating global reduction 2 with 11 rules applied. Total rules applied 40 place count 806 transition count 1819
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 49 place count 806 transition count 1810
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 804 transition count 1808
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 804 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 803 transition count 1807
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 803 transition count 1807
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 801 transition count 1805
Applied a total of 59 rules in 251 ms. Remains 801 /826 variables (removed 25) and now considering 1805/1839 (removed 34) transitions.
// Phase 1: matrix 1805 rows 801 cols
[2024-05-22 10:17:27] [INFO ] Computed 98 invariants in 32 ms
[2024-05-22 10:17:28] [INFO ] Implicit Places using invariants in 1659 ms returned [72, 151, 231, 312, 397, 477, 557, 637, 717]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1661 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 792/1804 places, 1805/2790 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 783 transition count 1796
Applied a total of 18 rules in 124 ms. Remains 783 /792 variables (removed 9) and now considering 1796/1805 (removed 9) transitions.
// Phase 1: matrix 1796 rows 783 cols
[2024-05-22 10:17:28] [INFO ] Computed 89 invariants in 33 ms
[2024-05-22 10:17:30] [INFO ] Implicit Places using invariants in 1499 ms returned []
[2024-05-22 10:17:30] [INFO ] Invariant cache hit.
[2024-05-22 10:17:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 10:17:35] [INFO ] Implicit Places using invariants and state equation in 4862 ms returned []
Implicit Place search using SMT with State Equation took 6368 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 783/1804 places, 1796/2790 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 13361 ms. Remains : 783/1804 places, 1796/2790 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09a-LTLFireability-02
Product exploration explored 100000 steps with 1318 reset in 740 ms.
Product exploration explored 100000 steps with 1310 reset in 596 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2893 steps (37 resets) in 26 ms. (107 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 783 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 783/783 places, 1796/1796 transitions.
Applied a total of 0 rules in 53 ms. Remains 783 /783 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2024-05-22 10:17:37] [INFO ] Invariant cache hit.
[2024-05-22 10:17:38] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2024-05-22 10:17:38] [INFO ] Invariant cache hit.
[2024-05-22 10:17:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 10:17:43] [INFO ] Implicit Places using invariants and state equation in 4857 ms returned []
Implicit Place search using SMT with State Equation took 5878 ms to find 0 implicit places.
[2024-05-22 10:17:43] [INFO ] Redundant transitions in 265 ms returned []
Running 1795 sub problems to find dead transitions.
[2024-05-22 10:17:44] [INFO ] Invariant cache hit.
[2024-05-22 10:17:44] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/2579 variables, and 48 constraints, problems are : Problem set: 0 solved, 1795 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 48/73 constraints, State Equation: 0/783 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 1795/1795 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1795 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1795 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 1)
(s11 15)
(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 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 1)
(s53 1)
(s54 0)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(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 3)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(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 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 1)
(s127 1)
(s128 0)
(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 3)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 8)
(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 3)
(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 0)
(s195 1)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(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 3)
(s228 1)
(s229 1)
(s230 1)
(s231 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/2579 variables, and 48 constraints, problems are : Problem set: 0 solved, 1795 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 48/73 constraints, State Equation: 0/783 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1795 constraints, Known Traps: 0/0 constraints]
After SMT, in 61796ms problems are : Problem set: 0 solved, 1795 unsolved
Search for dead transitions found 0 dead transitions in 61838ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68056 ms. Remains : 783/783 places, 1796/1796 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4627 steps (47 resets) in 42 ms. (107 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1302 reset in 508 ms.
Product exploration explored 100000 steps with 1292 reset in 359 ms.
Support contains 4 out of 783 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 783/783 places, 1796/1796 transitions.
Applied a total of 0 rules in 35 ms. Remains 783 /783 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2024-05-22 10:18:47] [INFO ] Invariant cache hit.
[2024-05-22 10:18:48] [INFO ] Implicit Places using invariants in 1258 ms returned []
[2024-05-22 10:18:48] [INFO ] Invariant cache hit.
[2024-05-22 10:18:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 10:18:53] [INFO ] Implicit Places using invariants and state equation in 4866 ms returned []
Implicit Place search using SMT with State Equation took 6128 ms to find 0 implicit places.
[2024-05-22 10:18:53] [INFO ] Redundant transitions in 102 ms returned []
Running 1795 sub problems to find dead transitions.
[2024-05-22 10:18:53] [INFO ] Invariant cache hit.
[2024-05-22 10:18:53] [INFO ] State equation strengthened by 9 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 15.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 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 1.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 3.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 0.0)
(s86 1.0)
(s87 0.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 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 1.0)
(s127 1.0)
(s128 0.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 3.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 8.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 3.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 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 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 3.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 8.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 3.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.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 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 3.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 8.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 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 3.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 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 0.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 3.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 8.0)
(s401 1.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 1.0)
(s413 1.0)
(s414 3.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 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/2579 variables, and 48 constraints, problems are : Problem set: 0 solved, 1795 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 48/73 constraints, State Equation: 0/783 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 1795/1795 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1795 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 1795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/2579 variables, and 48 constraints, problems are : Problem set: 0 solved, 1795 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 48/73 constraints, State Equation: 0/783 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1795 constraints, Known Traps: 0/0 constraints]
After SMT, in 61843ms problems are : Problem set: 0 solved, 1795 unsolved
Search for dead transitions found 0 dead transitions in 61884ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68164 ms. Remains : 783/783 places, 1796/1796 transitions.
Treatment of property ASLink-PT-09a-LTLFireability-02 finished in 154332 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((X(X(p1))||p0)))'
Support contains 4 out of 1804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 2790/2790 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1803 transition count 2784
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1803 transition count 2784
Applied a total of 2 rules in 264 ms. Remains 1803 /1804 variables (removed 1) and now considering 2784/2790 (removed 6) transitions.
// Phase 1: matrix 2784 rows 1803 cols
[2024-05-22 10:19:56] [INFO ] Computed 245 invariants in 52 ms
[2024-05-22 10:19:58] [INFO ] Implicit Places using invariants in 2503 ms returned [590, 755]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2510 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1801/1804 places, 2784/2790 transitions.
Applied a total of 0 rules in 151 ms. Remains 1801 /1801 variables (removed 0) and now considering 2784/2784 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2926 ms. Remains : 1801/1804 places, 2784/2790 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-09a-LTLFireability-03
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-09a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09a-LTLFireability-03 finished in 3140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 1804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 2790/2790 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1802 transition count 2776
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1802 transition count 2776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1801 transition count 2768
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1801 transition count 2768
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1800 transition count 2760
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1800 transition count 2760
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1799 transition count 2752
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1799 transition count 2752
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1798 transition count 2744
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1798 transition count 2744
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1797 transition count 2736
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1797 transition count 2736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1796 transition count 2728
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1796 transition count 2728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1795 transition count 2720
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1795 transition count 2720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1794 transition count 2712
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1794 transition count 2712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1793 transition count 2704
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1793 transition count 2704
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1792 transition count 2696
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1792 transition count 2696
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1791 transition count 2688
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1791 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1790 transition count 2680
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1790 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1789 transition count 2672
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1789 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1788 transition count 2664
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1788 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1787 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1787 transition count 2656
Applied a total of 34 rules in 1705 ms. Remains 1787 /1804 variables (removed 17) and now considering 2656/2790 (removed 134) transitions.
// Phase 1: matrix 2656 rows 1787 cols
[2024-05-22 10:20:01] [INFO ] Computed 245 invariants in 33 ms
[2024-05-22 10:20:03] [INFO ] Implicit Places using invariants in 2260 ms returned [391, 590, 755]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2266 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1804 places, 2656/2790 transitions.
Applied a total of 0 rules in 84 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4056 ms. Remains : 1784/1804 places, 2656/2790 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ASLink-PT-09a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-09a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09a-LTLFireability-04 finished in 4212 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 U (p1||G(!p0))))))'
Support contains 3 out of 1804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1804/1804 places, 2790/2790 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1803 transition count 2453
Reduce places removed 345 places and 0 transitions.
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 1 with 353 rules applied. Total rules applied 689 place count 1458 transition count 2445
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 698 place count 1450 transition count 2444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 699 place count 1449 transition count 2444
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 255 Pre rules applied. Total rules applied 699 place count 1449 transition count 2189
Deduced a syphon composed of 255 places in 4 ms
Ensure Unique test removed 76 places
Reduce places removed 331 places and 0 transitions.
Iterating global reduction 4 with 586 rules applied. Total rules applied 1285 place count 1118 transition count 2189
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 4 with 53 rules applied. Total rules applied 1338 place count 1096 transition count 2158
Reduce places removed 32 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 34 rules applied. Total rules applied 1372 place count 1064 transition count 2156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1374 place count 1062 transition count 2156
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 1374 place count 1062 transition count 2120
Deduced a syphon composed of 36 places in 5 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 1446 place count 1026 transition count 2120
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1461 place count 1011 transition count 2098
Iterating global reduction 7 with 15 rules applied. Total rules applied 1476 place count 1011 transition count 2098
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 13 rules applied. Total rules applied 1489 place count 1011 transition count 2085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1490 place count 1010 transition count 2085
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1490 place count 1010 transition count 2084
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1492 place count 1009 transition count 2084
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1493 place count 1008 transition count 2076
Iterating global reduction 9 with 1 rules applied. Total rules applied 1494 place count 1008 transition count 2076
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1495 place count 1007 transition count 2068
Iterating global reduction 9 with 1 rules applied. Total rules applied 1496 place count 1007 transition count 2068
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1497 place count 1006 transition count 2060
Iterating global reduction 9 with 1 rules applied. Total rules applied 1498 place count 1006 transition count 2060
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1499 place count 1005 transition count 2052
Iterating global reduction 9 with 1 rules applied. Total rules applied 1500 place count 1005 transition count 2052
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1501 place count 1004 transition count 2044
Iterating global reduction 9 with 1 rules applied. Total rules applied 1502 place count 1004 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1503 place count 1003 transition count 2036
Iterating global reduction 9 with 1 rules applied. Total rules applied 1504 place count 1003 transition count 2036
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1505 place count 1002 transition count 2028
Iterating global reduction 9 with 1 rules applied. Total rules applied 1506 place count 1002 transition count 2028
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1507 place count 1001 transition count 2020
Iterating global reduction 9 with 1 rules applied. Total rules applied 1508 place count 1001 transition count 2020
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1509 place count 1000 transition count 2012
Iterating global reduction 9 with 1 rules applied. Total rules applied 1510 place count 1000 transition count 2012
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1511 place count 999 transition count 2004
Iterating global reduction 9 with 1 rules applied. Total rules applied 1512 place count 999 transition count 2004
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1513 place count 998 transition count 1996
Iterating global reduction 9 with 1 rules applied. Total rules applied 1514 place count 998 transition count 1996
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1515 place count 997 transition count 1988
Iterating global reduction 9 with 1 rules applied. Total rules applied 1516 place count 997 transition count 1988
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1517 place count 996 transition count 1980
Iterating global reduction 9 with 1 rules applied. Total rules applied 1518 place count 996 transition count 1980
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1519 place count 995 transition count 1972
Iterating global reduction 9 with 1 rules applied. Total rules applied 1520 place count 995 transition count 1972
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1521 place count 994 transition count 1964
Iterating global reduction 9 with 1 rules applied. Total rules applied 1522 place count 994 transition count 1964
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 9 with 176 rules applied. Total rules applied 1698 place count 906 transition count 1876
Applied a total of 1698 rules in 995 ms. Remains 906 /1804 variables (removed 898) and now considering 1876/2790 (removed 914) transitions.
// Phase 1: matrix 1876 rows 906 cols
[2024-05-22 10:20:04] [INFO ] Computed 137 invariants in 36 ms
[2024-05-22 10:20:06] [INFO ] Implicit Places using invariants in 1527 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 305, 340, 361, 369, 375, 377, 440, 461, 467, 472, 473, 477, 537, 555, 563, 568, 570, 630, 647, 653, 658, 660, 720, 737, 743, 748, 750, 810, 827, 833, 838, 840, 903]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1529 ms to find 47 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 859/1804 places, 1876/2790 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 859 transition count 1871
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 854 transition count 1871
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 28 place count 836 transition count 1853
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 836 transition count 1853
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 63 place count 819 transition count 1836
Iterating global reduction 2 with 17 rules applied. Total rules applied 80 place count 819 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 88 place count 811 transition count 1828
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 811 transition count 1828
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 138 place count 790 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 789 transition count 1805
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 789 transition count 1805
Applied a total of 140 rules in 301 ms. Remains 789 /859 variables (removed 70) and now considering 1805/1876 (removed 71) transitions.
// Phase 1: matrix 1805 rows 789 cols
[2024-05-22 10:20:06] [INFO ] Computed 90 invariants in 25 ms
[2024-05-22 10:20:07] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2024-05-22 10:20:07] [INFO ] Invariant cache hit.
[2024-05-22 10:20:11] [INFO ] Implicit Places using invariants and state equation in 3676 ms returned []
Implicit Place search using SMT with State Equation took 5083 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 789/1804 places, 1805/2790 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7909 ms. Remains : 789/1804 places, 1805/2790 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ASLink-PT-09a-LTLFireability-07
Product exploration explored 100000 steps with 1231 reset in 630 ms.
Product exploration explored 100000 steps with 1241 reset in 649 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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (474 resets) in 384 ms. (103 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (64 resets) in 373 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (69 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
[2024-05-22 10:20:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 152/194 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/211 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 351/562 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/603 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 10:20:14] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/603 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 180/783 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/783 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/787 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/787 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/789 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/789 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1805/2594 variables, 789/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2594 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2594 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2594/2594 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2156 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 152/194 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/211 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 351/562 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/603 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/603 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 180/783 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/783 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/787 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/787 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/789 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/789 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1805/2594 variables, 789/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2594 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2594 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2594 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2594/2594 variables, and 882 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1925 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 4100ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 628 ms.
Support contains 3 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1805/1805 transitions.
Free-agglomeration rule applied 35 times.
Iterating global reduction 0 with 35 rules applied. Total rules applied 35 place count 789 transition count 1770
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 78 place count 754 transition count 1762
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 103 place count 754 transition count 1737
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 128 place count 729 transition count 1737
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 729 transition count 1737
Applied a total of 130 rules in 143 ms. Remains 729 /789 variables (removed 60) and now considering 1737/1805 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 729/789 places, 1737/1805 transitions.
RANDOM walk for 40000 steps (679 resets) in 339 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (98 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 114459 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 2
Probabilistic random walk after 114459 steps, saw 63594 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 1737 rows 729 cols
[2024-05-22 10:20:21] [INFO ] Computed 90 invariants in 30 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 134/172 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/182 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 312/494 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 52/546 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/706 variables, 26/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/710 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/710 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 19/729 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/729 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1737/2466 variables, 729/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2466 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2466 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2466/2466 variables, and 819 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2007 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 729/729 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 134/172 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/182 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 312/494 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 52/546 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/706 variables, 26/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/710 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/710 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 19/729 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/729 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1737/2466 variables, 729/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2466 variables, 2/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2466 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2466 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2466/2466 variables, and 821 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 729/729 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4022ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 9780 steps, including 979 resets, run visited all 2 properties in 154 ms. (steps per millisecond=63 )
Parikh walk visited 2 properties in 178 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 396 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 789/789 places, 1805/1805 transitions.
Applied a total of 0 rules in 49 ms. Remains 789 /789 variables (removed 0) and now considering 1805/1805 (removed 0) transitions.
// Phase 1: matrix 1805 rows 789 cols
[2024-05-22 10:20:26] [INFO ] Computed 90 invariants in 32 ms
[2024-05-22 10:20:27] [INFO ] Implicit Places using invariants in 1433 ms returned []
[2024-05-22 10:20:27] [INFO ] Invariant cache hit.
[2024-05-22 10:20:31] [INFO ] Implicit Places using invariants and state equation in 3909 ms returned []
Implicit Place search using SMT with State Equation took 5345 ms to find 0 implicit places.
[2024-05-22 10:20:31] [INFO ] Redundant transitions in 56 ms returned []
Running 1754 sub problems to find dead transitions.
[2024-05-22 10:20:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/788 variables, 71/84 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 788/2594 variables, and 84 constraints, problems are : Problem set: 0 solved, 1754 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 71/74 constraints, State Equation: 0/789 constraints, PredecessorRefiner: 1754/1754 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/788 variables, 71/84 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
[2024-05-22 10:21:13] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/2594 variables, and 85 constraints, problems are : Problem set: 0 solved, 1754 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 71/74 constraints, State Equation: 0/789 constraints, PredecessorRefiner: 0/1754 constraints, Known Traps: 1/1 constraints]
After SMT, in 61440ms problems are : Problem set: 0 solved, 1754 unsolved
Search for dead transitions found 0 dead transitions in 61463ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66928 ms. Remains : 789/789 places, 1805/1805 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) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (479 resets) in 365 ms. (109 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (67 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (75 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
[2024-05-22 10:21:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 152/194 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/211 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 351/562 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/603 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 10:21:34] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/603 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 180/783 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/783 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/787 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/787 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/789 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/789 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1805/2594 variables, 789/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2594 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2594 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2594/2594 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1637 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 152/194 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/211 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 351/562 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/603 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/603 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 180/783 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/783 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/787 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/787 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/789 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/789 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1805/2594 variables, 789/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2594 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2594 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2594 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2594/2594 variables, and 882 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1629 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 3297ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 816 ms.
Support contains 3 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1805/1805 transitions.
Free-agglomeration rule applied 35 times.
Iterating global reduction 0 with 35 rules applied. Total rules applied 35 place count 789 transition count 1770
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 78 place count 754 transition count 1762
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 103 place count 754 transition count 1737
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 128 place count 729 transition count 1737
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 729 transition count 1737
Applied a total of 130 rules in 146 ms. Remains 729 /789 variables (removed 60) and now considering 1737/1805 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 729/789 places, 1737/1805 transitions.
RANDOM walk for 40000 steps (651 resets) in 831 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (93 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (99 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 116518 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 2
Probabilistic random walk after 116518 steps, saw 64716 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 1737 rows 729 cols
[2024-05-22 10:21:41] [INFO ] Computed 90 invariants in 19 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 134/172 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/182 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 312/494 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 52/546 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/706 variables, 26/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/710 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/710 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 19/729 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/729 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1737/2466 variables, 729/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2466 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2466 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2466/2466 variables, and 819 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1533 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 729/729 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 134/172 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/182 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 312/494 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 52/546 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/706 variables, 26/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/710 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/710 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 19/729 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/729 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1737/2466 variables, 729/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2466 variables, 2/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2466 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2466 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2466/2466 variables, and 821 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 729/729 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2987ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 9368 steps, including 966 resets, run visited all 2 properties in 175 ms. (steps per millisecond=53 )
Parikh walk visited 2 properties in 175 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 398 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1268 reset in 390 ms.
Product exploration explored 100000 steps with 1265 reset in 457 ms.
Support contains 3 out of 789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 789/789 places, 1805/1805 transitions.
Applied a total of 0 rules in 48 ms. Remains 789 /789 variables (removed 0) and now considering 1805/1805 (removed 0) transitions.
// Phase 1: matrix 1805 rows 789 cols
[2024-05-22 10:21:46] [INFO ] Computed 90 invariants in 37 ms
[2024-05-22 10:21:48] [INFO ] Implicit Places using invariants in 1741 ms returned []
[2024-05-22 10:21:48] [INFO ] Invariant cache hit.
[2024-05-22 10:21:50] [INFO ] Implicit Places using invariants and state equation in 2745 ms returned []
Implicit Place search using SMT with State Equation took 4517 ms to find 0 implicit places.
[2024-05-22 10:21:50] [INFO ] Redundant transitions in 57 ms returned []
Running 1754 sub problems to find dead transitions.
[2024-05-22 10:21:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/788 variables, 71/84 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 788/2594 variables, and 84 constraints, problems are : Problem set: 0 solved, 1754 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 71/74 constraints, State Equation: 0/789 constraints, PredecessorRefiner: 1754/1754 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/788 variables, 71/84 constraints. Problems are: Problem set: 0 solved, 1754 unsolved
[2024-05-22 10:22:32] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/2594 variables, and 85 constraints, problems are : Problem set: 0 solved, 1754 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 71/74 constraints, State Equation: 0/789 constraints, PredecessorRefiner: 0/1754 constraints, Known Traps: 1/1 constraints]
After SMT, in 61389ms problems are : Problem set: 0 solved, 1754 unsolved
Search for dead transitions found 0 dead transitions in 61419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66065 ms. Remains : 789/789 places, 1805/1805 transitions.
Treatment of property ASLink-PT-09a-LTLFireability-07 finished in 169064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(!p1)))'
Support contains 6 out of 1804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 2790/2790 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1802 transition count 2776
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1802 transition count 2776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1801 transition count 2768
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1801 transition count 2768
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1800 transition count 2760
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1800 transition count 2760
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1799 transition count 2752
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1799 transition count 2752
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1798 transition count 2744
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1798 transition count 2744
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1797 transition count 2736
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1797 transition count 2736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1796 transition count 2728
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1796 transition count 2728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1795 transition count 2720
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1795 transition count 2720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1794 transition count 2712
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1794 transition count 2712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1793 transition count 2704
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1793 transition count 2704
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1792 transition count 2696
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1792 transition count 2696
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1791 transition count 2688
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1791 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1790 transition count 2680
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1790 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1789 transition count 2672
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1789 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1788 transition count 2664
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1788 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1787 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1787 transition count 2656
Applied a total of 34 rules in 1488 ms. Remains 1787 /1804 variables (removed 17) and now considering 2656/2790 (removed 134) transitions.
// Phase 1: matrix 2656 rows 1787 cols
[2024-05-22 10:22:54] [INFO ] Computed 245 invariants in 32 ms
[2024-05-22 10:22:55] [INFO ] Implicit Places using invariants in 1503 ms returned [391, 590, 755]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1511 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1804 places, 2656/2790 transitions.
Applied a total of 0 rules in 83 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3082 ms. Remains : 1784/1804 places, 2656/2790 transitions.
Stuttering acceptance computed with spot in 176 ms :[p1, (NOT p0), (AND p1 (NOT p0)), true, (AND p1 p0)]
Running random walk in product with property : ASLink-PT-09a-LTLFireability-10
Product exploration explored 100000 steps with 24978 reset in 1040 ms.
Product exploration explored 100000 steps with 24879 reset in 1146 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 226 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[p1, (AND (NOT p1) (NOT p0)), true, (AND p1 p0)]
RANDOM walk for 40000 steps (175 resets) in 713 ms. (56 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (14 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
// Phase 1: matrix 2656 rows 1784 cols
[2024-05-22 10:22:59] [INFO ] Computed 242 invariants in 30 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 710/764 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 10:22:59] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1020/1784 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1784 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2656/4440 variables, 1784/2027 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/4440 variables, 0/2027 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/4440 variables, 0/2027 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4440/4440 variables, and 2027 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3071 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 186/186 constraints, State Equation: 1784/1784 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 710/764 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 10:23:02] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1020/1784 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1784 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 9 (OVERLAPS) 2656/4440 variables, 1784/2028 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4440/4440 variables, and 2030 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3651 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 186/186 constraints, State Equation: 1784/1784 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 6792ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1441 ms.
Support contains 6 out of 1784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 1784 transition count 2306
Reduce places removed 350 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 354 rules applied. Total rules applied 704 place count 1434 transition count 2302
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 708 place count 1430 transition count 2302
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 708 place count 1430 transition count 2064
Deduced a syphon composed of 238 places in 4 ms
Ensure Unique test removed 77 places
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 553 rules applied. Total rules applied 1261 place count 1115 transition count 2064
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 22 rules applied. Total rules applied 1283 place count 1102 transition count 2055
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1292 place count 1093 transition count 2055
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 1292 place count 1093 transition count 2019
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1364 place count 1057 transition count 2019
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1369 place count 1052 transition count 2014
Iterating global reduction 5 with 5 rules applied. Total rules applied 1374 place count 1052 transition count 2014
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 1378 place count 1052 transition count 2010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1379 place count 1051 transition count 2010
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1379 place count 1051 transition count 2009
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 1381 place count 1050 transition count 2009
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 7 with 192 rules applied. Total rules applied 1573 place count 954 transition count 1913
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1582 place count 954 transition count 1904
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1591 place count 945 transition count 1904
Free-agglomeration rule (complex) applied 35 times.
Iterating global reduction 8 with 35 rules applied. Total rules applied 1626 place count 945 transition count 1869
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 8 with 36 rules applied. Total rules applied 1662 place count 909 transition count 1869
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1670 place count 909 transition count 1861
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 1698 place count 909 transition count 1861
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1699 place count 908 transition count 1860
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1708 place count 899 transition count 1860
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 18 Pre rules applied. Total rules applied 1708 place count 899 transition count 1842
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 10 with 45 rules applied. Total rules applied 1753 place count 872 transition count 1842
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1762 place count 863 transition count 1833
Iterating global reduction 10 with 9 rules applied. Total rules applied 1771 place count 863 transition count 1833
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1780 place count 863 transition count 1824
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1782 place count 862 transition count 1823
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1783 place count 862 transition count 1822
Applied a total of 1783 rules in 655 ms. Remains 862 /1784 variables (removed 922) and now considering 1822/2656 (removed 834) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 862/1784 places, 1822/2656 transitions.
RANDOM walk for 40000 steps (577 resets) in 881 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (74 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 204037 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 204037 steps, saw 70926 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 1822 rows 862 cols
[2024-05-22 10:23:11] [INFO ] Computed 133 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 105/126 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 20/146 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 174/320 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/327 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/328 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 115/443 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/453 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 88/541 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/541 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 10/551 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 77/628 variables, 12/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/628 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/629 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/629 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 81/710 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/710 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 17/727 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/727 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 99/826 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/826 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 18/844 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/844 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 18/862 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/862 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 1822/2684 variables, 862/995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2684 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 0/2684 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2684/2684 variables, and 995 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 112/112 constraints, State Equation: 862/862 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 105/126 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 20/146 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 174/320 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/327 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/328 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 115/443 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/453 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 88/541 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/541 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 10/551 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 77/628 variables, 12/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/628 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/629 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/629 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 81/710 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/710 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 17/727 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/727 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 99/826 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/826 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 18/844 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/844 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 18/862 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/862 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 1822/2684 variables, 862/995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2684 variables, 2/997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2684 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 0/2684 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2684/2684 variables, and 997 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5764 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 112/112 constraints, State Equation: 862/862 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 7493ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1926 ms.
Support contains 6 out of 862 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 862/862 places, 1822/1822 transitions.
Applied a total of 0 rules in 37 ms. Remains 862 /862 variables (removed 0) and now considering 1822/1822 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 862/862 places, 1822/1822 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 862/862 places, 1822/1822 transitions.
Applied a total of 0 rules in 36 ms. Remains 862 /862 variables (removed 0) and now considering 1822/1822 (removed 0) transitions.
[2024-05-22 10:23:20] [INFO ] Invariant cache hit.
[2024-05-22 10:23:22] [INFO ] Implicit Places using invariants in 1492 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 184, 187, 189, 190, 195, 196, 248, 265, 271, 274, 276, 277, 282, 283, 335, 352, 358, 361, 363, 364, 369, 370, 422, 439, 445, 448, 450, 451, 456, 457, 509, 526, 532, 535, 537, 538, 543, 544, 596, 613, 619, 622, 624, 625, 630, 631, 683, 700, 706, 709, 711, 712, 717, 718, 770, 787, 793, 796, 798, 799]
[2024-05-22 10:23:22] [INFO ] Actually due to overlaps returned [190, 277, 364, 451, 538, 625, 712, 799, 88, 94, 99, 184, 189, 265, 271, 276, 352, 358, 363, 439, 445, 450, 526, 532, 537, 613, 619, 624, 700, 706, 711, 787, 793, 798, 71, 100, 158, 248, 335, 422, 509, 596, 683, 770]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 1498 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 818/862 places, 1822/1822 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 783 transition count 1787
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 783 transition count 1787
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 775 transition count 1779
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 775 transition count 1779
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 122 place count 757 transition count 1761
Free-agglomeration rule applied 26 times.
Iterating global reduction 0 with 26 rules applied. Total rules applied 148 place count 757 transition count 1735
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 174 place count 731 transition count 1735
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 182 place count 731 transition count 1727
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 190 place count 723 transition count 1727
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 191 place count 723 transition count 1727
Applied a total of 191 rules in 211 ms. Remains 723 /818 variables (removed 95) and now considering 1727/1822 (removed 95) transitions.
// Phase 1: matrix 1727 rows 723 cols
[2024-05-22 10:23:22] [INFO ] Computed 89 invariants in 21 ms
[2024-05-22 10:23:23] [INFO ] Implicit Places using invariants in 1079 ms returned [88, 89, 168, 169, 239, 240, 310, 311, 381, 382, 452, 453, 523, 524, 594, 595]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1081 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 707/862 places, 1727/1822 transitions.
Applied a total of 0 rules in 31 ms. Remains 707 /707 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2858 ms. Remains : 707/862 places, 1727/1822 transitions.
RANDOM walk for 40000 steps (675 resets) in 484 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (96 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (98 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 116221 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 2
Probabilistic random walk after 116221 steps, saw 64596 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 1727 rows 707 cols
[2024-05-22 10:23:27] [INFO ] Computed 73 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/183 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/191 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 194/385 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/387 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 134/521 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 7/528 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/541 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 33/574 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/574 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 99/673 variables, 13/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/673 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 18/691 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/691 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 16/707 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/707 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1727/2434 variables, 707/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2434 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/2434 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2434/2434 variables, and 780 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1353 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 707/707 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 142/183 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/191 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 194/385 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/387 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 134/521 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 7/528 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/541 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 33/574 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/574 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 99/673 variables, 13/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/673 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 18/691 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/691 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 16/707 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/707 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1727/2434 variables, 707/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2434 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2434 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/2434 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2434/2434 variables, and 782 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12714 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 707/707 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 14118ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2717 ms.
Support contains 6 out of 707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 1727/1727 transitions.
Applied a total of 0 rules in 30 ms. Remains 707 /707 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 707/707 places, 1727/1727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 1727/1727 transitions.
Applied a total of 0 rules in 30 ms. Remains 707 /707 variables (removed 0) and now considering 1727/1727 (removed 0) transitions.
[2024-05-22 10:23:43] [INFO ] Invariant cache hit.
[2024-05-22 10:23:44] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2024-05-22 10:23:44] [INFO ] Invariant cache hit.
[2024-05-22 10:23:47] [INFO ] Implicit Places using invariants and state equation in 2520 ms returned []
Implicit Place search using SMT with State Equation took 3539 ms to find 0 implicit places.
[2024-05-22 10:23:47] [INFO ] Redundant transitions in 55 ms returned []
Running 1685 sub problems to find dead transitions.
[2024-05-22 10:23:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/706 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 706/2434 variables, and 68 constraints, problems are : Problem set: 0 solved, 1685 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/18 constraints, Generalized P Invariants (flows): 53/55 constraints, State Equation: 0/707 constraints, PredecessorRefiner: 1685/1685 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/706 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 706/2434 variables, and 68 constraints, problems are : Problem set: 0 solved, 1685 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/18 constraints, Generalized P Invariants (flows): 53/55 constraints, State Equation: 0/707 constraints, PredecessorRefiner: 0/1685 constraints, Known Traps: 0/0 constraints]
After SMT, in 61341ms problems are : Problem set: 0 solved, 1685 unsolved
Search for dead transitions found 0 dead transitions in 61363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64999 ms. Remains : 707/707 places, 1727/1727 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 13 factoid took 239 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-09a-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-09a-LTLFireability-10 finished in 116551 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(X(G(p0))))))'
Support contains 1 out of 1804 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1804/1804 places, 2790/2790 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1802 transition count 2776
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1802 transition count 2776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1801 transition count 2768
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1801 transition count 2768
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1800 transition count 2760
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1800 transition count 2760
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1799 transition count 2752
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1799 transition count 2752
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1798 transition count 2744
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1798 transition count 2744
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1797 transition count 2736
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1797 transition count 2736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1796 transition count 2728
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1796 transition count 2728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1795 transition count 2720
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1795 transition count 2720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1794 transition count 2712
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1794 transition count 2712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1793 transition count 2704
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1793 transition count 2704
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1792 transition count 2696
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1792 transition count 2696
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1791 transition count 2688
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1791 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1790 transition count 2680
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1790 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1789 transition count 2672
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1789 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1788 transition count 2664
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1788 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1787 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1787 transition count 2656
Applied a total of 34 rules in 1385 ms. Remains 1787 /1804 variables (removed 17) and now considering 2656/2790 (removed 134) transitions.
// Phase 1: matrix 2656 rows 1787 cols
[2024-05-22 10:24:50] [INFO ] Computed 245 invariants in 32 ms
[2024-05-22 10:24:52] [INFO ] Implicit Places using invariants in 1717 ms returned [391, 590, 755]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1724 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1804 places, 2656/2790 transitions.
Applied a total of 0 rules in 83 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3195 ms. Remains : 1784/1804 places, 2656/2790 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-09a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09a-LTLFireability-12 finished in 3411 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 3 out of 1804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1804/1804 places, 2790/2790 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1803 transition count 2453
Reduce places removed 345 places and 0 transitions.
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 1 with 353 rules applied. Total rules applied 689 place count 1458 transition count 2445
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 698 place count 1450 transition count 2444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 699 place count 1449 transition count 2444
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 255 Pre rules applied. Total rules applied 699 place count 1449 transition count 2189
Deduced a syphon composed of 255 places in 3 ms
Ensure Unique test removed 76 places
Reduce places removed 331 places and 0 transitions.
Iterating global reduction 4 with 586 rules applied. Total rules applied 1285 place count 1118 transition count 2189
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 4 with 53 rules applied. Total rules applied 1338 place count 1096 transition count 2158
Reduce places removed 32 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 34 rules applied. Total rules applied 1372 place count 1064 transition count 2156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1374 place count 1062 transition count 2156
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 1374 place count 1062 transition count 2120
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 1446 place count 1026 transition count 2120
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1462 place count 1010 transition count 2092
Iterating global reduction 7 with 16 rules applied. Total rules applied 1478 place count 1010 transition count 2092
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 14 rules applied. Total rules applied 1492 place count 1009 transition count 2079
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1493 place count 1008 transition count 2079
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1493 place count 1008 transition count 2078
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 1495 place count 1007 transition count 2078
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1496 place count 1006 transition count 2070
Iterating global reduction 9 with 1 rules applied. Total rules applied 1497 place count 1006 transition count 2070
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1498 place count 1005 transition count 2062
Iterating global reduction 9 with 1 rules applied. Total rules applied 1499 place count 1005 transition count 2062
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1500 place count 1004 transition count 2054
Iterating global reduction 9 with 1 rules applied. Total rules applied 1501 place count 1004 transition count 2054
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1502 place count 1003 transition count 2046
Iterating global reduction 9 with 1 rules applied. Total rules applied 1503 place count 1003 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1504 place count 1002 transition count 2038
Iterating global reduction 9 with 1 rules applied. Total rules applied 1505 place count 1002 transition count 2038
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1506 place count 1001 transition count 2030
Iterating global reduction 9 with 1 rules applied. Total rules applied 1507 place count 1001 transition count 2030
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1508 place count 1000 transition count 2022
Iterating global reduction 9 with 1 rules applied. Total rules applied 1509 place count 1000 transition count 2022
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1510 place count 999 transition count 2014
Iterating global reduction 9 with 1 rules applied. Total rules applied 1511 place count 999 transition count 2014
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1512 place count 998 transition count 2006
Iterating global reduction 9 with 1 rules applied. Total rules applied 1513 place count 998 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1514 place count 997 transition count 1998
Iterating global reduction 9 with 1 rules applied. Total rules applied 1515 place count 997 transition count 1998
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1516 place count 996 transition count 1990
Iterating global reduction 9 with 1 rules applied. Total rules applied 1517 place count 996 transition count 1990
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1518 place count 995 transition count 1982
Iterating global reduction 9 with 1 rules applied. Total rules applied 1519 place count 995 transition count 1982
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1520 place count 994 transition count 1974
Iterating global reduction 9 with 1 rules applied. Total rules applied 1521 place count 994 transition count 1974
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1522 place count 993 transition count 1966
Iterating global reduction 9 with 1 rules applied. Total rules applied 1523 place count 993 transition count 1966
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1524 place count 992 transition count 1958
Iterating global reduction 9 with 1 rules applied. Total rules applied 1525 place count 992 transition count 1958
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 9 with 178 rules applied. Total rules applied 1703 place count 903 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1704 place count 902 transition count 1868
Iterating global reduction 9 with 1 rules applied. Total rules applied 1705 place count 902 transition count 1868
Applied a total of 1705 rules in 770 ms. Remains 902 /1804 variables (removed 902) and now considering 1868/2790 (removed 922) transitions.
// Phase 1: matrix 1868 rows 902 cols
[2024-05-22 10:24:53] [INFO ] Computed 136 invariants in 23 ms
[2024-05-22 10:24:54] [INFO ] Implicit Places using invariants in 1267 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 305, 340, 361, 369, 375, 377, 386, 439, 463, 469, 474, 476, 536, 553, 559, 564, 566, 626, 643, 649, 654, 656, 716, 733, 739, 744, 746, 806, 823, 829, 834, 836, 899]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1270 ms to find 47 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 855/1804 places, 1868/2790 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 855 transition count 1859
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 846 transition count 1859
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 35 place count 829 transition count 1842
Iterating global reduction 2 with 17 rules applied. Total rules applied 52 place count 829 transition count 1842
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 69 place count 812 transition count 1825
Iterating global reduction 2 with 17 rules applied. Total rules applied 86 place count 812 transition count 1825
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 804 transition count 1817
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 804 transition count 1817
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 146 place count 782 transition count 1795
Applied a total of 146 rules in 162 ms. Remains 782 /855 variables (removed 73) and now considering 1795/1868 (removed 73) transitions.
// Phase 1: matrix 1795 rows 782 cols
[2024-05-22 10:24:54] [INFO ] Computed 89 invariants in 20 ms
[2024-05-22 10:24:55] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2024-05-22 10:24:55] [INFO ] Invariant cache hit.
[2024-05-22 10:24:58] [INFO ] Implicit Places using invariants and state equation in 2947 ms returned []
Implicit Place search using SMT with State Equation took 3994 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 782/1804 places, 1795/2790 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6197 ms. Remains : 782/1804 places, 1795/2790 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09a-LTLFireability-15
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-09a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09a-LTLFireability-15 finished in 6293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
[2024-05-22 10:24:59] [INFO ] Flatten gal took : 137 ms
[2024-05-22 10:24:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 10:24:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1804 places, 2790 transitions and 9790 arcs took 31 ms.
Total runtime 588839 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-09a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1804
TRANSITIONS: 2790
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.071s, Sys 0.010s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.014s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1242
MODEL NAME: /home/mcc/execution/415/model
1804 places, 2790 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-09a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ASLink-PT-09a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620117100140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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