About the Execution of LTSMin+red for ASLink-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1545.556 | 3600000.00 | 14820067.00 | 1349.30 | FFFFTFTFF?FFF?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117900124.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-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117900124
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 757K 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-08a-LTLFireability-00
FORMULA_NAME ASLink-PT-08a-LTLFireability-01
FORMULA_NAME ASLink-PT-08a-LTLFireability-02
FORMULA_NAME ASLink-PT-08a-LTLFireability-03
FORMULA_NAME ASLink-PT-08a-LTLFireability-04
FORMULA_NAME ASLink-PT-08a-LTLFireability-05
FORMULA_NAME ASLink-PT-08a-LTLFireability-06
FORMULA_NAME ASLink-PT-08a-LTLFireability-07
FORMULA_NAME ASLink-PT-08a-LTLFireability-08
FORMULA_NAME ASLink-PT-08a-LTLFireability-09
FORMULA_NAME ASLink-PT-08a-LTLFireability-10
FORMULA_NAME ASLink-PT-08a-LTLFireability-11
FORMULA_NAME ASLink-PT-08a-LTLFireability-12
FORMULA_NAME ASLink-PT-08a-LTLFireability-13
FORMULA_NAME ASLink-PT-08a-LTLFireability-14
FORMULA_NAME ASLink-PT-08a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717220808242
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:46:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:46:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:46:51] [INFO ] Load time of PNML (sax parser for PT used): 430 ms
[2024-06-01 05:46:51] [INFO ] Transformed 1796 places.
[2024-06-01 05:46:51] [INFO ] Transformed 2646 transitions.
[2024-06-01 05:46:51] [INFO ] Found NUPN structural information;
[2024-06-01 05:46:51] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 770 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA ASLink-PT-08a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1748 transition count 2618
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 1736 transition count 2563
Ensure Unique test removed 1 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 1735 transition count 2563
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 1735 transition count 2561
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1734 transition count 2553
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1734 transition count 2553
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 1733 transition count 2545
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1733 transition count 2545
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 1732 transition count 2537
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 1732 transition count 2537
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 1731 transition count 2529
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 1731 transition count 2529
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1730 transition count 2521
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1730 transition count 2521
Applied a total of 85 rules in 1571 ms. Remains 1730 /1796 variables (removed 66) and now considering 2521/2618 (removed 97) transitions.
// Phase 1: matrix 2521 rows 1730 cols
[2024-06-01 05:46:54] [INFO ] Computed 297 invariants in 272 ms
[2024-06-01 05:46:56] [INFO ] Implicit Places using invariants in 3050 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 240, 258, 387, 403, 408, 409, 410, 428, 446, 575, 591, 596, 597, 598, 616, 634, 763, 779, 784, 785, 786, 804, 822, 951, 967, 972, 973, 974, 992, 1010, 1139, 1155, 1160, 1161, 1162, 1180, 1198, 1327, 1343, 1348, 1349, 1350, 1368, 1386, 1515, 1520, 1532, 1537, 1538, 1539, 1568, 1573, 1591, 1592, 1593, 1594, 1611, 1619, 1627, 1633, 1639, 1645, 1651, 1659, 1665, 1671, 1679]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 3103 ms to find 78 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1652/1796 places, 2521/2618 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1640 transition count 2509
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1640 transition count 2509
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1632 transition count 2501
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1632 transition count 2501
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1628 transition count 2497
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1628 transition count 2497
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1627 transition count 2496
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1627 transition count 2496
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1626 transition count 2495
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1626 transition count 2495
Applied a total of 52 rules in 496 ms. Remains 1626 /1652 variables (removed 26) and now considering 2495/2521 (removed 26) transitions.
// Phase 1: matrix 2495 rows 1626 cols
[2024-06-01 05:46:57] [INFO ] Computed 219 invariants in 70 ms
[2024-06-01 05:46:58] [INFO ] Implicit Places using invariants in 1672 ms returned []
[2024-06-01 05:46:58] [INFO ] Invariant cache hit.
[2024-06-01 05:47:06] [INFO ] Implicit Places using invariants and state equation in 7632 ms returned []
Implicit Place search using SMT with State Equation took 9315 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1626/1796 places, 2495/2618 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14517 ms. Remains : 1626/1796 places, 2495/2618 transitions.
Support contains 51 out of 1626 places after structural reductions.
[2024-06-01 05:47:07] [INFO ] Flatten gal took : 456 ms
[2024-06-01 05:47:07] [INFO ] Flatten gal took : 246 ms
[2024-06-01 05:47:08] [INFO ] Input system was already deterministic with 2495 transitions.
RANDOM walk for 40000 steps (185 resets) in 2235 ms. (17 steps per ms) remains 19/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
[2024-06-01 05:47:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 372/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 358/774 variables, 39/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 851/1625 variables, 163/218 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1625 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/1626 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1626 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 2495/4121 variables, 1626/1845 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4121/4121 variables, and 1845 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 164/164 constraints, State Equation: 1626/1626 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 372/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 358/774 variables, 39/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 851/1625 variables, 163/218 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1625 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/1626 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1626 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 19 unsolved
SMT process timed out in 10163ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 1626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 302 rules applied. Total rules applied 302 place count 1626 transition count 2193
Reduce places removed 302 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 310 rules applied. Total rules applied 612 place count 1324 transition count 2185
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 620 place count 1316 transition count 2185
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 215 Pre rules applied. Total rules applied 620 place count 1316 transition count 1970
Deduced a syphon composed of 215 places in 5 ms
Ensure Unique test removed 69 places
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 3 with 499 rules applied. Total rules applied 1119 place count 1032 transition count 1970
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 16 rules applied. Total rules applied 1135 place count 1021 transition count 1965
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1140 place count 1016 transition count 1965
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 1140 place count 1016 transition count 1933
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1204 place count 984 transition count 1933
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1210 place count 978 transition count 1927
Iterating global reduction 5 with 6 rules applied. Total rules applied 1216 place count 978 transition count 1927
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1217 place count 978 transition count 1926
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1218 place count 977 transition count 1926
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1218 place count 977 transition count 1925
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1220 place count 976 transition count 1925
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1224 place count 972 transition count 1921
Iterating global reduction 7 with 4 rules applied. Total rules applied 1228 place count 972 transition count 1921
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1231 place count 972 transition count 1918
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 8 with 163 rules applied. Total rules applied 1394 place count 890 transition count 1837
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1396 place count 888 transition count 1835
Iterating global reduction 8 with 2 rules applied. Total rules applied 1398 place count 888 transition count 1835
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1398 place count 888 transition count 1834
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1400 place count 887 transition count 1834
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 1409 place count 887 transition count 1825
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1418 place count 878 transition count 1825
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 9 with 29 rules applied. Total rules applied 1447 place count 878 transition count 1796
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 1476 place count 849 transition count 1796
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 1482 place count 849 transition count 1790
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 1503 place count 849 transition count 1790
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1506 place count 849 transition count 1790
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 1507 place count 849 transition count 1789
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1508 place count 848 transition count 1788
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1516 place count 840 transition count 1788
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 1516 place count 840 transition count 1773
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 35 rules applied. Total rules applied 1551 place count 820 transition count 1773
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 1553 place count 819 transition count 1772
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1554 place count 818 transition count 1772
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1559 place count 813 transition count 1767
Iterating global reduction 13 with 5 rules applied. Total rules applied 1564 place count 813 transition count 1767
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1569 place count 813 transition count 1762
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 14 with 2 rules applied. Total rules applied 1571 place count 812 transition count 1761
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1573 place count 812 transition count 1759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1575 place count 810 transition count 1759
Applied a total of 1575 rules in 1465 ms. Remains 810 /1626 variables (removed 816) and now considering 1759/2495 (removed 736) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1465 ms. Remains : 810/1626 places, 1759/2495 transitions.
RANDOM walk for 40000 steps (583 resets) in 1099 ms. (36 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 164614 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :8 out of 19
Probabilistic random walk after 164614 steps, saw 56081 distinct states, run finished after 3006 ms. (steps per millisecond=54 ) properties seen :8
// Phase 1: matrix 1759 rows 810 cols
[2024-06-01 05:47:24] [INFO ] Computed 124 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 65/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 375/468 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 74/542 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/543 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 230/773 variables, 51/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/773 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1/774 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/774 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 36/810 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/810 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 1759/2569 variables, 810/934 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2569 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/2569 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2569/2569 variables, and 934 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4025 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 810/810 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 65/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 375/468 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 74/542 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 05:47:29] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 25 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/543 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 230/773 variables, 51/117 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/773 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 1/774 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/774 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 36/810 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/810 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 18 (OVERLAPS) 1759/2569 variables, 810/935 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2569 variables, 2/937 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2569 variables, 0/937 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2569 variables, 0/937 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2569/2569 variables, and 937 constraints, problems are : Problem set: 9 solved, 2 unsolved in 15990 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 810/810 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 20095ms problems are : Problem set: 9 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1406 ms.
Support contains 3 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 1759/1759 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 810 transition count 1758
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 809 transition count 1758
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 806 transition count 1743
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 806 transition count 1743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 805 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 804 transition count 1734
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 804 transition count 1734
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 803 transition count 1726
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 803 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 802 transition count 1718
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 802 transition count 1718
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 801 transition count 1710
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 801 transition count 1710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 800 transition count 1702
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 800 transition count 1702
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 799 transition count 1694
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 799 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 798 transition count 1686
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 798 transition count 1686
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 797 transition count 1678
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 797 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 796 transition count 1670
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 796 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 795 transition count 1662
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 795 transition count 1662
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 789 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 787 transition count 1656
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 787 transition count 1656
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 787 transition count 1655
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 787 transition count 1654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 786 transition count 1654
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 48 place count 786 transition count 1653
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 786 transition count 1650
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 783 transition count 1650
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 59 place count 783 transition count 1650
Applied a total of 59 rules in 617 ms. Remains 783 /810 variables (removed 27) and now considering 1650/1759 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 617 ms. Remains : 783/810 places, 1650/1759 transitions.
RANDOM walk for 40000 steps (624 resets) in 390 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 233911 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 2
Probabilistic random walk after 233911 steps, saw 144759 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 1650 rows 783 cols
[2024-06-01 05:47:49] [INFO ] Computed 121 invariants in 45 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/116 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 288/404 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/419 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/420 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 227/647 variables, 31/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/647 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 17/664 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/664 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 95/759 variables, 16/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/759 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/781 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/781 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/783 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/783 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 1650/2433 variables, 783/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2433 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/2433 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2433/2433 variables, and 904 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1696 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/116 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 288/404 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/419 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/420 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 227/647 variables, 31/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/647 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 17/664 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/664 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 95/759 variables, 16/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/759 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/781 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/781 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/783 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/783 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1650/2433 variables, 783/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2433 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2433 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2433 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2433/2433 variables, and 906 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4515 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 6275ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 1292 ms.
Support contains 2 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 1650/1650 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 783 transition count 1649
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 782 transition count 1649
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 3 place count 782 transition count 1649
Applied a total of 3 rules in 118 ms. Remains 782 /783 variables (removed 1) and now considering 1649/1650 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 782/783 places, 1649/1650 transitions.
RANDOM walk for 40000 steps (622 resets) in 357 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (95 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 360997 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 360997 steps, saw 194492 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 1649 rows 782 cols
[2024-06-01 05:48:00] [INFO ] Computed 121 invariants in 32 ms
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) 66/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/72 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 150/222 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/229 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/230 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 103/333 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/337 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 83/420 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/424 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 78/502 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/502 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/503 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/503 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 92/595 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/595 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/596 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/596 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 94/690 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/690 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 26/716 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/716 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 66/782 variables, 13/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/782 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1649/2431 variables, 782/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2431 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/2431 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2431/2431 variables, and 903 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1779 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 782/782 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) 66/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/72 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 150/222 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/229 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/230 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 103/333 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/337 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 83/420 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/424 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 78/502 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/502 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/503 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/503 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 92/595 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/595 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/596 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/596 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 94/690 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/690 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 26/716 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/716 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 66/782 variables, 13/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/782 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1649/2431 variables, 782/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2431 variables, 1/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2431 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/2431 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2431/2431 variables, and 904 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6459 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 782/782 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 8283ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 370 ms.
Support contains 2 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 1649/1649 transitions.
Applied a total of 0 rules in 47 ms. Remains 782 /782 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 782/782 places, 1649/1649 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 1649/1649 transitions.
Applied a total of 0 rules in 47 ms. Remains 782 /782 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
[2024-06-01 05:48:09] [INFO ] Invariant cache hit.
[2024-06-01 05:48:11] [INFO ] Implicit Places using invariants in 1980 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 107, 182, 188, 191, 193, 194, 197, 202, 203, 255, 272, 278, 281, 283, 284, 289, 290, 342, 359, 365, 368, 370, 371, 376, 377, 429, 446, 452, 455, 457, 458, 463, 464, 516, 533, 539, 542, 544, 545, 550, 551, 603, 620, 626, 629, 631, 632, 637, 638, 690, 707, 713, 716, 718, 719]
[2024-06-01 05:48:11] [INFO ] Actually due to overlaps returned [197, 284, 371, 458, 545, 632, 719, 107, 88, 94, 99, 182, 188, 193, 272, 278, 283, 359, 365, 370, 446, 452, 457, 533, 539, 544, 620, 626, 631, 707, 713, 718, 71, 100, 255, 342, 429, 516, 603, 690]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1988 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 742/782 places, 1649/1649 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 742 transition count 1645
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 738 transition count 1644
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 737 transition count 1644
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 43 place count 704 transition count 1611
Iterating global reduction 3 with 33 rules applied. Total rules applied 76 place count 704 transition count 1611
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 84 place count 696 transition count 1603
Iterating global reduction 3 with 8 rules applied. Total rules applied 92 place count 696 transition count 1603
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 122 place count 681 transition count 1588
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 146 place count 681 transition count 1564
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 170 place count 657 transition count 1564
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 178 place count 657 transition count 1556
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 186 place count 649 transition count 1556
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 649 transition count 1556
Applied a total of 187 rules in 289 ms. Remains 649 /742 variables (removed 93) and now considering 1556/1649 (removed 93) transitions.
// Phase 1: matrix 1556 rows 649 cols
[2024-06-01 05:48:11] [INFO ] Computed 81 invariants in 28 ms
[2024-06-01 05:48:12] [INFO ] Implicit Places using invariants in 1267 ms returned [88, 89, 158, 165, 166, 236, 237, 307, 308, 378, 379, 449, 450, 520, 521]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1270 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 634/782 places, 1556/1649 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 634 transition count 1555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 633 transition count 1555
Applied a total of 2 rules in 46 ms. Remains 633 /634 variables (removed 1) and now considering 1555/1556 (removed 1) transitions.
// Phase 1: matrix 1555 rows 633 cols
[2024-06-01 05:48:13] [INFO ] Computed 66 invariants in 26 ms
[2024-06-01 05:48:14] [INFO ] Implicit Places using invariants in 1350 ms returned []
[2024-06-01 05:48:14] [INFO ] Invariant cache hit.
[2024-06-01 05:48:17] [INFO ] Implicit Places using invariants and state equation in 2785 ms returned []
Implicit Place search using SMT with State Equation took 4137 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 633/782 places, 1555/1649 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7777 ms. Remains : 633/782 places, 1555/1649 transitions.
RANDOM walk for 40000 steps (706 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (117 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 236079 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 236079 steps, saw 150850 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 05:48:20] [INFO ] Invariant cache hit.
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) 126/128 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/135 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 176/311 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/313 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 134/447 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/451 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 99/550 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/598 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/633 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2188 variables, 633/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2188 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/2188 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2188/2188 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 633/633 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) 126/128 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/135 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 176/311 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/313 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 134/447 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/451 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 99/550 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/598 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/633 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2188 variables, 633/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2188 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2188 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2188 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2188/2188 variables, and 700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4732 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5791ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1555/1555 transitions.
Applied a total of 0 rules in 38 ms. Remains 633 /633 variables (removed 0) and now considering 1555/1555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 633/633 places, 1555/1555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1555/1555 transitions.
Applied a total of 0 rules in 40 ms. Remains 633 /633 variables (removed 0) and now considering 1555/1555 (removed 0) transitions.
[2024-06-01 05:48:26] [INFO ] Invariant cache hit.
[2024-06-01 05:48:27] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2024-06-01 05:48:27] [INFO ] Invariant cache hit.
[2024-06-01 05:48:29] [INFO ] Implicit Places using invariants and state equation in 2471 ms returned []
Implicit Place search using SMT with State Equation took 3657 ms to find 0 implicit places.
[2024-06-01 05:48:29] [INFO ] Redundant transitions in 150 ms returned []
Running 1517 sub problems to find dead transitions.
[2024-06-01 05:48:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 1517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/2188 variables, and 62 constraints, problems are : Problem set: 0 solved, 1517 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 52/53 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 1517/1517 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 1517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/2188 variables, and 62 constraints, problems are : Problem set: 0 solved, 1517 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 52/53 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 0/1517 constraints, Known Traps: 0/0 constraints]
After SMT, in 61729ms problems are : Problem set: 0 solved, 1517 unsolved
Search for dead transitions found 0 dead transitions in 61756ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65617 ms. Remains : 633/633 places, 1555/1555 transitions.
FORMULA ASLink-PT-08a-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA ASLink-PT-08a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-08a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 3 out of 1626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 314 place count 1625 transition count 2180
Reduce places removed 322 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 329 rules applied. Total rules applied 643 place count 1303 transition count 2173
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 650 place count 1296 transition count 2173
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 650 place count 1296 transition count 1941
Deduced a syphon composed of 232 places in 3 ms
Ensure Unique test removed 69 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 3 with 533 rules applied. Total rules applied 1183 place count 995 transition count 1941
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 3 with 45 rules applied. Total rules applied 1228 place count 975 transition count 1916
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 1253 place count 950 transition count 1916
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 1253 place count 950 transition count 1883
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 1319 place count 917 transition count 1883
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1334 place count 902 transition count 1856
Iterating global reduction 5 with 15 rules applied. Total rules applied 1349 place count 902 transition count 1856
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 12 rules applied. Total rules applied 1361 place count 901 transition count 1845
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1361 place count 901 transition count 1844
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1363 place count 900 transition count 1844
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1365 place count 898 transition count 1835
Iterating global reduction 6 with 2 rules applied. Total rules applied 1367 place count 898 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1368 place count 897 transition count 1827
Iterating global reduction 6 with 1 rules applied. Total rules applied 1369 place count 897 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1370 place count 896 transition count 1819
Iterating global reduction 6 with 1 rules applied. Total rules applied 1371 place count 896 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1372 place count 895 transition count 1811
Iterating global reduction 6 with 1 rules applied. Total rules applied 1373 place count 895 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1374 place count 894 transition count 1803
Iterating global reduction 6 with 1 rules applied. Total rules applied 1375 place count 894 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1376 place count 893 transition count 1795
Iterating global reduction 6 with 1 rules applied. Total rules applied 1377 place count 893 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1378 place count 892 transition count 1787
Iterating global reduction 6 with 1 rules applied. Total rules applied 1379 place count 892 transition count 1787
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1380 place count 891 transition count 1779
Iterating global reduction 6 with 1 rules applied. Total rules applied 1381 place count 891 transition count 1779
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1382 place count 890 transition count 1771
Iterating global reduction 6 with 1 rules applied. Total rules applied 1383 place count 890 transition count 1771
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1384 place count 889 transition count 1763
Iterating global reduction 6 with 1 rules applied. Total rules applied 1385 place count 889 transition count 1763
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 6 with 161 rules applied. Total rules applied 1546 place count 808 transition count 1683
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1548 place count 806 transition count 1681
Iterating global reduction 6 with 2 rules applied. Total rules applied 1550 place count 806 transition count 1681
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1550 place count 806 transition count 1680
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1552 place count 805 transition count 1680
Applied a total of 1552 rules in 808 ms. Remains 805 /1626 variables (removed 821) and now considering 1680/2495 (removed 815) transitions.
// Phase 1: matrix 1680 rows 805 cols
[2024-06-01 05:49:33] [INFO ] Computed 120 invariants in 30 ms
[2024-06-01 05:49:34] [INFO ] Implicit Places using invariants in 1181 ms returned [72, 89, 95, 100, 108, 161, 182, 188, 193, 195, 255, 272, 278, 283, 285, 345, 362, 368, 373, 375, 435, 452, 458, 463, 465, 525, 542, 548, 553, 555, 615, 632, 638, 643, 645, 705, 722, 728, 733, 735, 802]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1185 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 764/1626 places, 1680/2495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 764 transition count 1675
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 759 transition count 1675
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 743 transition count 1659
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 743 transition count 1659
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 58 place count 727 transition count 1643
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 727 transition count 1643
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 719 transition count 1635
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 719 transition count 1635
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 124 place count 702 transition count 1618
Applied a total of 124 rules in 120 ms. Remains 702 /764 variables (removed 62) and now considering 1618/1680 (removed 62) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2024-06-01 05:49:34] [INFO ] Computed 79 invariants in 28 ms
[2024-06-01 05:49:35] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2024-06-01 05:49:35] [INFO ] Invariant cache hit.
[2024-06-01 05:49:38] [INFO ] Implicit Places using invariants and state equation in 2774 ms returned []
Implicit Place search using SMT with State Equation took 4037 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 702/1626 places, 1618/2495 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6152 ms. Remains : 702/1626 places, 1618/2495 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-00
Stuttering criterion allowed to conclude after 321 steps with 0 reset in 11 ms.
FORMULA ASLink-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-00 finished in 6626 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((p0||X(F((p0&&F(!p0))))))))'
Support contains 1 out of 1626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1622 transition count 2479
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1622 transition count 2479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1619 transition count 2469
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1619 transition count 2469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1617 transition count 2460
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1617 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1615 transition count 2451
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1615 transition count 2451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1613 transition count 2442
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1613 transition count 2442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1611 transition count 2433
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1611 transition count 2433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1609 transition count 2424
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1609 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1608 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1608 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1607 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1607 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1606 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1606 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1605 transition count 2392
Applied a total of 42 rules in 968 ms. Remains 1605 /1626 variables (removed 21) and now considering 2392/2495 (removed 103) transitions.
// Phase 1: matrix 2392 rows 1605 cols
[2024-06-01 05:49:39] [INFO ] Computed 219 invariants in 43 ms
[2024-06-01 05:49:40] [INFO ] Implicit Places using invariants in 1225 ms returned [210, 1496]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1227 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1626 places, 2392/2495 transitions.
Applied a total of 0 rules in 63 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2259 ms. Remains : 1603/1626 places, 2392/2495 transitions.
Stuttering acceptance computed with spot in 202 ms :[p0, (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-03
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 9 ms.
FORMULA ASLink-PT-08a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-03 finished in 2495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 4 out of 1626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1623 transition count 2480
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1623 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1621 transition count 2471
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1621 transition count 2471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1619 transition count 2462
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1619 transition count 2462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1617 transition count 2453
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1617 transition count 2453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1615 transition count 2444
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1615 transition count 2444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1613 transition count 2435
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1613 transition count 2435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1611 transition count 2426
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1611 transition count 2426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1610 transition count 2418
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1610 transition count 2418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1609 transition count 2410
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1609 transition count 2410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1608 transition count 2402
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1608 transition count 2402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1607 transition count 2394
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1607 transition count 2394
Applied a total of 38 rules in 952 ms. Remains 1607 /1626 variables (removed 19) and now considering 2394/2495 (removed 101) transitions.
// Phase 1: matrix 2394 rows 1607 cols
[2024-06-01 05:49:42] [INFO ] Computed 219 invariants in 32 ms
[2024-06-01 05:49:44] [INFO ] Implicit Places using invariants in 2261 ms returned [210]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2268 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1606/1626 places, 2394/2495 transitions.
Applied a total of 0 rules in 100 ms. Remains 1606 /1606 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3323 ms. Remains : 1606/1626 places, 2394/2495 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 1944 ms.
Product exploration explored 100000 steps with 50000 reset in 1715 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-08a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08a-LTLFireability-04 finished in 7358 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(p1)||p0)))'
Support contains 3 out of 1626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1622 transition count 2479
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1622 transition count 2479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1619 transition count 2469
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1619 transition count 2469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1617 transition count 2460
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1617 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1615 transition count 2451
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1615 transition count 2451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1613 transition count 2442
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1613 transition count 2442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1611 transition count 2433
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1611 transition count 2433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1609 transition count 2424
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1609 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1608 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1608 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1607 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1607 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1606 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1606 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1605 transition count 2392
Applied a total of 42 rules in 1005 ms. Remains 1605 /1626 variables (removed 21) and now considering 2392/2495 (removed 103) transitions.
// Phase 1: matrix 2392 rows 1605 cols
[2024-06-01 05:49:49] [INFO ] Computed 219 invariants in 45 ms
[2024-06-01 05:49:51] [INFO ] Implicit Places using invariants in 1854 ms returned [210, 1496]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1856 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1626 places, 2392/2495 transitions.
Applied a total of 0 rules in 103 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2966 ms. Remains : 1603/1626 places, 2392/2495 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 1127 ms.
Product exploration explored 100000 steps with 50000 reset in 1333 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-08a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08a-LTLFireability-06 finished in 5661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 1626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 1625 transition count 2178
Reduce places removed 324 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 331 rules applied. Total rules applied 647 place count 1301 transition count 2171
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 654 place count 1294 transition count 2171
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 654 place count 1294 transition count 1939
Deduced a syphon composed of 232 places in 4 ms
Ensure Unique test removed 69 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 3 with 533 rules applied. Total rules applied 1187 place count 993 transition count 1939
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 3 with 45 rules applied. Total rules applied 1232 place count 973 transition count 1914
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 1257 place count 948 transition count 1914
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 1257 place count 948 transition count 1881
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 1323 place count 915 transition count 1881
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1339 place count 899 transition count 1853
Iterating global reduction 5 with 16 rules applied. Total rules applied 1355 place count 899 transition count 1853
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 13 rules applied. Total rules applied 1368 place count 898 transition count 1841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1369 place count 897 transition count 1841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1369 place count 897 transition count 1840
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1371 place count 896 transition count 1840
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1373 place count 894 transition count 1831
Iterating global reduction 7 with 2 rules applied. Total rules applied 1375 place count 894 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1376 place count 893 transition count 1823
Iterating global reduction 7 with 1 rules applied. Total rules applied 1377 place count 893 transition count 1823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1378 place count 892 transition count 1815
Iterating global reduction 7 with 1 rules applied. Total rules applied 1379 place count 892 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1380 place count 891 transition count 1807
Iterating global reduction 7 with 1 rules applied. Total rules applied 1381 place count 891 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1382 place count 890 transition count 1799
Iterating global reduction 7 with 1 rules applied. Total rules applied 1383 place count 890 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1384 place count 889 transition count 1791
Iterating global reduction 7 with 1 rules applied. Total rules applied 1385 place count 889 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1386 place count 888 transition count 1783
Iterating global reduction 7 with 1 rules applied. Total rules applied 1387 place count 888 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1388 place count 887 transition count 1775
Iterating global reduction 7 with 1 rules applied. Total rules applied 1389 place count 887 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1390 place count 886 transition count 1767
Iterating global reduction 7 with 1 rules applied. Total rules applied 1391 place count 886 transition count 1767
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1392 place count 885 transition count 1759
Iterating global reduction 7 with 1 rules applied. Total rules applied 1393 place count 885 transition count 1759
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 7 with 159 rules applied. Total rules applied 1552 place count 805 transition count 1680
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1555 place count 802 transition count 1677
Iterating global reduction 7 with 3 rules applied. Total rules applied 1558 place count 802 transition count 1677
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1558 place count 802 transition count 1676
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 1560 place count 801 transition count 1676
Applied a total of 1560 rules in 647 ms. Remains 801 /1626 variables (removed 825) and now considering 1676/2495 (removed 819) transitions.
// Phase 1: matrix 1676 rows 801 cols
[2024-06-01 05:49:54] [INFO ] Computed 120 invariants in 35 ms
[2024-06-01 05:49:56] [INFO ] Implicit Places using invariants in 1549 ms returned [72, 89, 95, 100, 108, 161, 182, 188, 193, 195, 255, 272, 278, 283, 285, 345, 362, 368, 373, 375, 435, 452, 458, 463, 465, 525, 542, 548, 553, 555, 615, 632, 638, 643, 645, 705, 722, 728, 733, 735, 798]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1553 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/1626 places, 1676/2495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 760 transition count 1671
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 755 transition count 1671
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 739 transition count 1655
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 739 transition count 1655
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 58 place count 723 transition count 1639
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 723 transition count 1639
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 715 transition count 1631
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 715 transition count 1631
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 124 place count 698 transition count 1614
Applied a total of 124 rules in 196 ms. Remains 698 /760 variables (removed 62) and now considering 1614/1676 (removed 62) transitions.
// Phase 1: matrix 1614 rows 698 cols
[2024-06-01 05:49:56] [INFO ] Computed 79 invariants in 27 ms
[2024-06-01 05:49:57] [INFO ] Implicit Places using invariants in 1347 ms returned []
[2024-06-01 05:49:57] [INFO ] Invariant cache hit.
[2024-06-01 05:50:01] [INFO ] Implicit Places using invariants and state equation in 3452 ms returned []
Implicit Place search using SMT with State Equation took 4807 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 698/1626 places, 1614/2495 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7203 ms. Remains : 698/1626 places, 1614/2495 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-07
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-07 finished in 7342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 1625 transition count 2178
Reduce places removed 324 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 331 rules applied. Total rules applied 647 place count 1301 transition count 2171
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 654 place count 1294 transition count 2171
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 654 place count 1294 transition count 1939
Deduced a syphon composed of 232 places in 4 ms
Ensure Unique test removed 69 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 3 with 533 rules applied. Total rules applied 1187 place count 993 transition count 1939
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 3 with 45 rules applied. Total rules applied 1232 place count 973 transition count 1914
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 1257 place count 948 transition count 1914
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 1257 place count 948 transition count 1881
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 1323 place count 915 transition count 1881
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1339 place count 899 transition count 1853
Iterating global reduction 5 with 16 rules applied. Total rules applied 1355 place count 899 transition count 1853
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 13 rules applied. Total rules applied 1368 place count 898 transition count 1841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1369 place count 897 transition count 1841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1369 place count 897 transition count 1840
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1371 place count 896 transition count 1840
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1373 place count 894 transition count 1831
Iterating global reduction 7 with 2 rules applied. Total rules applied 1375 place count 894 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1376 place count 893 transition count 1823
Iterating global reduction 7 with 1 rules applied. Total rules applied 1377 place count 893 transition count 1823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1378 place count 892 transition count 1815
Iterating global reduction 7 with 1 rules applied. Total rules applied 1379 place count 892 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1380 place count 891 transition count 1807
Iterating global reduction 7 with 1 rules applied. Total rules applied 1381 place count 891 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1382 place count 890 transition count 1799
Iterating global reduction 7 with 1 rules applied. Total rules applied 1383 place count 890 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1384 place count 889 transition count 1791
Iterating global reduction 7 with 1 rules applied. Total rules applied 1385 place count 889 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1386 place count 888 transition count 1783
Iterating global reduction 7 with 1 rules applied. Total rules applied 1387 place count 888 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1388 place count 887 transition count 1775
Iterating global reduction 7 with 1 rules applied. Total rules applied 1389 place count 887 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1390 place count 886 transition count 1767
Iterating global reduction 7 with 1 rules applied. Total rules applied 1391 place count 886 transition count 1767
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1392 place count 885 transition count 1759
Iterating global reduction 7 with 1 rules applied. Total rules applied 1393 place count 885 transition count 1759
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 7 with 159 rules applied. Total rules applied 1552 place count 805 transition count 1680
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1555 place count 802 transition count 1677
Iterating global reduction 7 with 3 rules applied. Total rules applied 1558 place count 802 transition count 1677
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1558 place count 802 transition count 1676
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1560 place count 801 transition count 1676
Applied a total of 1560 rules in 677 ms. Remains 801 /1626 variables (removed 825) and now considering 1676/2495 (removed 819) transitions.
// Phase 1: matrix 1676 rows 801 cols
[2024-06-01 05:50:02] [INFO ] Computed 120 invariants in 29 ms
[2024-06-01 05:50:03] [INFO ] Implicit Places using invariants in 1700 ms returned [72, 89, 95, 100, 108, 161, 182, 188, 193, 195, 255, 272, 278, 283, 285, 345, 362, 368, 373, 375, 435, 452, 458, 463, 465, 525, 542, 548, 553, 555, 615, 632, 638, 643, 645, 705, 722, 728, 733, 735, 798]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1707 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/1626 places, 1676/2495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 760 transition count 1671
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 755 transition count 1671
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 739 transition count 1655
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 739 transition count 1655
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 58 place count 723 transition count 1639
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 723 transition count 1639
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 715 transition count 1631
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 715 transition count 1631
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 124 place count 698 transition count 1614
Applied a total of 124 rules in 179 ms. Remains 698 /760 variables (removed 62) and now considering 1614/1676 (removed 62) transitions.
// Phase 1: matrix 1614 rows 698 cols
[2024-06-01 05:50:04] [INFO ] Computed 79 invariants in 27 ms
[2024-06-01 05:50:05] [INFO ] Implicit Places using invariants in 1326 ms returned []
[2024-06-01 05:50:05] [INFO ] Invariant cache hit.
[2024-06-01 05:50:08] [INFO ] Implicit Places using invariants and state equation in 3528 ms returned []
Implicit Place search using SMT with State Equation took 4857 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 698/1626 places, 1614/2495 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7422 ms. Remains : 698/1626 places, 1614/2495 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-09
Product exploration explored 100000 steps with 1269 reset in 543 ms.
Product exploration explored 100000 steps with 1284 reset in 526 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
RANDOM walk for 40000 steps (518 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (83 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4674 steps, run visited all 1 properties in 28 ms. (steps per millisecond=166 )
Probabilistic random walk after 4674 steps, saw 4531 distinct states, run finished after 36 ms. (steps per millisecond=129 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 698/698 places, 1614/1614 transitions.
Applied a total of 0 rules in 41 ms. Remains 698 /698 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-06-01 05:50:10] [INFO ] Invariant cache hit.
[2024-06-01 05:50:12] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2024-06-01 05:50:12] [INFO ] Invariant cache hit.
[2024-06-01 05:50:15] [INFO ] Implicit Places using invariants and state equation in 3480 ms returned []
Implicit Place search using SMT with State Equation took 4733 ms to find 0 implicit places.
[2024-06-01 05:50:15] [INFO ] Redundant transitions in 313 ms returned []
Running 1568 sub problems to find dead transitions.
[2024-06-01 05:50:15] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1568 unsolved
SMT process timed out in 31256ms, After SMT, problems are : Problem set: 0 solved, 1568 unsolved
Search for dead transitions found 0 dead transitions in 31290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36395 ms. Remains : 698/698 places, 1614/1614 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 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
RANDOM walk for 40000 steps (512 resets) in 562 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4674 steps, run visited all 1 properties in 30 ms. (steps per millisecond=155 )
Probabilistic random walk after 4674 steps, saw 4531 distinct states, run finished after 31 ms. (steps per millisecond=150 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1285 reset in 464 ms.
Product exploration explored 100000 steps with 1271 reset in 594 ms.
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 698/698 places, 1614/1614 transitions.
Applied a total of 0 rules in 45 ms. Remains 698 /698 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-06-01 05:50:49] [INFO ] Invariant cache hit.
[2024-06-01 05:50:50] [INFO ] Implicit Places using invariants in 1496 ms returned []
[2024-06-01 05:50:50] [INFO ] Invariant cache hit.
[2024-06-01 05:50:53] [INFO ] Implicit Places using invariants and state equation in 3310 ms returned []
Implicit Place search using SMT with State Equation took 4836 ms to find 0 implicit places.
[2024-06-01 05:50:54] [INFO ] Redundant transitions in 57 ms returned []
Running 1568 sub problems to find dead transitions.
[2024-06-01 05:50:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1568 unsolved
SMT process timed out in 31500ms, After SMT, problems are : Problem set: 0 solved, 1568 unsolved
Search for dead transitions found 0 dead transitions in 31539ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36505 ms. Remains : 698/698 places, 1614/1614 transitions.
Treatment of property ASLink-PT-08a-LTLFireability-09 finished in 84476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1622 transition count 2479
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1622 transition count 2479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1619 transition count 2469
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1619 transition count 2469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1617 transition count 2460
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1617 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1615 transition count 2451
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1615 transition count 2451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1613 transition count 2442
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1613 transition count 2442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1611 transition count 2433
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1611 transition count 2433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1609 transition count 2424
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1609 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1608 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1608 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1607 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1607 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1606 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1606 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1605 transition count 2392
Applied a total of 42 rules in 1005 ms. Remains 1605 /1626 variables (removed 21) and now considering 2392/2495 (removed 103) transitions.
// Phase 1: matrix 2392 rows 1605 cols
[2024-06-01 05:51:27] [INFO ] Computed 219 invariants in 41 ms
[2024-06-01 05:51:28] [INFO ] Implicit Places using invariants in 1849 ms returned [210, 1496]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1853 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1626 places, 2392/2495 transitions.
Applied a total of 0 rules in 100 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2960 ms. Remains : 1603/1626 places, 2392/2495 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-10
Stuttering criterion allowed to conclude after 209 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-08a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-10 finished in 3154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 1625 transition count 2178
Reduce places removed 324 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 331 rules applied. Total rules applied 647 place count 1301 transition count 2171
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 654 place count 1294 transition count 2171
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 654 place count 1294 transition count 1939
Deduced a syphon composed of 232 places in 3 ms
Ensure Unique test removed 69 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 3 with 533 rules applied. Total rules applied 1187 place count 993 transition count 1939
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 44 rules applied. Total rules applied 1231 place count 973 transition count 1915
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 25 rules applied. Total rules applied 1256 place count 949 transition count 1914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1257 place count 948 transition count 1914
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 1257 place count 948 transition count 1881
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 1323 place count 915 transition count 1881
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1338 place count 900 transition count 1854
Iterating global reduction 6 with 15 rules applied. Total rules applied 1353 place count 900 transition count 1854
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 12 rules applied. Total rules applied 1365 place count 899 transition count 1843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1366 place count 898 transition count 1843
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1366 place count 898 transition count 1842
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1368 place count 897 transition count 1842
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1370 place count 895 transition count 1833
Iterating global reduction 8 with 2 rules applied. Total rules applied 1372 place count 895 transition count 1833
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1373 place count 894 transition count 1825
Iterating global reduction 8 with 1 rules applied. Total rules applied 1374 place count 894 transition count 1825
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1375 place count 893 transition count 1817
Iterating global reduction 8 with 1 rules applied. Total rules applied 1376 place count 893 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1377 place count 892 transition count 1809
Iterating global reduction 8 with 1 rules applied. Total rules applied 1378 place count 892 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1379 place count 891 transition count 1801
Iterating global reduction 8 with 1 rules applied. Total rules applied 1380 place count 891 transition count 1801
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1381 place count 890 transition count 1793
Iterating global reduction 8 with 1 rules applied. Total rules applied 1382 place count 890 transition count 1793
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1383 place count 889 transition count 1785
Iterating global reduction 8 with 1 rules applied. Total rules applied 1384 place count 889 transition count 1785
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1385 place count 888 transition count 1777
Iterating global reduction 8 with 1 rules applied. Total rules applied 1386 place count 888 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1387 place count 887 transition count 1769
Iterating global reduction 8 with 1 rules applied. Total rules applied 1388 place count 887 transition count 1769
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1389 place count 886 transition count 1761
Iterating global reduction 8 with 1 rules applied. Total rules applied 1390 place count 886 transition count 1761
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 8 with 157 rules applied. Total rules applied 1547 place count 807 transition count 1683
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1550 place count 804 transition count 1680
Iterating global reduction 8 with 3 rules applied. Total rules applied 1553 place count 804 transition count 1680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1553 place count 804 transition count 1679
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1555 place count 803 transition count 1679
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 1557 place count 803 transition count 1679
Applied a total of 1557 rules in 691 ms. Remains 803 /1626 variables (removed 823) and now considering 1679/2495 (removed 816) transitions.
// Phase 1: matrix 1679 rows 803 cols
[2024-06-01 05:51:29] [INFO ] Computed 120 invariants in 18 ms
[2024-06-01 05:51:31] [INFO ] Implicit Places using invariants in 1445 ms returned [72, 89, 95, 100, 108, 183, 189, 194, 197, 257, 274, 280, 285, 287, 347, 364, 370, 375, 377, 437, 454, 460, 465, 467, 527, 544, 550, 555, 557, 617, 634, 640, 645, 647, 707, 724, 730, 735, 737, 800]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1449 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/1626 places, 1679/2495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 763 transition count 1674
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 758 transition count 1674
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 742 transition count 1658
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 742 transition count 1658
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 58 place count 726 transition count 1642
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 726 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 718 transition count 1634
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 718 transition count 1634
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 122 place count 702 transition count 1618
Applied a total of 122 rules in 180 ms. Remains 702 /763 variables (removed 61) and now considering 1618/1679 (removed 61) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2024-06-01 05:51:31] [INFO ] Computed 80 invariants in 27 ms
[2024-06-01 05:51:32] [INFO ] Implicit Places using invariants in 1400 ms returned []
[2024-06-01 05:51:32] [INFO ] Invariant cache hit.
[2024-06-01 05:51:35] [INFO ] Implicit Places using invariants and state equation in 2776 ms returned []
Implicit Place search using SMT with State Equation took 4179 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 702/1626 places, 1618/2495 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6501 ms. Remains : 702/1626 places, 1618/2495 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-13
Product exploration explored 100000 steps with 1315 reset in 390 ms.
Product exploration explored 100000 steps with 1261 reset in 510 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (504 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (81 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 213719 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 213719 steps, saw 139236 distinct states, run finished after 3007 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 05:51:40] [INFO ] Invariant cache hit.
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) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/702 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1618/2320 variables, 702/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2320 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/2320 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2320/2320 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1519 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 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) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/702 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2320/2320 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1637 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3178ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 702 transition count 1586
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 670 transition count 1578
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 670 transition count 1555
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 647 transition count 1555
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 119 place count 647 transition count 1555
Applied a total of 119 rules in 174 ms. Remains 647 /702 variables (removed 55) and now considering 1555/1618 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 647/702 places, 1555/1618 transitions.
RANDOM walk for 40000 steps (647 resets) in 337 ms. (118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (114 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 188700 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 188700 steps, saw 107616 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 1555 rows 647 cols
[2024-06-01 05:51:46] [INFO ] Computed 80 invariants in 25 ms
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) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2202/2202 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 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) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2202/2202 variables, and 728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4263 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5697ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6467 steps, including 973 resets, run visited all 1 properties in 25 ms. (steps per millisecond=258 )
Parikh walk visited 1 properties in 36 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Applied a total of 0 rules in 24 ms. Remains 702 /702 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2024-06-01 05:51:52] [INFO ] Computed 80 invariants in 26 ms
[2024-06-01 05:51:53] [INFO ] Implicit Places using invariants in 1210 ms returned []
[2024-06-01 05:51:53] [INFO ] Invariant cache hit.
[2024-06-01 05:51:57] [INFO ] Implicit Places using invariants and state equation in 3207 ms returned []
Implicit Place search using SMT with State Equation took 4420 ms to find 0 implicit places.
[2024-06-01 05:51:57] [INFO ] Redundant transitions in 82 ms returned []
Running 1572 sub problems to find dead transitions.
[2024-06-01 05:51:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/2320 variables, and 74 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 64/67 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/2320 variables, and 74 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 64/67 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints]
After SMT, in 61467ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 61501ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66042 ms. Remains : 702/702 places, 1618/1618 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 119 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 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (522 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (81 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 219838 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 219838 steps, saw 141276 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-06-01 05:53:02] [INFO ] Invariant cache hit.
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) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/702 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1618/2320 variables, 702/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2320 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/2320 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2320/2320 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1430 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 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) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/702 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2320/2320 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1654 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3101ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 702 transition count 1586
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 670 transition count 1578
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 670 transition count 1555
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 647 transition count 1555
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 119 place count 647 transition count 1555
Applied a total of 119 rules in 100 ms. Remains 647 /702 variables (removed 55) and now considering 1555/1618 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 647/702 places, 1555/1618 transitions.
RANDOM walk for 40000 steps (726 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (117 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 209031 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 209031 steps, saw 115830 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 1555 rows 647 cols
[2024-06-01 05:53:08] [INFO ] Computed 80 invariants in 24 ms
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) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2202/2202 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1319 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 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) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2202/2202 variables, and 728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3857 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 5209ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7335 steps, including 985 resets, run visited all 1 properties in 34 ms. (steps per millisecond=215 )
Parikh walk visited 1 properties in 35 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 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 143 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1301 reset in 427 ms.
Product exploration explored 100000 steps with 1267 reset in 466 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Applied a total of 0 rules in 38 ms. Remains 702 /702 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2024-06-01 05:53:15] [INFO ] Computed 80 invariants in 23 ms
[2024-06-01 05:53:16] [INFO ] Implicit Places using invariants in 1030 ms returned []
[2024-06-01 05:53:16] [INFO ] Invariant cache hit.
[2024-06-01 05:53:19] [INFO ] Implicit Places using invariants and state equation in 2925 ms returned []
Implicit Place search using SMT with State Equation took 3981 ms to find 0 implicit places.
[2024-06-01 05:53:19] [INFO ] Redundant transitions in 82 ms returned []
Running 1572 sub problems to find dead transitions.
[2024-06-01 05:53:19] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
SMT process timed out in 31682ms, After SMT, problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 31717ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35831 ms. Remains : 702/702 places, 1618/1618 transitions.
Treatment of property ASLink-PT-08a-LTLFireability-13 finished in 142000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 1 out of 1626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1626/1626 places, 2495/2495 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1622 transition count 2479
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1622 transition count 2479
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 1619 transition count 2469
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 1619 transition count 2469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1617 transition count 2460
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1617 transition count 2460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1615 transition count 2451
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1615 transition count 2451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1613 transition count 2442
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1613 transition count 2442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1611 transition count 2433
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1611 transition count 2433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1609 transition count 2424
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1609 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1608 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1608 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1607 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1607 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1606 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1606 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1605 transition count 2392
Applied a total of 42 rules in 1126 ms. Remains 1605 /1626 variables (removed 21) and now considering 2392/2495 (removed 103) transitions.
// Phase 1: matrix 2392 rows 1605 cols
[2024-06-01 05:53:52] [INFO ] Computed 219 invariants in 40 ms
[2024-06-01 05:53:54] [INFO ] Implicit Places using invariants in 2204 ms returned [210, 1496]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2215 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1626 places, 2392/2495 transitions.
Applied a total of 0 rules in 99 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3443 ms. Remains : 1603/1626 places, 2392/2495 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-15 finished in 3738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 05:53:55] [INFO ] Flatten gal took : 190 ms
[2024-06-01 05:53:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 05:53:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1626 places, 2495 transitions and 8719 arcs took 40 ms.
Total runtime 425107 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-08a"
export BK_EXAMINATION="LTLFireability"
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-08a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117900124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08a.tgz
mv ASLink-PT-08a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;