Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117800107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-07a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117800107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 677K 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-07a-LTLCardinality-00
FORMULA_NAME ASLink-PT-07a-LTLCardinality-01
FORMULA_NAME ASLink-PT-07a-LTLCardinality-02
FORMULA_NAME ASLink-PT-07a-LTLCardinality-03
FORMULA_NAME ASLink-PT-07a-LTLCardinality-04
FORMULA_NAME ASLink-PT-07a-LTLCardinality-05
FORMULA_NAME ASLink-PT-07a-LTLCardinality-06
FORMULA_NAME ASLink-PT-07a-LTLCardinality-07
FORMULA_NAME ASLink-PT-07a-LTLCardinality-08
FORMULA_NAME ASLink-PT-07a-LTLCardinality-09
FORMULA_NAME ASLink-PT-07a-LTLCardinality-10
FORMULA_NAME ASLink-PT-07a-LTLCardinality-11
FORMULA_NAME ASLink-PT-07a-LTLCardinality-12
FORMULA_NAME ASLink-PT-07a-LTLCardinality-13
FORMULA_NAME ASLink-PT-07a-LTLCardinality-14
FORMULA_NAME ASLink-PT-07a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717210904223

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:01:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 03:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:01:46] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2024-06-01 03:01:46] [INFO ] Transformed 1601 places.
[2024-06-01 03:01:46] [INFO ] Transformed 2373 transitions.
[2024-06-01 03:01:46] [INFO ] Found NUPN structural information;
[2024-06-01 03:01:46] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 582 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA ASLink-PT-07a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1559 transition count 2348
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 1548 transition count 2302
Ensure Unique test removed 1 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 1547 transition count 2302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 1547 transition count 2300
Applied a total of 67 rules in 571 ms. Remains 1547 /1601 variables (removed 54) and now considering 2300/2348 (removed 48) transitions.
// Phase 1: matrix 2300 rows 1547 cols
[2024-06-01 03:01:47] [INFO ] Computed 265 invariants in 198 ms
[2024-06-01 03:01:50] [INFO ] Implicit Places using invariants in 2869 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 778, 783, 784, 785, 803, 821, 950, 966, 971, 972, 973, 991, 1009, 1138, 1154, 1159, 1160, 1161, 1179, 1197, 1331, 1343, 1348, 1349, 1350, 1385, 1387, 1390, 1408, 1409, 1410, 1411, 1428, 1436, 1444, 1450, 1456, 1462, 1468, 1476, 1482, 1488, 1496]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 2923 ms to find 72 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1475/1601 places, 2300/2348 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1462 transition count 2287
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1462 transition count 2287
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1452 transition count 2277
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1452 transition count 2277
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1447 transition count 2272
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1447 transition count 2272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1445 transition count 2270
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1445 transition count 2270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1443 transition count 2268
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1443 transition count 2268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1442 transition count 2267
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1442 transition count 2267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1441 transition count 2266
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1441 transition count 2266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1440 transition count 2265
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1440 transition count 2265
Applied a total of 70 rules in 654 ms. Remains 1440 /1475 variables (removed 35) and now considering 2265/2300 (removed 35) transitions.
// Phase 1: matrix 2265 rows 1440 cols
[2024-06-01 03:01:51] [INFO ] Computed 193 invariants in 95 ms
[2024-06-01 03:01:52] [INFO ] Implicit Places using invariants in 1586 ms returned []
[2024-06-01 03:01:52] [INFO ] Invariant cache hit.
[2024-06-01 03:01:59] [INFO ] Implicit Places using invariants and state equation in 7062 ms returned []
Implicit Place search using SMT with State Equation took 8654 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1440/1601 places, 2265/2348 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12835 ms. Remains : 1440/1601 places, 2265/2348 transitions.
Support contains 23 out of 1440 places after structural reductions.
[2024-06-01 03:02:00] [INFO ] Flatten gal took : 316 ms
[2024-06-01 03:02:00] [INFO ] Flatten gal took : 174 ms
[2024-06-01 03:02:00] [INFO ] Input system was already deterministic with 2265 transitions.
RANDOM walk for 40000 steps (207 resets) in 2104 ms. (19 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40003 steps (20 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (23 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (21 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (25 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (23 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (23 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (21 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
[2024-06-01 03:02:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 208/224 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 365/589 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 843/1432 variables, 149/192 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1432 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 8/1440 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1440 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2265/3705 variables, 1440/1633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3705 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/3705 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3705/3705 variables, and 1633 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2966 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 150/150 constraints, State Equation: 1440/1440 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 208/224 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 365/589 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 03:02:05] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 843/1432 variables, 149/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1432 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 8/1440 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1440 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2265/3705 variables, 1440/1634 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3705 variables, 7/1641 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3705/3705 variables, and 1641 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 150/150 constraints, State Equation: 1440/1440 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 8047ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 1440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1440/1440 places, 2265/2265 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 261 place count 1440 transition count 2004
Reduce places removed 261 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 262 rules applied. Total rules applied 523 place count 1179 transition count 2003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 524 place count 1178 transition count 2003
Performed 186 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 186 Pre rules applied. Total rules applied 524 place count 1178 transition count 1817
Deduced a syphon composed of 186 places in 8 ms
Ensure Unique test removed 58 places
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 3 with 430 rules applied. Total rules applied 954 place count 934 transition count 1817
Discarding 8 places :
Implicit places reduction removed 8 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 3 with 9 rules applied. Total rules applied 963 place count 926 transition count 1816
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 964 place count 925 transition count 1816
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 26 Pre rules applied. Total rules applied 964 place count 925 transition count 1790
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1016 place count 899 transition count 1790
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1019 place count 896 transition count 1779
Iterating global reduction 5 with 3 rules applied. Total rules applied 1022 place count 896 transition count 1779
Discarding 4 places :
Implicit places reduction removed 4 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 5 with 17 rules applied. Total rules applied 1039 place count 892 transition count 1766
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1052 place count 879 transition count 1766
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1052 place count 879 transition count 1765
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1054 place count 878 transition count 1765
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1058 place count 874 transition count 1754
Iterating global reduction 7 with 4 rules applied. Total rules applied 1062 place count 874 transition count 1754
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1065 place count 874 transition count 1751
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1066 place count 873 transition count 1743
Iterating global reduction 8 with 1 rules applied. Total rules applied 1067 place count 873 transition count 1743
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1068 place count 872 transition count 1735
Iterating global reduction 8 with 1 rules applied. Total rules applied 1069 place count 872 transition count 1735
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1070 place count 871 transition count 1727
Iterating global reduction 8 with 1 rules applied. Total rules applied 1071 place count 871 transition count 1727
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1072 place count 870 transition count 1719
Iterating global reduction 8 with 1 rules applied. Total rules applied 1073 place count 870 transition count 1719
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1074 place count 869 transition count 1711
Iterating global reduction 8 with 1 rules applied. Total rules applied 1075 place count 869 transition count 1711
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1076 place count 868 transition count 1703
Iterating global reduction 8 with 1 rules applied. Total rules applied 1077 place count 868 transition count 1703
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1078 place count 867 transition count 1695
Iterating global reduction 8 with 1 rules applied. Total rules applied 1079 place count 867 transition count 1695
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1080 place count 866 transition count 1687
Iterating global reduction 8 with 1 rules applied. Total rules applied 1081 place count 866 transition count 1687
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1082 place count 865 transition count 1679
Iterating global reduction 8 with 1 rules applied. Total rules applied 1083 place count 865 transition count 1679
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1084 place count 864 transition count 1671
Iterating global reduction 8 with 1 rules applied. Total rules applied 1085 place count 864 transition count 1671
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1086 place count 863 transition count 1663
Iterating global reduction 8 with 1 rules applied. Total rules applied 1087 place count 863 transition count 1663
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1088 place count 862 transition count 1655
Iterating global reduction 8 with 1 rules applied. Total rules applied 1089 place count 862 transition count 1655
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1090 place count 861 transition count 1647
Iterating global reduction 8 with 1 rules applied. Total rules applied 1091 place count 861 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1092 place count 860 transition count 1639
Iterating global reduction 8 with 1 rules applied. Total rules applied 1093 place count 860 transition count 1639
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1094 place count 859 transition count 1631
Iterating global reduction 8 with 1 rules applied. Total rules applied 1095 place count 859 transition count 1631
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 8 with 154 rules applied. Total rules applied 1249 place count 782 transition count 1554
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 1256 place count 782 transition count 1547
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1263 place count 775 transition count 1547
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 9 with 30 rules applied. Total rules applied 1293 place count 775 transition count 1517
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 1324 place count 744 transition count 1517
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 1330 place count 744 transition count 1511
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 1352 place count 744 transition count 1511
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1354 place count 744 transition count 1511
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1355 place count 744 transition count 1510
Applied a total of 1355 rules in 1270 ms. Remains 744 /1440 variables (removed 696) and now considering 1510/2265 (removed 755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1270 ms. Remains : 744/1440 places, 1510/2265 transitions.
RANDOM walk for 40000 steps (488 resets) in 500 ms. (79 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (72 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (79 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (75 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (79 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (76 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (76 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (71 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 251018 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 7
Probabilistic random walk after 251018 steps, saw 46680 distinct states, run finished after 3006 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 1510 rows 744 cols
[2024-06-01 03:02:15] [INFO ] Computed 122 invariants in 20 ms
[2024-06-01 03:02:15] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 63/79 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 100/179 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 500/679 variables, 81/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 65/744 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1510/2254 variables, 744/866 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2254 variables, 34/900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2254 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/2254 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2254/2254 variables, and 900 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1870 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 744/744 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 63/79 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 100/179 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 500/679 variables, 81/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 65/744 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1510/2254 variables, 744/866 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2254 variables, 34/900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2254 variables, 7/907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2254 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/2254 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2254/2254 variables, and 907 constraints, problems are : Problem set: 0 solved, 7 unsolved in 31183 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 744/744 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 33107ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 3 properties in 34142 ms.
Support contains 12 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 1510/1510 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 744 transition count 1509
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1509
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 743 transition count 1508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 742 transition count 1508
Applied a total of 4 rules in 118 ms. Remains 742 /744 variables (removed 2) and now considering 1508/1510 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 742/744 places, 1508/1510 transitions.
RANDOM walk for 40000 steps (500 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (78 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (80 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (79 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (80 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 265704 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 4
Probabilistic random walk after 265704 steps, saw 49598 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 1508 rows 742 cols
[2024-06-01 03:03:25] [INFO ] Computed 122 invariants in 23 ms
[2024-06-01 03:03:25] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/74 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 104/178 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 500/678 variables, 82/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 64/742 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1508/2250 variables, 742/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2250 variables, 34/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2250 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2250 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2250/2250 variables, and 898 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 742/742 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/74 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 104/178 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 500/678 variables, 82/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 64/742 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1508/2250 variables, 742/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2250 variables, 34/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2250 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2250 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2250 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2250/2250 variables, and 902 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2884 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 742/742 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4221ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12498 ms.
Support contains 12 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1508/1508 transitions.
Applied a total of 0 rules in 50 ms. Remains 742 /742 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 742/742 places, 1508/1508 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1508/1508 transitions.
Applied a total of 0 rules in 36 ms. Remains 742 /742 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
[2024-06-01 03:03:42] [INFO ] Invariant cache hit.
[2024-06-01 03:03:43] [INFO ] Implicit Places using invariants in 888 ms returned [89, 95, 98, 100, 103, 110, 111, 112, 181, 187, 190, 192, 195, 202, 203, 204, 274, 280, 283, 285, 288, 295, 296, 297, 366, 372, 375, 382, 389, 390, 391, 462, 468, 471, 473, 476, 484, 485, 486, 556, 566, 569, 572, 575, 588, 660, 666, 669, 671, 675, 689]
[2024-06-01 03:03:43] [INFO ] Actually due to overlaps returned [110, 202, 295, 389, 484, 111, 203, 296, 390, 485, 112, 204, 297, 391, 486, 588, 689, 89, 95, 100, 181, 187, 192, 274, 280, 285, 366, 372, 462, 468, 473, 556, 566, 572, 660, 666, 671, 103, 195, 288, 375, 382, 476, 575, 675]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 894 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 697/742 places, 1508/1508 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 697 transition count 1494
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 683 transition count 1494
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 57 place count 654 transition count 1465
Iterating global reduction 0 with 29 rules applied. Total rules applied 86 place count 654 transition count 1465
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 92 place count 654 transition count 1459
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 649 transition count 1454
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 649 transition count 1454
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 116 place count 642 transition count 1447
Free-agglomeration rule applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 134 place count 642 transition count 1429
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 152 place count 624 transition count 1429
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 624 transition count 1428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 623 transition count 1428
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 623 transition count 1427
Applied a total of 155 rules in 188 ms. Remains 623 /697 variables (removed 74) and now considering 1427/1508 (removed 81) transitions.
// Phase 1: matrix 1427 rows 623 cols
[2024-06-01 03:03:43] [INFO ] Computed 77 invariants in 18 ms
[2024-06-01 03:03:44] [INFO ] Implicit Places using invariants in 686 ms returned [72, 89, 145, 162, 218, 236, 292, 314, 370, 389, 445, 472, 534, 560]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 689 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 609/742 places, 1427/1508 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 608 transition count 1426
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 608 transition count 1426
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 601 transition count 1419
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 601 transition count 1412
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 30 place count 594 transition count 1412
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 594 transition count 1412
Applied a total of 31 rules in 111 ms. Remains 594 /609 variables (removed 15) and now considering 1412/1427 (removed 15) transitions.
// Phase 1: matrix 1412 rows 594 cols
[2024-06-01 03:03:44] [INFO ] Computed 63 invariants in 17 ms
[2024-06-01 03:03:44] [INFO ] Implicit Places using invariants in 630 ms returned []
[2024-06-01 03:03:44] [INFO ] Invariant cache hit.
[2024-06-01 03:03:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 03:03:47] [INFO ] Implicit Places using invariants and state equation in 2100 ms returned []
Implicit Place search using SMT with State Equation took 2735 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 594/742 places, 1412/1508 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4653 ms. Remains : 594/742 places, 1412/1508 transitions.
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' '!(X((p0&&F((!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 1440 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1440/1440 places, 2265/2265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1439 transition count 2256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1439 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1438 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1438 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1437 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1437 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1436 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1436 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1435 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1435 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1434 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1434 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1433 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1433 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1432 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1432 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1431 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1431 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1430 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1430 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1429 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1429 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1428 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1428 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1427 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1427 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1426 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1426 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1425 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1425 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1424 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1424 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1423 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1423 transition count 2128
Applied a total of 34 rules in 931 ms. Remains 1423 /1440 variables (removed 17) and now considering 2128/2265 (removed 137) transitions.
// Phase 1: matrix 2128 rows 1423 cols
[2024-06-01 03:03:48] [INFO ] Computed 193 invariants in 25 ms
[2024-06-01 03:03:49] [INFO ] Implicit Places using invariants in 1341 ms returned [1277]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1343 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1440 places, 2128/2265 transitions.
Applied a total of 0 rules in 53 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2328 ms. Remains : 1422/1440 places, 2128/2265 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (AND (NOT p2) p1)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-01
Stuttering criterion allowed to conclude after 168 steps with 0 reset in 6 ms.
FORMULA ASLink-PT-07a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-01 finished in 2729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1440 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1440/1440 places, 2265/2265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 273 place count 1439 transition count 1991
Reduce places removed 280 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 287 rules applied. Total rules applied 560 place count 1159 transition count 1984
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 567 place count 1152 transition count 1984
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 567 place count 1152 transition count 1781
Deduced a syphon composed of 203 places in 2 ms
Ensure Unique test removed 60 places
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 3 with 466 rules applied. Total rules applied 1033 place count 889 transition count 1781
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 30 rules applied. Total rules applied 1063 place count 874 transition count 1766
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1078 place count 859 transition count 1766
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 1078 place count 859 transition count 1738
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1134 place count 831 transition count 1738
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1144 place count 821 transition count 1720
Iterating global reduction 5 with 10 rules applied. Total rules applied 1154 place count 821 transition count 1720
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 4 places :
Implicit places reduction removed 4 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 5 with 24 rules applied. Total rules applied 1178 place count 817 transition count 1700
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1191 place count 804 transition count 1700
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1191 place count 804 transition count 1699
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1193 place count 803 transition count 1699
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1197 place count 799 transition count 1688
Iterating global reduction 7 with 4 rules applied. Total rules applied 1201 place count 799 transition count 1688
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1204 place count 799 transition count 1685
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1205 place count 798 transition count 1677
Iterating global reduction 8 with 1 rules applied. Total rules applied 1206 place count 798 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1207 place count 797 transition count 1669
Iterating global reduction 8 with 1 rules applied. Total rules applied 1208 place count 797 transition count 1669
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1209 place count 796 transition count 1661
Iterating global reduction 8 with 1 rules applied. Total rules applied 1210 place count 796 transition count 1661
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1211 place count 795 transition count 1653
Iterating global reduction 8 with 1 rules applied. Total rules applied 1212 place count 795 transition count 1653
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1213 place count 794 transition count 1645
Iterating global reduction 8 with 1 rules applied. Total rules applied 1214 place count 794 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1215 place count 793 transition count 1637
Iterating global reduction 8 with 1 rules applied. Total rules applied 1216 place count 793 transition count 1637
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1217 place count 792 transition count 1629
Iterating global reduction 8 with 1 rules applied. Total rules applied 1218 place count 792 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1219 place count 791 transition count 1621
Iterating global reduction 8 with 1 rules applied. Total rules applied 1220 place count 791 transition count 1621
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1221 place count 790 transition count 1613
Iterating global reduction 8 with 1 rules applied. Total rules applied 1222 place count 790 transition count 1613
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 8 with 142 rules applied. Total rules applied 1364 place count 719 transition count 1542
Applied a total of 1364 rules in 466 ms. Remains 719 /1440 variables (removed 721) and now considering 1542/2265 (removed 723) transitions.
// Phase 1: matrix 1542 rows 719 cols
[2024-06-01 03:03:50] [INFO ] Computed 107 invariants in 20 ms
[2024-06-01 03:03:51] [INFO ] Implicit Places using invariants in 823 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 447, 453, 458, 460, 520, 537, 546, 551, 553, 616, 633, 639, 644, 646, 647, 716]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 826 ms to find 36 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 683/1440 places, 1542/2265 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 683 transition count 1540
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 681 transition count 1540
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 17 place count 668 transition count 1527
Iterating global reduction 2 with 13 rules applied. Total rules applied 30 place count 668 transition count 1527
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 43 place count 655 transition count 1514
Iterating global reduction 2 with 13 rules applied. Total rules applied 56 place count 655 transition count 1514
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 649 transition count 1508
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 649 transition count 1508
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 100 place count 633 transition count 1492
Applied a total of 100 rules in 105 ms. Remains 633 /683 variables (removed 50) and now considering 1492/1542 (removed 50) transitions.
// Phase 1: matrix 1492 rows 633 cols
[2024-06-01 03:03:51] [INFO ] Computed 71 invariants in 16 ms
[2024-06-01 03:03:52] [INFO ] Implicit Places using invariants in 860 ms returned []
[2024-06-01 03:03:52] [INFO ] Invariant cache hit.
[2024-06-01 03:03:54] [INFO ] Implicit Places using invariants and state equation in 2131 ms returned []
Implicit Place search using SMT with State Equation took 2992 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 633/1440 places, 1492/2265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4389 ms. Remains : 633/1440 places, 1492/2265 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-04
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 7 ms.
FORMULA ASLink-PT-07a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-04 finished in 4532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 4 out of 1440 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1440/1440 places, 2265/2265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1439 transition count 2256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1439 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1438 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1438 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1437 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1437 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1436 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1436 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1435 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1435 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1434 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1434 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1433 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1433 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1432 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1432 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1431 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1431 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1430 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1430 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1429 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1429 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1428 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1428 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1427 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1427 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1426 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1426 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1425 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1425 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1424 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1424 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1423 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1423 transition count 2128
Applied a total of 34 rules in 964 ms. Remains 1423 /1440 variables (removed 17) and now considering 2128/2265 (removed 137) transitions.
// Phase 1: matrix 2128 rows 1423 cols
[2024-06-01 03:03:55] [INFO ] Computed 193 invariants in 22 ms
[2024-06-01 03:03:56] [INFO ] Implicit Places using invariants in 1299 ms returned []
[2024-06-01 03:03:56] [INFO ] Invariant cache hit.
[2024-06-01 03:04:00] [INFO ] Implicit Places using invariants and state equation in 3979 ms returned []
Implicit Place search using SMT with State Equation took 5281 ms to find 0 implicit places.
Running 2127 sub problems to find dead transitions.
[2024-06-01 03:04:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1422 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 2127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1422/3551 variables, and 136 constraints, problems are : Problem set: 0 solved, 2127 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/43 constraints, Generalized P Invariants (flows): 136/150 constraints, State Equation: 0/1423 constraints, PredecessorRefiner: 2127/2127 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1422 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 2127 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1422/3551 variables, and 136 constraints, problems are : Problem set: 0 solved, 2127 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/43 constraints, Generalized P Invariants (flows): 136/150 constraints, State Equation: 0/1423 constraints, PredecessorRefiner: 0/2127 constraints, Known Traps: 0/0 constraints]
After SMT, in 61682ms problems are : Problem set: 0 solved, 2127 unsolved
Search for dead transitions found 0 dead transitions in 61718ms
Starting structural reductions in LTL mode, iteration 1 : 1423/1440 places, 2128/2265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67979 ms. Remains : 1423/1440 places, 2128/2265 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 408 steps with 2 reset in 4 ms.
FORMULA ASLink-PT-07a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-08 finished in 68171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1440 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1440/1440 places, 2265/2265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1439 transition count 2256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1439 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1438 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1438 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1437 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1437 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1436 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1436 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1435 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1435 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1434 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1434 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1433 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1433 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1432 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1432 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1431 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1431 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1430 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1430 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1429 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1429 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1428 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1428 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1427 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1427 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1426 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1426 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1425 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1425 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1424 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1424 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1423 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1423 transition count 2128
Applied a total of 34 rules in 970 ms. Remains 1423 /1440 variables (removed 17) and now considering 2128/2265 (removed 137) transitions.
[2024-06-01 03:05:03] [INFO ] Invariant cache hit.
[2024-06-01 03:05:05] [INFO ] Implicit Places using invariants in 1551 ms returned [1277]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1558 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1440 places, 2128/2265 transitions.
Applied a total of 0 rules in 52 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2584 ms. Remains : 1422/1440 places, 2128/2265 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-11
Product exploration explored 100000 steps with 521 reset in 657 ms.
Product exploration explored 100000 steps with 503 reset in 532 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (219 resets) in 358 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (23 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 213969 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 213969 steps, saw 72077 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 2128 rows 1422 cols
[2024-06-01 03:05:09] [INFO ] Computed 192 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 523/593 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 821/1414 variables, 147/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1422 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3550/3550 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1422/1422 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 523/593 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 821/1414 variables, 147/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1422 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3550/3550 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 148/148 constraints, State Equation: 1422/1422 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3284ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 263 ms.
Support contains 2 out of 1422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1422 transition count 1848
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1142 transition count 1848
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 190 Pre rules applied. Total rules applied 560 place count 1142 transition count 1658
Deduced a syphon composed of 190 places in 3 ms
Ensure Unique test removed 61 places
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 441 rules applied. Total rules applied 1001 place count 891 transition count 1658
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 20 rules applied. Total rules applied 1021 place count 880 transition count 1649
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1030 place count 871 transition count 1649
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1030 place count 871 transition count 1621
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1086 place count 843 transition count 1621
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1091 place count 838 transition count 1616
Iterating global reduction 4 with 5 rules applied. Total rules applied 1096 place count 838 transition count 1616
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 1100 place count 838 transition count 1612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1101 place count 837 transition count 1612
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1101 place count 837 transition count 1611
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1103 place count 836 transition count 1611
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 1255 place count 760 transition count 1535
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1262 place count 760 transition count 1528
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1269 place count 753 transition count 1528
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1297 place count 753 transition count 1500
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1326 place count 724 transition count 1500
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1332 place count 724 transition count 1494
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 1354 place count 724 transition count 1494
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1356 place count 724 transition count 1494
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1357 place count 724 transition count 1493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1358 place count 723 transition count 1492
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1365 place count 716 transition count 1492
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 1365 place count 716 transition count 1478
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1399 place count 696 transition count 1478
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1405 place count 690 transition count 1472
Iterating global reduction 9 with 6 rules applied. Total rules applied 1411 place count 690 transition count 1472
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1417 place count 690 transition count 1466
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1418 place count 690 transition count 1465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1419 place count 689 transition count 1465
Applied a total of 1419 rules in 462 ms. Remains 689 /1422 variables (removed 733) and now considering 1465/2128 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 689/1422 places, 1465/2128 transitions.
RANDOM walk for 40000 steps (612 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (104 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 303450 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 303450 steps, saw 81525 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
// Phase 1: matrix 1465 rows 689 cols
[2024-06-01 03:05:16] [INFO ] Computed 106 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/134 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/155 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 183/338 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 21/359 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 164/523 variables, 29/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/523 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/541 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/542 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 102/644 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/644 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 18/662 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/662 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/689 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1465/2154 variables, 689/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2154 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2154 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2154/2154 variables, and 795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 689/689 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/134 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/155 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 183/338 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 21/359 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 164/523 variables, 29/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/523 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/541 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/542 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 102/644 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/644 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 18/662 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/662 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/689 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1465/2154 variables, 689/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2154 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2154 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2154 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2154/2154 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1856 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 689/689 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2710ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 218 ms.
Support contains 2 out of 689 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 689/689 places, 1465/1465 transitions.
Applied a total of 0 rules in 25 ms. Remains 689 /689 variables (removed 0) and now considering 1465/1465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 689/689 places, 1465/1465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 689/689 places, 1465/1465 transitions.
Applied a total of 0 rules in 24 ms. Remains 689 /689 variables (removed 0) and now considering 1465/1465 (removed 0) transitions.
[2024-06-01 03:05:19] [INFO ] Invariant cache hit.
[2024-06-01 03:05:21] [INFO ] Implicit Places using invariants in 1094 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 263, 269, 272, 274, 275, 280, 281, 333, 350, 356, 359, 361, 362, 367, 368, 437, 443, 446, 448, 449, 450, 452, 457, 458, 510, 527, 533, 536, 538, 539, 544, 545, 597, 614, 620, 623, 625, 626]
[2024-06-01 03:05:21] [INFO ] Actually due to overlaps returned [187, 275, 362, 452, 539, 626, 88, 94, 99, 175, 181, 186, 263, 269, 274, 350, 356, 361, 437, 443, 448, 527, 533, 538, 614, 620, 625, 71, 100, 158, 245, 333, 449, 510, 597]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 1097 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 654/689 places, 1465/1465 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 624 transition count 1435
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 624 transition count 1435
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 617 transition count 1428
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 617 transition count 1428
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 100 place count 604 transition count 1415
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 101 place count 604 transition count 1414
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 122 place count 604 transition count 1393
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 143 place count 583 transition count 1393
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 150 place count 583 transition count 1386
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 157 place count 576 transition count 1386
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 158 place count 576 transition count 1386
Applied a total of 158 rules in 168 ms. Remains 576 /654 variables (removed 78) and now considering 1386/1465 (removed 79) transitions.
// Phase 1: matrix 1386 rows 576 cols
[2024-06-01 03:05:21] [INFO ] Computed 71 invariants in 14 ms
[2024-06-01 03:05:22] [INFO ] Implicit Places using invariants in 877 ms returned [88, 89, 159, 160, 231, 232, 302, 303, 355, 376, 377, 447, 448]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 878 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 563/689 places, 1386/1465 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 1385
Applied a total of 2 rules in 43 ms. Remains 562 /563 variables (removed 1) and now considering 1385/1386 (removed 1) transitions.
// Phase 1: matrix 1385 rows 562 cols
[2024-06-01 03:05:22] [INFO ] Computed 58 invariants in 15 ms
[2024-06-01 03:05:23] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-06-01 03:05:23] [INFO ] Invariant cache hit.
[2024-06-01 03:05:24] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2797 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 562/689 places, 1385/1465 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5011 ms. Remains : 562/689 places, 1385/1465 transitions.
RANDOM walk for 40000 steps (699 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (126 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 250495 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 250495 steps, saw 141968 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-01 03:05:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/177 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 287/464 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/502 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/562 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/177 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 287/464 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/502 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 03:05:28] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/562 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1385/1947 variables, 562/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1947 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1947 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1947 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2640 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3260ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 123 ms.
Support contains 2 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 562/562 places, 1385/1385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 22 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
[2024-06-01 03:05:31] [INFO ] Invariant cache hit.
[2024-06-01 03:05:32] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-06-01 03:05:32] [INFO ] Invariant cache hit.
[2024-06-01 03:05:34] [INFO ] Implicit Places using invariants and state equation in 2001 ms returned []
Implicit Place search using SMT with State Equation took 2766 ms to find 0 implicit places.
[2024-06-01 03:05:34] [INFO ] Redundant transitions in 120 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-06-01 03:05:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1947 variables, and 52 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 43/46 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 3 (OVERLAPS) 1/562 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/1947 variables, and 58 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 0/0 constraints]
After SMT, in 61136ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 61155ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64074 ms. Remains : 562/562 places, 1385/1385 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 22 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 03:06:35] [INFO ] Invariant cache hit.
[2024-06-01 03:06:35] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 03:06:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 03:06:35] [INFO ] [Nat]Absence check using 12 positive and 46 generalized place invariants in 33 ms returned sat
[2024-06-01 03:06:39] [INFO ] After 3267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 03:06:39] [INFO ] After 3868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 03:06:41] [INFO ] After 5992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 6161 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 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 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0)]
Support contains 2 out of 1422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1422/1422 places, 2128/2128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1421 transition count 1847
Reduce places removed 287 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 294 rules applied. Total rules applied 574 place count 1134 transition count 1840
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 581 place count 1127 transition count 1840
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 581 place count 1127 transition count 1636
Deduced a syphon composed of 204 places in 3 ms
Ensure Unique test removed 61 places
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 3 with 469 rules applied. Total rules applied 1050 place count 862 transition count 1636
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 41 rules applied. Total rules applied 1091 place count 843 transition count 1614
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1113 place count 821 transition count 1614
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 1113 place count 821 transition count 1585
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1171 place count 792 transition count 1585
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1183 place count 780 transition count 1573
Iterating global reduction 5 with 12 rules applied. Total rules applied 1195 place count 780 transition count 1573
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 10 rules applied. Total rules applied 1205 place count 780 transition count 1563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1206 place count 779 transition count 1563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1206 place count 779 transition count 1562
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 778 transition count 1562
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 7 with 140 rules applied. Total rules applied 1348 place count 708 transition count 1492
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1349 place count 708 transition count 1491
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1351 place count 707 transition count 1490
Applied a total of 1351 rules in 209 ms. Remains 707 /1422 variables (removed 715) and now considering 1490/2128 (removed 638) transitions.
// Phase 1: matrix 1490 rows 707 cols
[2024-06-01 03:06:42] [INFO ] Computed 105 invariants in 17 ms
[2024-06-01 03:06:43] [INFO ] Implicit Places using invariants in 903 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 267, 273, 278, 280, 340, 357, 363, 368, 370, 430, 447, 453, 458, 461, 521, 538, 544, 549, 551, 611, 628, 634, 639, 641, 704]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 905 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 672/1422 places, 1490/2128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 672 transition count 1489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 671 transition count 1489
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 16 place count 657 transition count 1475
Iterating global reduction 2 with 14 rules applied. Total rules applied 30 place count 657 transition count 1475
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 44 place count 643 transition count 1461
Iterating global reduction 2 with 14 rules applied. Total rules applied 58 place count 643 transition count 1461
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 636 transition count 1454
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 636 transition count 1454
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 100 place count 622 transition count 1440
Applied a total of 100 rules in 114 ms. Remains 622 /672 variables (removed 50) and now considering 1440/1490 (removed 50) transitions.
// Phase 1: matrix 1440 rows 622 cols
[2024-06-01 03:06:43] [INFO ] Computed 70 invariants in 14 ms
[2024-06-01 03:06:44] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-06-01 03:06:44] [INFO ] Invariant cache hit.
[2024-06-01 03:06:46] [INFO ] Implicit Places using invariants and state equation in 2227 ms returned []
Implicit Place search using SMT with State Equation took 3141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 622/1422 places, 1440/2128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4370 ms. Remains : 622/1422 places, 1440/2128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (543 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (95 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 222995 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 222995 steps, saw 114572 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 03:06:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/169 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 333/502 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/532 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/588 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/606 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/622 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/622 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1440/2062 variables, 622/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2062 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2062 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2062/2062 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/169 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 333/502 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/532 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/588 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/606 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 03:06:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/606 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/622 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/622 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1440/2062 variables, 622/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2062 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2062/2062 variables, and 694 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2129 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2815ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1440/1440 transitions.
Free-agglomeration rule applied 28 times.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 622 transition count 1412
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 63 place count 594 transition count 1405
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 594 transition count 1385
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 103 place count 574 transition count 1385
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 104 place count 574 transition count 1385
Applied a total of 104 rules in 95 ms. Remains 574 /622 variables (removed 48) and now considering 1385/1440 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 574/622 places, 1385/1440 transitions.
RANDOM walk for 40000 steps (730 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (133 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 230626 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 230626 steps, saw 118339 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 1385 rows 574 cols
[2024-06-01 03:06:55] [INFO ] Computed 70 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/437 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/467 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/540 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/558 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/574 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1385/1959 variables, 574/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1959 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1959 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1959/1959 variables, and 644 constraints, problems are : Problem set: 0 solved, 1 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/437 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/467 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/540 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/558 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 03:06:56] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/574 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/574 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1385/1959 variables, 574/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1959 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1959 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1959 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1959/1959 variables, and 646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2706ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 131 ms.
Support contains 2 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1385/1385 transitions.
Applied a total of 0 rules in 22 ms. Remains 574 /574 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 574/574 places, 1385/1385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1385/1385 transitions.
Applied a total of 0 rules in 21 ms. Remains 574 /574 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
[2024-06-01 03:06:58] [INFO ] Invariant cache hit.
[2024-06-01 03:06:59] [INFO ] Implicit Places using invariants in 905 ms returned [88, 89, 159, 160, 231, 232, 302, 303, 374, 375, 445, 446]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 911 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/574 places, 1385/1385 transitions.
Applied a total of 0 rules in 32 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 964 ms. Remains : 562/574 places, 1385/1385 transitions.
RANDOM walk for 40000 steps (709 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (138 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 235004 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 235004 steps, saw 120164 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
// Phase 1: matrix 1385 rows 562 cols
[2024-06-01 03:07:02] [INFO ] Computed 58 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/177 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 287/464 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/502 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/562 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/177 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 287/464 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/502 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/562 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1947 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1947 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3189 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3912ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 2 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 562/562 places, 1385/1385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 20 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
[2024-06-01 03:07:06] [INFO ] Invariant cache hit.
[2024-06-01 03:07:07] [INFO ] Implicit Places using invariants in 754 ms returned []
[2024-06-01 03:07:07] [INFO ] Invariant cache hit.
[2024-06-01 03:07:08] [INFO ] Implicit Places using invariants and state equation in 1749 ms returned []
Implicit Place search using SMT with State Equation took 2505 ms to find 0 implicit places.
[2024-06-01 03:07:09] [INFO ] Redundant transitions in 88 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-06-01 03:07:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1947 variables, and 52 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 43/46 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 3 (OVERLAPS) 1/562 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
(s329 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/1947 variables, and 58 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 0/0 constraints]
After SMT, in 61100ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 61118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63741 ms. Remains : 562/562 places, 1385/1385 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 03:08:10] [INFO ] Invariant cache hit.
[2024-06-01 03:08:10] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 03:08:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 03:08:10] [INFO ] [Nat]Absence check using 12 positive and 46 generalized place invariants in 32 ms returned sat
[2024-06-01 03:08:12] [INFO ] After 1949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 03:08:15] [INFO ] After 4755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 03:08:15] [INFO ] After 5286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 5440 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1289 reset in 271 ms.
Product exploration explored 100000 steps with 1353 reset in 425 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1440/1440 transitions.
Applied a total of 0 rules in 22 ms. Remains 622 /622 variables (removed 0) and now considering 1440/1440 (removed 0) transitions.
// Phase 1: matrix 1440 rows 622 cols
[2024-06-01 03:08:16] [INFO ] Computed 70 invariants in 15 ms
[2024-06-01 03:08:17] [INFO ] Implicit Places using invariants in 918 ms returned []
[2024-06-01 03:08:17] [INFO ] Invariant cache hit.
[2024-06-01 03:08:19] [INFO ] Implicit Places using invariants and state equation in 2299 ms returned []
Implicit Place search using SMT with State Equation took 3219 ms to find 0 implicit places.
[2024-06-01 03:08:19] [INFO ] Redundant transitions in 115 ms returned []
Running 1399 sub problems to find dead transitions.
[2024-06-01 03:08:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2062 variables, and 65 constraints, problems are : Problem set: 0 solved, 1399 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 55/57 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 1399/1399 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/2062 variables, and 65 constraints, problems are : Problem set: 0 solved, 1399 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 55/57 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/1399 constraints, Known Traps: 0/0 constraints]
After SMT, in 60998ms problems are : Problem set: 0 solved, 1399 unsolved
Search for dead transitions found 0 dead transitions in 61018ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64386 ms. Remains : 622/622 places, 1440/1440 transitions.
Treatment of property ASLink-PT-07a-LTLCardinality-11 finished in 258588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((G(p1)||F(p2))))))'
Support contains 3 out of 1440 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1440/1440 places, 2265/2265 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1439 transition count 2256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1439 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1438 transition count 2248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1438 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1437 transition count 2240
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1437 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1436 transition count 2232
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1436 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1435 transition count 2224
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1435 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1434 transition count 2216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1434 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1433 transition count 2208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1433 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1432 transition count 2200
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1432 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1431 transition count 2192
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1431 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1430 transition count 2184
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1430 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1429 transition count 2176
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1429 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1428 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1428 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1427 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1427 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1426 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1426 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1425 transition count 2144
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1425 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1424 transition count 2136
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1424 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1423 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1423 transition count 2128
Applied a total of 34 rules in 994 ms. Remains 1423 /1440 variables (removed 17) and now considering 2128/2265 (removed 137) transitions.
// Phase 1: matrix 2128 rows 1423 cols
[2024-06-01 03:09:22] [INFO ] Computed 193 invariants in 22 ms
[2024-06-01 03:09:23] [INFO ] Implicit Places using invariants in 1419 ms returned [1277]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1422 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1440 places, 2128/2265 transitions.
Applied a total of 0 rules in 52 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2470 ms. Remains : 1422/1440 places, 2128/2265 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-12
Stuttering criterion allowed to conclude after 79186 steps with 436 reset in 425 ms.
FORMULA ASLink-PT-07a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-12 finished in 3155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1440 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1440/1440 places, 2265/2265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1439 transition count 1989
Reduce places removed 282 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 289 rules applied. Total rules applied 564 place count 1157 transition count 1982
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 571 place count 1150 transition count 1982
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 571 place count 1150 transition count 1779
Deduced a syphon composed of 203 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 3 with 467 rules applied. Total rules applied 1038 place count 886 transition count 1779
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 30 rules applied. Total rules applied 1068 place count 871 transition count 1764
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1083 place count 856 transition count 1764
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 1083 place count 856 transition count 1735
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1141 place count 827 transition count 1735
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1150 place count 818 transition count 1726
Iterating global reduction 5 with 9 rules applied. Total rules applied 1159 place count 818 transition count 1726
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 1167 place count 818 transition count 1718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1168 place count 817 transition count 1718
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1168 place count 817 transition count 1717
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1170 place count 816 transition count 1717
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 7 with 156 rules applied. Total rules applied 1326 place count 738 transition count 1639
Applied a total of 1326 rules in 165 ms. Remains 738 /1440 variables (removed 702) and now considering 1639/2265 (removed 626) transitions.
// Phase 1: matrix 1639 rows 738 cols
[2024-06-01 03:09:24] [INFO ] Computed 110 invariants in 17 ms
[2024-06-01 03:09:25] [INFO ] Implicit Places using invariants in 1053 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 519, 536, 542, 547, 549, 612, 629, 635, 641, 643, 644, 723, 726, 729, 732, 735]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1055 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 698/1440 places, 1639/2265 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 698 transition count 1638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 697 transition count 1638
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 19 place count 680 transition count 1621
Iterating global reduction 2 with 17 rules applied. Total rules applied 36 place count 680 transition count 1621
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 53 place count 663 transition count 1601
Iterating global reduction 2 with 17 rules applied. Total rules applied 70 place count 663 transition count 1601
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 663 transition count 1598
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 80 place count 656 transition count 1591
Iterating global reduction 3 with 7 rules applied. Total rules applied 87 place count 656 transition count 1591
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 3 with 36 rules applied. Total rules applied 123 place count 638 transition count 1573
Applied a total of 123 rules in 109 ms. Remains 638 /698 variables (removed 60) and now considering 1573/1639 (removed 66) transitions.
// Phase 1: matrix 1573 rows 638 cols
[2024-06-01 03:09:25] [INFO ] Computed 70 invariants in 16 ms
[2024-06-01 03:09:26] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-06-01 03:09:26] [INFO ] Invariant cache hit.
[2024-06-01 03:09:29] [INFO ] Implicit Places using invariants and state equation in 2676 ms returned []
Implicit Place search using SMT with State Equation took 3560 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 638/1440 places, 1573/2265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4891 ms. Remains : 638/1440 places, 1573/2265 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-14
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-07a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-14 finished in 5017 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)))'
Found a Lengthening insensitive property : ASLink-PT-07a-LTLCardinality-11
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1440 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1440/1440 places, 2265/2265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 1439 transition count 1990
Reduce places removed 281 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 288 rules applied. Total rules applied 562 place count 1158 transition count 1983
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 569 place count 1151 transition count 1983
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 569 place count 1151 transition count 1779
Deduced a syphon composed of 204 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 3 with 469 rules applied. Total rules applied 1038 place count 886 transition count 1779
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 29 rules applied. Total rules applied 1067 place count 871 transition count 1765
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1081 place count 857 transition count 1765
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 1081 place count 857 transition count 1736
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1139 place count 828 transition count 1736
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1149 place count 818 transition count 1718
Iterating global reduction 5 with 10 rules applied. Total rules applied 1159 place count 818 transition count 1718
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 4 places :
Implicit places reduction removed 4 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 5 with 23 rules applied. Total rules applied 1182 place count 814 transition count 1699
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1195 place count 801 transition count 1699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1195 place count 801 transition count 1698
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1197 place count 800 transition count 1698
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1201 place count 796 transition count 1687
Iterating global reduction 7 with 4 rules applied. Total rules applied 1205 place count 796 transition count 1687
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1208 place count 796 transition count 1684
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1209 place count 795 transition count 1676
Iterating global reduction 8 with 1 rules applied. Total rules applied 1210 place count 795 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1211 place count 794 transition count 1668
Iterating global reduction 8 with 1 rules applied. Total rules applied 1212 place count 794 transition count 1668
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1213 place count 793 transition count 1660
Iterating global reduction 8 with 1 rules applied. Total rules applied 1214 place count 793 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1215 place count 792 transition count 1652
Iterating global reduction 8 with 1 rules applied. Total rules applied 1216 place count 792 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1217 place count 791 transition count 1644
Iterating global reduction 8 with 1 rules applied. Total rules applied 1218 place count 791 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1219 place count 790 transition count 1636
Iterating global reduction 8 with 1 rules applied. Total rules applied 1220 place count 790 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1221 place count 789 transition count 1628
Iterating global reduction 8 with 1 rules applied. Total rules applied 1222 place count 789 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1223 place count 788 transition count 1620
Iterating global reduction 8 with 1 rules applied. Total rules applied 1224 place count 788 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1225 place count 787 transition count 1612
Iterating global reduction 8 with 1 rules applied. Total rules applied 1226 place count 787 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1227 place count 786 transition count 1604
Iterating global reduction 8 with 1 rules applied. Total rules applied 1228 place count 786 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1229 place count 785 transition count 1596
Iterating global reduction 8 with 1 rules applied. Total rules applied 1230 place count 785 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1231 place count 784 transition count 1588
Iterating global reduction 8 with 1 rules applied. Total rules applied 1232 place count 784 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1233 place count 783 transition count 1580
Iterating global reduction 8 with 1 rules applied. Total rules applied 1234 place count 783 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1235 place count 782 transition count 1572
Iterating global reduction 8 with 1 rules applied. Total rules applied 1236 place count 782 transition count 1572
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1237 place count 781 transition count 1564
Iterating global reduction 8 with 1 rules applied. Total rules applied 1238 place count 781 transition count 1564
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 8 with 138 rules applied. Total rules applied 1376 place count 712 transition count 1495
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1378 place count 712 transition count 1495
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1379 place count 711 transition count 1494
Iterating global reduction 8 with 1 rules applied. Total rules applied 1380 place count 711 transition count 1494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1381 place count 711 transition count 1493
Applied a total of 1381 rules in 559 ms. Remains 711 /1440 variables (removed 729) and now considering 1493/2265 (removed 772) transitions.
// Phase 1: matrix 1493 rows 711 cols
[2024-06-01 03:09:30] [INFO ] Computed 106 invariants in 16 ms
[2024-06-01 03:09:31] [INFO ] Implicit Places using invariants in 1022 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 267, 273, 278, 280, 340, 357, 363, 368, 370, 430, 448, 454, 459, 461, 521, 538, 544, 549, 551, 614, 631, 637, 642, 644, 645, 708]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 1024 ms to find 36 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 675/1440 places, 1493/2265 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 675 transition count 1491
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 673 transition count 1491
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 18 place count 659 transition count 1477
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 659 transition count 1477
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 46 place count 645 transition count 1463
Iterating global reduction 2 with 14 rules applied. Total rules applied 60 place count 645 transition count 1463
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 638 transition count 1456
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 638 transition count 1456
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 106 place count 622 transition count 1440
Applied a total of 106 rules in 98 ms. Remains 622 /675 variables (removed 53) and now considering 1440/1493 (removed 53) transitions.
// Phase 1: matrix 1440 rows 622 cols
[2024-06-01 03:09:31] [INFO ] Computed 70 invariants in 14 ms
[2024-06-01 03:09:32] [INFO ] Implicit Places using invariants in 852 ms returned []
[2024-06-01 03:09:32] [INFO ] Invariant cache hit.
[2024-06-01 03:09:34] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2815 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 622/1440 places, 1440/2265 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4496 ms. Remains : 622/1440 places, 1440/2265 transitions.
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-11
Product exploration explored 100000 steps with 1345 reset in 251 ms.
Product exploration explored 100000 steps with 1317 reset in 284 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (535 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (98 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 222831 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 222831 steps, saw 114476 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 03:09:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/169 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 333/502 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/532 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/588 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/606 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/622 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/622 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1440/2062 variables, 622/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2062 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2062 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2062/2062 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/169 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 333/502 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/532 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/588 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/606 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 03:09:38] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/606 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/622 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/622 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1440/2062 variables, 622/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2062/2062 variables, and 694 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1928 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2621ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1440/1440 transitions.
Free-agglomeration rule applied 28 times.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 622 transition count 1412
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 63 place count 594 transition count 1405
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 594 transition count 1385
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 103 place count 574 transition count 1385
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 104 place count 574 transition count 1385
Applied a total of 104 rules in 94 ms. Remains 574 /622 variables (removed 48) and now considering 1385/1440 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 574/622 places, 1385/1440 transitions.
RANDOM walk for 40000 steps (745 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (138 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 232841 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 232841 steps, saw 119242 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 1385 rows 574 cols
[2024-06-01 03:09:43] [INFO ] Computed 70 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/437 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/467 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/540 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/558 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/574 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1385/1959 variables, 574/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1959 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1959 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1959/1959 variables, and 644 constraints, problems are : Problem set: 0 solved, 1 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/437 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/467 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/540 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/558 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 03:09:44] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/574 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/574 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1385/1959 variables, 574/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1959 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1959 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1959 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1959/1959 variables, and 646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3182 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3862ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 2 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1385/1385 transitions.
Applied a total of 0 rules in 24 ms. Remains 574 /574 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 574/574 places, 1385/1385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1385/1385 transitions.
Applied a total of 0 rules in 23 ms. Remains 574 /574 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
[2024-06-01 03:09:47] [INFO ] Invariant cache hit.
[2024-06-01 03:09:48] [INFO ] Implicit Places using invariants in 754 ms returned [88, 89, 159, 160, 231, 232, 302, 303, 374, 375, 445, 446]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 757 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/574 places, 1385/1385 transitions.
Applied a total of 0 rules in 23 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 803 ms. Remains : 562/574 places, 1385/1385 transitions.
RANDOM walk for 40000 steps (686 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (136 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 243125 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 243125 steps, saw 123500 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 1385 rows 562 cols
[2024-06-01 03:09:51] [INFO ] Computed 58 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/177 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 287/464 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/502 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/562 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/177 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 287/464 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/502 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/562 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1947 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1947 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2075 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2789ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 2 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 562/562 places, 1385/1385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
[2024-06-01 03:09:54] [INFO ] Invariant cache hit.
[2024-06-01 03:09:55] [INFO ] Implicit Places using invariants in 753 ms returned []
[2024-06-01 03:09:55] [INFO ] Invariant cache hit.
[2024-06-01 03:09:57] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2642 ms to find 0 implicit places.
[2024-06-01 03:09:57] [INFO ] Redundant transitions in 24 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-06-01 03:09:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1947 variables, and 52 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 43/46 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
SMT process timed out in 61137ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 61166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63865 ms. Remains : 562/562 places, 1385/1385 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 03:10:58] [INFO ] Invariant cache hit.
[2024-06-01 03:10:58] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 03:10:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 03:10:58] [INFO ] [Nat]Absence check using 12 positive and 46 generalized place invariants in 31 ms returned sat
[2024-06-01 03:11:00] [INFO ] After 2204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 03:11:03] [INFO ] After 4615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 03:11:05] [INFO ] After 6558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 6700 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1440/1440 transitions.
Applied a total of 0 rules in 23 ms. Remains 622 /622 variables (removed 0) and now considering 1440/1440 (removed 0) transitions.
// Phase 1: matrix 1440 rows 622 cols
[2024-06-01 03:11:05] [INFO ] Computed 70 invariants in 15 ms
[2024-06-01 03:11:06] [INFO ] Implicit Places using invariants in 806 ms returned []
[2024-06-01 03:11:06] [INFO ] Invariant cache hit.
[2024-06-01 03:11:07] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2596 ms to find 0 implicit places.
[2024-06-01 03:11:07] [INFO ] Redundant transitions in 30 ms returned []
Running 1399 sub problems to find dead transitions.
[2024-06-01 03:11:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2062 variables, and 65 constraints, problems are : Problem set: 0 solved, 1399 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 55/57 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 1399/1399 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/2062 variables, and 65 constraints, problems are : Problem set: 0 solved, 1399 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 55/57 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/1399 constraints, Known Traps: 0/0 constraints]
After SMT, in 60981ms problems are : Problem set: 0 solved, 1399 unsolved
Search for dead transitions found 0 dead transitions in 61000ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63659 ms. Remains : 622/622 places, 1440/1440 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (524 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (99 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 220158 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 220158 steps, saw 112525 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-06-01 03:12:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/169 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 333/502 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/532 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/588 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/606 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/622 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/622 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1440/2062 variables, 622/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2062 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2062 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2062/2062 variables, and 692 constraints, problems are : Problem set: 0 solved, 1 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 149/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/169 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 333/502 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/532 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/588 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/606 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 03:12:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/606 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/622 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/622 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1440/2062 variables, 622/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2062/2062 variables, and 694 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1921 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2632ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1440/1440 transitions.
Free-agglomeration rule applied 28 times.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 622 transition count 1412
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 63 place count 594 transition count 1405
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 594 transition count 1385
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 103 place count 574 transition count 1385
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 104 place count 574 transition count 1385
Applied a total of 104 rules in 90 ms. Remains 574 /622 variables (removed 48) and now considering 1385/1440 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 574/622 places, 1385/1440 transitions.
RANDOM walk for 40000 steps (684 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (134 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 230682 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 230682 steps, saw 118357 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 1385 rows 574 cols
[2024-06-01 03:12:18] [INFO ] Computed 70 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/437 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/467 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/540 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/558 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/574 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1385/1959 variables, 574/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1959 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1959 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1959/1959 variables, and 644 constraints, problems are : Problem set: 0 solved, 1 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/437 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/467 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/540 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/558 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 03:12:18] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/574 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/574 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1385/1959 variables, 574/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1959 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1959 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1959 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1959/1959 variables, and 646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3181 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3861ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 2 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1385/1385 transitions.
Applied a total of 0 rules in 22 ms. Remains 574 /574 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 574/574 places, 1385/1385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 1385/1385 transitions.
Applied a total of 0 rules in 21 ms. Remains 574 /574 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
[2024-06-01 03:12:22] [INFO ] Invariant cache hit.
[2024-06-01 03:12:23] [INFO ] Implicit Places using invariants in 972 ms returned [88, 89, 159, 160, 231, 232, 302, 303, 374, 375, 445, 446]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 975 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/574 places, 1385/1385 transitions.
Applied a total of 0 rules in 31 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1029 ms. Remains : 562/574 places, 1385/1385 transitions.
RANDOM walk for 40000 steps (691 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (140 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 239282 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 239282 steps, saw 121848 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 1385 rows 562 cols
[2024-06-01 03:12:26] [INFO ] Computed 58 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/177 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 287/464 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/502 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/562 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/177 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 287/464 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/502 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/562 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1947 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1947 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2080 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2821ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 142 ms.
Support contains 2 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 562/562 places, 1385/1385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
[2024-06-01 03:12:29] [INFO ] Invariant cache hit.
[2024-06-01 03:12:29] [INFO ] Implicit Places using invariants in 834 ms returned []
[2024-06-01 03:12:29] [INFO ] Invariant cache hit.
[2024-06-01 03:12:32] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2878 ms to find 0 implicit places.
[2024-06-01 03:12:32] [INFO ] Redundant transitions in 39 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-06-01 03:12:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1947 variables, and 52 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 43/46 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
SMT process timed out in 60994ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 61010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63957 ms. Remains : 562/562 places, 1385/1385 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 03:13:33] [INFO ] Invariant cache hit.
[2024-06-01 03:13:33] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 03:13:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 03:13:33] [INFO ] [Nat]Absence check using 12 positive and 46 generalized place invariants in 31 ms returned sat
[2024-06-01 03:13:35] [INFO ] After 2272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 03:13:38] [INFO ] After 4770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 03:13:39] [INFO ] After 6781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 6924 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1351 reset in 274 ms.
Product exploration explored 100000 steps with 1347 reset in 308 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1440/1440 transitions.
Applied a total of 0 rules in 23 ms. Remains 622 /622 variables (removed 0) and now considering 1440/1440 (removed 0) transitions.
// Phase 1: matrix 1440 rows 622 cols
[2024-06-01 03:13:40] [INFO ] Computed 70 invariants in 16 ms
[2024-06-01 03:13:41] [INFO ] Implicit Places using invariants in 835 ms returned []
[2024-06-01 03:13:41] [INFO ] Invariant cache hit.
[2024-06-01 03:13:43] [INFO ] Implicit Places using invariants and state equation in 1906 ms returned []
Implicit Place search using SMT with State Equation took 2746 ms to find 0 implicit places.
[2024-06-01 03:13:43] [INFO ] Redundant transitions in 40 ms returned []
Running 1399 sub problems to find dead transitions.
[2024-06-01 03:13:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/2062 variables, and 65 constraints, problems are : Problem set: 0 solved, 1399 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 55/57 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 1399/1399 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 1399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/2062 variables, and 65 constraints, problems are : Problem set: 0 solved, 1399 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 55/57 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 0/1399 constraints, Known Traps: 0/0 constraints]
After SMT, in 60976ms problems are : Problem set: 0 solved, 1399 unsolved
Search for dead transitions found 0 dead transitions in 60992ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63812 ms. Remains : 622/622 places, 1440/1440 transitions.
Treatment of property ASLink-PT-07a-LTLCardinality-11 finished in 315328 ms.
[2024-06-01 03:14:44] [INFO ] Flatten gal took : 127 ms
[2024-06-01 03:14:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 03:14:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1440 places, 2265 transitions and 7934 arcs took 38 ms.
Total runtime 778978 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ASLink-PT-07a-LTLCardinality-11

BK_STOP 1717213283166

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ASLink-PT-07a-LTLCardinality-11
ltl formula formula --ltl=/tmp/1183/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1440 places, 2265 transitions and 7934 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1183/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1183/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.730 real 0.100 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1183/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1183/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1442 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1441, there are 2273 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~386 levels ~10000 states ~40672 transitions
pnml2lts-mc( 0/ 4): ~1250 levels ~20000 states ~78580 transitions
pnml2lts-mc( 1/ 4): ~276 levels ~40000 states ~176352 transitions
pnml2lts-mc( 1/ 4): ~276 levels ~80000 states ~369792 transitions
pnml2lts-mc( 1/ 4): ~276 levels ~160000 states ~818548 transitions
pnml2lts-mc( 2/ 4): ~393 levels ~320000 states ~1489692 transitions
pnml2lts-mc( 0/ 4): ~1250 levels ~640000 states ~3274828 transitions
pnml2lts-mc( 2/ 4): ~393 levels ~1280000 states ~7221252 transitions
pnml2lts-mc( 2/ 4): ~393 levels ~2560000 states ~15136956 transitions
pnml2lts-mc( 2/ 4): ~393 levels ~5120000 states ~32864152 transitions
pnml2lts-mc( 3/ 4): ~2930 levels ~10240000 states ~59748816 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12418706
pnml2lts-mc( 0/ 4): unique states count: 12423488
pnml2lts-mc( 0/ 4): unique transitions count: 80179621
pnml2lts-mc( 0/ 4): - self-loop count: 689
pnml2lts-mc( 0/ 4): - claim dead count: 67740799
pnml2lts-mc( 0/ 4): - claim found count: 1028
pnml2lts-mc( 0/ 4): - claim success count: 12423494
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4849
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12423494 states 80179746 transitions, fanout: 6.454
pnml2lts-mc( 0/ 4): Total exploration time 1596.200 sec (1596.180 sec minimum, 1596.185 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7783, Transitions per second: 50232
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 158.9MB, 13.4 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 37.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2322 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 158.9MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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