MCC'2024- Execution of r536-tall-171690531800179

About the Execution of LTSMin+red for StigmergyCommit-PT-07b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15031.000	3600000.00	9234230.00	3851.30	T?FFF?TFFTTTFTFT	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.r536-tall-171690531800179.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 StigmergyCommit-PT-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531800179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 11 17:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 12M May 18 16:43 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 StigmergyCommit-PT-07b-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717232635218

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:03:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:03:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:03:57] [INFO ] Load time of PNML (sax parser for PT used): 707 ms
[2024-06-01 09:03:57] [INFO ] Transformed 2443 places.
[2024-06-01 09:03:57] [INFO ] Transformed 15956 transitions.
[2024-06-01 09:03:57] [INFO ] Found NUPN structural information;
[2024-06-01 09:03:57] [INFO ] Parsed PT model containing 2443 places and 15956 transitions and 219500 arcs in 909 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyCommit-PT-07b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 2443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2443/2443 places, 15956/15956 transitions.
Discarding 193 places :
Symmetric choice reduction at 0 with 193 rule applications. Total rules 193 place count 2250 transition count 15763
Iterating global reduction 0 with 193 rules applied. Total rules applied 386 place count 2250 transition count 15763
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 505 place count 2131 transition count 15644
Iterating global reduction 0 with 119 rules applied. Total rules applied 624 place count 2131 transition count 15644
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 696 place count 2059 transition count 15572
Iterating global reduction 0 with 72 rules applied. Total rules applied 768 place count 2059 transition count 15572
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 831 place count 1996 transition count 15509
Iterating global reduction 0 with 63 rules applied. Total rules applied 894 place count 1996 transition count 15509
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 949 place count 1941 transition count 15454
Iterating global reduction 0 with 55 rules applied. Total rules applied 1004 place count 1941 transition count 15454
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 1058 place count 1887 transition count 15400
Iterating global reduction 0 with 54 rules applied. Total rules applied 1112 place count 1887 transition count 15400
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 1165 place count 1834 transition count 15347
Iterating global reduction 0 with 53 rules applied. Total rules applied 1218 place count 1834 transition count 15347
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 1270 place count 1782 transition count 15295
Iterating global reduction 0 with 52 rules applied. Total rules applied 1322 place count 1782 transition count 15295
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 1366 place count 1738 transition count 15251
Iterating global reduction 0 with 44 rules applied. Total rules applied 1410 place count 1738 transition count 15251
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 1444 place count 1704 transition count 15217
Iterating global reduction 0 with 34 rules applied. Total rules applied 1478 place count 1704 transition count 15217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 1483 place count 1704 transition count 15212
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 1496 place count 1691 transition count 15199
Iterating global reduction 1 with 13 rules applied. Total rules applied 1509 place count 1691 transition count 15199
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 1522 place count 1678 transition count 15186
Iterating global reduction 1 with 13 rules applied. Total rules applied 1535 place count 1678 transition count 15186
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1541 place count 1672 transition count 15180
Iterating global reduction 1 with 6 rules applied. Total rules applied 1547 place count 1672 transition count 15180
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1553 place count 1666 transition count 15174
Iterating global reduction 1 with 6 rules applied. Total rules applied 1559 place count 1666 transition count 15174
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1565 place count 1660 transition count 15168
Iterating global reduction 1 with 6 rules applied. Total rules applied 1571 place count 1660 transition count 15168
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1577 place count 1654 transition count 15162
Iterating global reduction 1 with 6 rules applied. Total rules applied 1583 place count 1654 transition count 15162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1589 place count 1648 transition count 15156
Iterating global reduction 1 with 6 rules applied. Total rules applied 1595 place count 1648 transition count 15156
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1601 place count 1642 transition count 15150
Iterating global reduction 1 with 6 rules applied. Total rules applied 1607 place count 1642 transition count 15150
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1613 place count 1636 transition count 15144
Iterating global reduction 1 with 6 rules applied. Total rules applied 1619 place count 1636 transition count 15144
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1625 place count 1630 transition count 15138
Iterating global reduction 1 with 6 rules applied. Total rules applied 1631 place count 1630 transition count 15138
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1637 place count 1624 transition count 15132
Iterating global reduction 1 with 6 rules applied. Total rules applied 1643 place count 1624 transition count 15132
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1649 place count 1618 transition count 15126
Iterating global reduction 1 with 6 rules applied. Total rules applied 1655 place count 1618 transition count 15126
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 1661 place count 1618 transition count 15120
Applied a total of 1661 rules in 4533 ms. Remains 1618 /2443 variables (removed 825) and now considering 15120/15956 (removed 836) transitions.
// Phase 1: matrix 15120 rows 1618 cols
[2024-06-01 09:04:02] [INFO ] Computed 9 invariants in 319 ms
[2024-06-01 09:04:06] [INFO ] Implicit Places using invariants in 4688 ms returned []
Implicit Place search using SMT only with invariants took 4723 ms to find 0 implicit places.
Running 15119 sub problems to find dead transitions.
[2024-06-01 09:04:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1617/16738 variables, and 0 constraints, problems are : Problem set: 0 solved, 15119 unsolved in 30243 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1618 constraints, PredecessorRefiner: 15119/1949 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1617/16738 variables, and 0 constraints, problems are : Problem set: 0 solved, 15119 unsolved in 30183 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1618 constraints, PredecessorRefiner: 13170/1949 constraints, Known Traps: 0/0 constraints]
After SMT, in 272414ms problems are : Problem set: 0 solved, 15119 unsolved
Search for dead transitions found 0 dead transitions in 272631ms
Starting structural reductions in LTL mode, iteration 1 : 1618/2443 places, 15120/15956 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281995 ms. Remains : 1618/2443 places, 15120/15956 transitions.
Support contains 23 out of 1618 places after structural reductions.
[2024-06-01 09:08:41] [INFO ] Flatten gal took : 1427 ms
[2024-06-01 09:08:42] [INFO ] Flatten gal took : 1229 ms
[2024-06-01 09:08:45] [INFO ] Input system was already deterministic with 15120 transitions.
RANDOM walk for 40000 steps (273 resets) in 2797 ms. (14 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (36 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (35 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (35 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (38 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (35 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (35 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
[2024-06-01 09:08:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1197/1218 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1218 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 400/1618 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1618 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16738/16738 variables, and 1627 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 1618/1618 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1197/1218 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 09:08:56] [INFO ] Deduced a trap composed of 307 places in 4419 ms of which 59 ms to minimize.
[2024-06-01 09:09:00] [INFO ] Deduced a trap composed of 298 places in 3960 ms of which 7 ms to minimize.
SMT process timed out in 13733ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 1618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1618/1618 places, 15120/15120 transitions.
Graph (trivial) has 1578 edges and 1618 vertex of which 129 / 1618 are part of one of the 23 SCC in 11 ms
Free SCC test removed 106 places
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Graph (complete) has 3127 edges and 1512 vertex of which 1504 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.69 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1093 transitions
Trivial Post-agglo rules discarded 1093 transitions
Performed 1093 trivial Post agglomeration. Transition count delta: 1093
Iterating post reduction 0 with 1101 rules applied. Total rules applied 1103 place count 1504 transition count 13876
Reduce places removed 1093 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1119 rules applied. Total rules applied 2222 place count 411 transition count 13850
Reduce places removed 10 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 20 rules applied. Total rules applied 2242 place count 401 transition count 13840
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2252 place count 391 transition count 13840
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 93 Pre rules applied. Total rules applied 2252 place count 391 transition count 13747
Deduced a syphon composed of 93 places in 5 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 2438 place count 298 transition count 13747
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2439 place count 298 transition count 13746
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 5 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 2557 place count 239 transition count 13687
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2570 place count 239 transition count 13674
Discarding 44 places :
Symmetric choice reduction at 6 with 44 rule applications. Total rules 2614 place count 195 transition count 1021
Iterating global reduction 6 with 44 rules applied. Total rules applied 2658 place count 195 transition count 1021
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 2677 place count 195 transition count 1002
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2698 place count 174 transition count 981
Iterating global reduction 7 with 21 rules applied. Total rules applied 2719 place count 174 transition count 981
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2733 place count 160 transition count 967
Iterating global reduction 7 with 14 rules applied. Total rules applied 2747 place count 160 transition count 967
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2753 place count 160 transition count 961
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 2773 place count 150 transition count 951
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 2783 place count 145 transition count 966
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2785 place count 145 transition count 964
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2787 place count 145 transition count 962
Free-agglomeration rule applied 50 times.
Iterating global reduction 9 with 50 rules applied. Total rules applied 2837 place count 145 transition count 912
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 2888 place count 95 transition count 911
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 2896 place count 87 transition count 903
Iterating global reduction 10 with 8 rules applied. Total rules applied 2904 place count 87 transition count 903
Drop transitions (Redundant composition of simpler transitions.) removed 270 transitions
Redundant transition composition rules discarded 270 transitions
Iterating global reduction 10 with 270 rules applied. Total rules applied 3174 place count 87 transition count 633
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 3178 place count 85 transition count 643
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 3181 place count 85 transition count 640
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 3184 place count 82 transition count 640
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 3194 place count 82 transition count 640
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 3200 place count 82 transition count 634
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 3201 place count 81 transition count 632
Iterating global reduction 11 with 1 rules applied. Total rules applied 3202 place count 81 transition count 632
Applied a total of 3202 rules in 2402 ms. Remains 81 /1618 variables (removed 1537) and now considering 632/15120 (removed 14488) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2402 ms. Remains : 81/1618 places, 632/15120 transitions.
RANDOM walk for 40000 steps (814 resets) in 2862 ms. (13 steps per ms) remains 0/10 properties
Computed a total of 328 stabilizing places and 344 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 1618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1618/1618 places, 15120/15120 transitions.
Graph (trivial) has 1609 edges and 1618 vertex of which 131 / 1618 are part of one of the 23 SCC in 3 ms
Free SCC test removed 108 places
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1113 transitions
Trivial Post-agglo rules discarded 1113 transitions
Performed 1113 trivial Post agglomeration. Transition count delta: 1113
Iterating post reduction 0 with 1113 rules applied. Total rules applied 1114 place count 1509 transition count 13883
Reduce places removed 1113 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1140 rules applied. Total rules applied 2254 place count 396 transition count 13856
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 2265 place count 386 transition count 13855
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2266 place count 385 transition count 13855
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 85 Pre rules applied. Total rules applied 2266 place count 385 transition count 13770
Deduced a syphon composed of 85 places in 5 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 2436 place count 300 transition count 13770
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2447 place count 289 transition count 13759
Iterating global reduction 4 with 11 rules applied. Total rules applied 2458 place count 289 transition count 13759
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2460 place count 287 transition count 13757
Iterating global reduction 4 with 2 rules applied. Total rules applied 2462 place count 287 transition count 13757
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2463 place count 286 transition count 13756
Iterating global reduction 4 with 1 rules applied. Total rules applied 2464 place count 286 transition count 13756
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2465 place count 286 transition count 13755
Performed 64 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 2593 place count 222 transition count 13689
Discarding 48 places :
Symmetric choice reduction at 5 with 48 rule applications. Total rules 2641 place count 174 transition count 1040
Iterating global reduction 5 with 48 rules applied. Total rules applied 2689 place count 174 transition count 1040
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2713 place count 174 transition count 1016
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 2737 place count 150 transition count 985
Iterating global reduction 6 with 24 rules applied. Total rules applied 2761 place count 150 transition count 985
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 2784 place count 127 transition count 955
Iterating global reduction 6 with 23 rules applied. Total rules applied 2807 place count 127 transition count 955
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2815 place count 127 transition count 947
Performed 14 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 2843 place count 113 transition count 953
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2844 place count 112 transition count 935
Iterating global reduction 7 with 1 rules applied. Total rules applied 2845 place count 112 transition count 935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2846 place count 112 transition count 934
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 2854 place count 112 transition count 926
Applied a total of 2854 rules in 2505 ms. Remains 112 /1618 variables (removed 1506) and now considering 926/15120 (removed 14194) transitions.
[2024-06-01 09:09:06] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
// Phase 1: matrix 917 rows 112 cols
[2024-06-01 09:09:06] [INFO ] Computed 2 invariants in 14 ms
[2024-06-01 09:09:07] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-06-01 09:09:07] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
[2024-06-01 09:09:07] [INFO ] Invariant cache hit.
[2024-06-01 09:09:07] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 09:09:08] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
[2024-06-01 09:09:08] [INFO ] Redundant transitions in 58 ms returned []
Running 909 sub problems to find dead transitions.
[2024-06-01 09:09:08] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
[2024-06-01 09:09:08] [INFO ] Invariant cache hit.
[2024-06-01 09:09:08] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:09:20] [INFO ] Deduced a trap composed of 26 places in 346 ms of which 2 ms to minimize.
[2024-06-01 09:09:20] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 0 ms to minimize.
[2024-06-01 09:09:20] [INFO ] Deduced a trap composed of 16 places in 300 ms of which 1 ms to minimize.
[2024-06-01 09:09:21] [INFO ] Deduced a trap composed of 20 places in 307 ms of which 1 ms to minimize.
[2024-06-01 09:09:21] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 0 ms to minimize.
[2024-06-01 09:09:21] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 1 ms to minimize.
[2024-06-01 09:09:21] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 1 ms to minimize.
[2024-06-01 09:09:22] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 1 ms to minimize.
[2024-06-01 09:09:22] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 0 ms to minimize.
[2024-06-01 09:09:22] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 0 ms to minimize.
[2024-06-01 09:09:23] [INFO ] Deduced a trap composed of 20 places in 348 ms of which 1 ms to minimize.
[2024-06-01 09:09:23] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 1 ms to minimize.
[2024-06-01 09:09:23] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2024-06-01 09:09:23] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 1 ms to minimize.
[2024-06-01 09:09:23] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 1 ms to minimize.
[2024-06-01 09:09:24] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 1 ms to minimize.
[2024-06-01 09:09:24] [INFO ] Deduced a trap composed of 18 places in 310 ms of which 1 ms to minimize.
[2024-06-01 09:09:24] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 1 ms to minimize.
[2024-06-01 09:09:25] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 1 ms to minimize.
[2024-06-01 09:09:25] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:09:27] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 1 ms to minimize.
[2024-06-01 09:09:28] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 0 ms to minimize.
[2024-06-01 09:09:28] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 1 ms to minimize.
[2024-06-01 09:09:28] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 1 ms to minimize.
[2024-06-01 09:09:28] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 0 ms to minimize.
[2024-06-01 09:09:29] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 1 ms to minimize.
[2024-06-01 09:09:29] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 0 ms to minimize.
[2024-06-01 09:09:29] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 1 ms to minimize.
[2024-06-01 09:09:30] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2024-06-01 09:09:30] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 1 ms to minimize.
[2024-06-01 09:09:30] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:09:30] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 2 ms to minimize.
[2024-06-01 09:09:30] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 1 ms to minimize.
[2024-06-01 09:09:31] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 3 ms to minimize.
[2024-06-01 09:09:31] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2024-06-01 09:09:31] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 1 ms to minimize.
[2024-06-01 09:09:31] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 0 ms to minimize.
[2024-06-01 09:09:32] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 1 ms to minimize.
[2024-06-01 09:09:32] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2024-06-01 09:09:32] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:09:33] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 1 ms to minimize.
[2024-06-01 09:09:33] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 1 ms to minimize.
[2024-06-01 09:09:33] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 1 ms to minimize.
[2024-06-01 09:09:33] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 1 ms to minimize.
[2024-06-01 09:09:34] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 2 ms to minimize.
[2024-06-01 09:09:34] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 1 ms to minimize.
[2024-06-01 09:09:34] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 1 ms to minimize.
[2024-06-01 09:09:34] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 1 ms to minimize.
[2024-06-01 09:09:35] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 1 ms to minimize.
[2024-06-01 09:09:37] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 0 ms to minimize.
[2024-06-01 09:09:38] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 0 ms to minimize.
[2024-06-01 09:09:38] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 0 ms to minimize.
[2024-06-01 09:09:38] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 1 ms to minimize.
[2024-06-01 09:09:38] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 1 ms to minimize.
[2024-06-01 09:09:38] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2024-06-01 09:09:39] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2024-06-01 09:09:40] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:09:41] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 1 ms to minimize.
[2024-06-01 09:09:41] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 2 ms to minimize.
[2024-06-01 09:09:41] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 112/1029 variables, and 62 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/112 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:09:52] [INFO ] Deduced a trap composed of 20 places in 281 ms of which 1 ms to minimize.
[2024-06-01 09:09:52] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 1 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 29 places in 270 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 1 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 0 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 0 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 1 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 0 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 1 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 1 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 0 ms to minimize.
[2024-06-01 09:09:56] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 0 ms to minimize.
[2024-06-01 09:09:56] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 0 ms to minimize.
[2024-06-01 09:09:56] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 0 ms to minimize.
[2024-06-01 09:09:56] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 1 ms to minimize.
[2024-06-01 09:09:57] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 1 ms to minimize.
[2024-06-01 09:09:57] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2024-06-01 09:09:58] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:10:02] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 1 ms to minimize.
[2024-06-01 09:10:02] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 0 ms to minimize.
[2024-06-01 09:10:03] [INFO ] Deduced a trap composed of 20 places in 274 ms of which 1 ms to minimize.
[2024-06-01 09:10:03] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 1 ms to minimize.
[2024-06-01 09:10:03] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 1 ms to minimize.
[2024-06-01 09:10:04] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 1 ms to minimize.
[2024-06-01 09:10:04] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 0 ms to minimize.
[2024-06-01 09:10:04] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 1 ms to minimize.
[2024-06-01 09:10:05] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 1 ms to minimize.
[2024-06-01 09:10:05] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 0 ms to minimize.
[2024-06-01 09:10:05] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 0 ms to minimize.
[2024-06-01 09:10:05] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 1 ms to minimize.
[2024-06-01 09:10:06] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 0 ms to minimize.
[2024-06-01 09:10:06] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 1 ms to minimize.
[2024-06-01 09:10:06] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 1 ms to minimize.
[2024-06-01 09:10:06] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 16/98 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:10:07] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2024-06-01 09:10:08] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 1 ms to minimize.
[2024-06-01 09:10:12] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 112/1029 variables, and 101 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/112 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 99/99 constraints]
After SMT, in 67582ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 67594ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1618 places, 926/15120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71393 ms. Remains : 112/1618 places, 926/15120 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-07b-LTLCardinality-01
Product exploration explored 100000 steps with 7024 reset in 485 ms.
Product exploration explored 100000 steps with 7024 reset in 363 ms.
Computed a total of 8 stabilizing places and 28 stable transitions
Computed a total of 8 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (2820 resets) in 1738 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (219 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (221 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (222 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (219 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1159081 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :3 out of 4
Probabilistic random walk after 1159081 steps, saw 193339 distinct states, run finished after 3003 ms. (steps per millisecond=385 ) properties seen :3
[2024-06-01 09:10:20] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
[2024-06-01 09:10:20] [INFO ] Invariant cache hit.
[2024-06-01 09:10:20] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:10:20] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 1 ms to minimize.
[2024-06-01 09:10:21] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 1 ms to minimize.
[2024-06-01 09:10:21] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 0 ms to minimize.
[2024-06-01 09:10:21] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 1 ms to minimize.
[2024-06-01 09:10:22] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 1 ms to minimize.
[2024-06-01 09:10:22] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 1 ms to minimize.
[2024-06-01 09:10:22] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:10:22] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 1 ms to minimize.
[2024-06-01 09:10:23] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 1 ms to minimize.
[2024-06-01 09:10:23] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 0 ms to minimize.
[2024-06-01 09:10:23] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 1 ms to minimize.
[2024-06-01 09:10:23] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 1 ms to minimize.
[2024-06-01 09:10:23] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 915/1025 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1025 variables, 254/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1025 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/1028 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1028 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1028 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1029 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1029 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1029 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1029/1029 variables, and 382 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3792 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 915/1025 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1025 variables, 254/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1025 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1025 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/1028 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1028 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1028 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1029 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1029 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1029 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1029/1029 variables, and 383 constraints, problems are : Problem set: 0 solved, 1 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 4450ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 926/926 transitions.
Graph (trivial) has 105 edges and 112 vertex of which 2 / 112 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 788 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 11 place count 110 transition count 905
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 109 transition count 905
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 108 transition count 904
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 108 transition count 904
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 32 place count 99 transition count 895
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 99 transition count 894
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 35 place count 97 transition count 892
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 97 transition count 892
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 97 transition count 891
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 80 place count 97 transition count 849
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 4 with 308 rules applied. Total rules applied 388 place count 54 transition count 584
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 396 place count 46 transition count 584
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 404 place count 38 transition count 576
Iterating global reduction 6 with 8 rules applied. Total rules applied 412 place count 38 transition count 576
Performed 16 Post agglomeration using F-continuation condition with reduction of 258 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 444 place count 22 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 476 place count 22 transition count 270
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 480 place count 18 transition count 266
Iterating global reduction 7 with 4 rules applied. Total rules applied 484 place count 18 transition count 266
Performed 7 Post agglomeration using F-continuation condition with reduction of 240 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 504 place count 5 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 518 place count 5 transition count 5
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 519 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 520 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 521 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 521 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 523 place count 2 transition count 2
Applied a total of 523 rules in 117 ms. Remains 2 /112 variables (removed 110) and now considering 2/926 (removed 924) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 2/112 places, 2/926 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 926/926 transitions.
Applied a total of 0 rules in 51 ms. Remains 112 /112 variables (removed 0) and now considering 926/926 (removed 0) transitions.
[2024-06-01 09:10:25] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
[2024-06-01 09:10:25] [INFO ] Invariant cache hit.
[2024-06-01 09:10:25] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-06-01 09:10:25] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
[2024-06-01 09:10:25] [INFO ] Invariant cache hit.
[2024-06-01 09:10:26] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 09:10:26] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2024-06-01 09:10:26] [INFO ] Redundant transitions in 91 ms returned []
Running 909 sub problems to find dead transitions.
[2024-06-01 09:10:26] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
[2024-06-01 09:10:26] [INFO ] Invariant cache hit.
[2024-06-01 09:10:26] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:10:39] [INFO ] Deduced a trap composed of 26 places in 294 ms of which 1 ms to minimize.
[2024-06-01 09:10:39] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 1 ms to minimize.
[2024-06-01 09:10:39] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 0 ms to minimize.
[2024-06-01 09:10:39] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 1 ms to minimize.
[2024-06-01 09:10:40] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 3 ms to minimize.
[2024-06-01 09:10:40] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 0 ms to minimize.
[2024-06-01 09:10:40] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 0 ms to minimize.
[2024-06-01 09:10:40] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 1 ms to minimize.
[2024-06-01 09:10:41] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 1 ms to minimize.
[2024-06-01 09:10:41] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 1 ms to minimize.
[2024-06-01 09:10:41] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 0 ms to minimize.
[2024-06-01 09:10:41] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:10:42] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2024-06-01 09:10:42] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 1 ms to minimize.
[2024-06-01 09:10:42] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 1 ms to minimize.
[2024-06-01 09:10:42] [INFO ] Deduced a trap composed of 23 places in 311 ms of which 1 ms to minimize.
[2024-06-01 09:10:43] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 1 ms to minimize.
[2024-06-01 09:10:43] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 1 ms to minimize.
[2024-06-01 09:10:43] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 1 ms to minimize.
[2024-06-01 09:10:44] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:10:46] [INFO ] Deduced a trap composed of 31 places in 307 ms of which 1 ms to minimize.
[2024-06-01 09:10:46] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 1 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 1 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 0 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 1 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 1 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 1 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 3 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 1 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 1 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
[2024-06-01 09:10:50] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 0 ms to minimize.
[2024-06-01 09:10:50] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 1 ms to minimize.
[2024-06-01 09:10:50] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 1 ms to minimize.
[2024-06-01 09:10:50] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 1 ms to minimize.
[2024-06-01 09:10:51] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2024-06-01 09:10:51] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 0 ms to minimize.
[2024-06-01 09:10:51] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:10:52] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 1 ms to minimize.
[2024-06-01 09:10:52] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 0 ms to minimize.
[2024-06-01 09:10:52] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2024-06-01 09:10:52] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 1 ms to minimize.
[2024-06-01 09:10:53] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 1 ms to minimize.
[2024-06-01 09:10:53] [INFO ] Deduced a trap composed of 20 places in 271 ms of which 1 ms to minimize.
[2024-06-01 09:10:53] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 1 ms to minimize.
[2024-06-01 09:10:53] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:10:54] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 1 ms to minimize.
[2024-06-01 09:10:56] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 0 ms to minimize.
[2024-06-01 09:10:57] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 0 ms to minimize.
[2024-06-01 09:10:57] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 1 ms to minimize.
[2024-06-01 09:10:57] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 1 ms to minimize.
[2024-06-01 09:10:57] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 1 ms to minimize.
[2024-06-01 09:10:58] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 1 ms to minimize.
[2024-06-01 09:10:58] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 1 ms to minimize.
[2024-06-01 09:10:59] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 1 ms to minimize.
[2024-06-01 09:11:00] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2024-06-01 09:11:00] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 0 ms to minimize.
[2024-06-01 09:11:00] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 112/1029 variables, and 62 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/112 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:11:11] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
[2024-06-01 09:11:11] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 1 ms to minimize.
[2024-06-01 09:11:11] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 0 ms to minimize.
[2024-06-01 09:11:12] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 0 ms to minimize.
[2024-06-01 09:11:12] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 1 ms to minimize.
[2024-06-01 09:11:12] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 0 ms to minimize.
[2024-06-01 09:11:12] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 0 ms to minimize.
[2024-06-01 09:11:13] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 1 ms to minimize.
[2024-06-01 09:11:13] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 0 ms to minimize.
[2024-06-01 09:11:13] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 0 ms to minimize.
[2024-06-01 09:11:13] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 1 ms to minimize.
[2024-06-01 09:11:14] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 0 ms to minimize.
[2024-06-01 09:11:14] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 1 ms to minimize.
[2024-06-01 09:11:14] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 1 ms to minimize.
[2024-06-01 09:11:14] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 1 ms to minimize.
[2024-06-01 09:11:15] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 1 ms to minimize.
[2024-06-01 09:11:15] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 1 ms to minimize.
[2024-06-01 09:11:15] [INFO ] Deduced a trap composed of 27 places in 302 ms of which 1 ms to minimize.
[2024-06-01 09:11:16] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 1 ms to minimize.
[2024-06-01 09:11:16] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:11:21] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 0 ms to minimize.
[2024-06-01 09:11:21] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 1 ms to minimize.
[2024-06-01 09:11:21] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 1 ms to minimize.
[2024-06-01 09:11:21] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 1 ms to minimize.
[2024-06-01 09:11:22] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 1 ms to minimize.
[2024-06-01 09:11:22] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 1 ms to minimize.
[2024-06-01 09:11:22] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 1 ms to minimize.
[2024-06-01 09:11:22] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 1 ms to minimize.
[2024-06-01 09:11:23] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 1 ms to minimize.
[2024-06-01 09:11:23] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2024-06-01 09:11:23] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 1 ms to minimize.
[2024-06-01 09:11:23] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 0 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 16/98 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:11:25] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 1 ms to minimize.
[2024-06-01 09:11:26] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 1 ms to minimize.
[2024-06-01 09:11:30] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 112/1029 variables, and 101 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/112 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 99/99 constraints]
After SMT, in 67809ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 67817ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 69071 ms. Remains : 112/112 places, 926/926 transitions.
Computed a total of 8 stabilizing places and 28 stable transitions
Computed a total of 8 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (2791 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (226 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (217 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (224 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (225 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1160338 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :3 out of 4
Probabilistic random walk after 1160338 steps, saw 193489 distinct states, run finished after 3003 ms. (steps per millisecond=386 ) properties seen :3
[2024-06-01 09:11:38] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
[2024-06-01 09:11:38] [INFO ] Invariant cache hit.
[2024-06-01 09:11:38] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:11:38] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 1 ms to minimize.
[2024-06-01 09:11:38] [INFO ] Deduced a trap composed of 14 places in 281 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 1 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 14 places in 268 ms of which 1 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 1 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 1 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 1 ms to minimize.
[2024-06-01 09:11:41] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2024-06-01 09:11:41] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 1 ms to minimize.
[2024-06-01 09:11:41] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 915/1025 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1025 variables, 254/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1025 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/1028 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1028 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1028 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1029 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1029 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1029 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1029/1029 variables, and 382 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3761 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 109/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 915/1025 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1025 variables, 254/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1025 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1025 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/1028 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1028 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1028 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1029 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1029 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1029 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1029/1029 variables, and 383 constraints, problems are : Problem set: 0 solved, 1 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 4405ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 926/926 transitions.
Graph (trivial) has 105 edges and 112 vertex of which 2 / 112 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 788 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 11 place count 110 transition count 905
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 109 transition count 905
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 108 transition count 904
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 108 transition count 904
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 32 place count 99 transition count 895
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 99 transition count 894
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 35 place count 97 transition count 892
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 97 transition count 892
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 97 transition count 891
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 80 place count 97 transition count 849
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 4 with 308 rules applied. Total rules applied 388 place count 54 transition count 584
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 396 place count 46 transition count 584
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 404 place count 38 transition count 576
Iterating global reduction 6 with 8 rules applied. Total rules applied 412 place count 38 transition count 576
Performed 16 Post agglomeration using F-continuation condition with reduction of 258 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 444 place count 22 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 476 place count 22 transition count 270
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 480 place count 18 transition count 266
Iterating global reduction 7 with 4 rules applied. Total rules applied 484 place count 18 transition count 266
Performed 7 Post agglomeration using F-continuation condition with reduction of 240 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 504 place count 5 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 518 place count 5 transition count 5
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 519 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 520 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 521 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 521 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 523 place count 2 transition count 2
Applied a total of 523 rules in 310 ms. Remains 2 /112 variables (removed 110) and now considering 2/926 (removed 924) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 2/112 places, 2/926 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 6948 reset in 346 ms.
Product exploration explored 100000 steps with 7052 reset in 354 ms.
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 926/926 transitions.
Applied a total of 0 rules in 45 ms. Remains 112 /112 variables (removed 0) and now considering 926/926 (removed 0) transitions.
[2024-06-01 09:11:44] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
[2024-06-01 09:11:44] [INFO ] Invariant cache hit.
[2024-06-01 09:11:44] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-01 09:11:44] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
[2024-06-01 09:11:44] [INFO ] Invariant cache hit.
[2024-06-01 09:11:44] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 09:11:45] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
[2024-06-01 09:11:45] [INFO ] Redundant transitions in 17 ms returned []
Running 909 sub problems to find dead transitions.
[2024-06-01 09:11:45] [INFO ] Flow matrix only has 917 transitions (discarded 9 similar events)
[2024-06-01 09:11:45] [INFO ] Invariant cache hit.
[2024-06-01 09:11:45] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:11:57] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 0 ms to minimize.
[2024-06-01 09:11:57] [INFO ] Deduced a trap composed of 20 places in 305 ms of which 1 ms to minimize.
[2024-06-01 09:11:57] [INFO ] Deduced a trap composed of 16 places in 282 ms of which 1 ms to minimize.
[2024-06-01 09:11:58] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 1 ms to minimize.
[2024-06-01 09:11:58] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 1 ms to minimize.
[2024-06-01 09:11:58] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 1 ms to minimize.
[2024-06-01 09:11:59] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 0 ms to minimize.
[2024-06-01 09:11:59] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 1 ms to minimize.
[2024-06-01 09:11:59] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 0 ms to minimize.
[2024-06-01 09:11:59] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 1 ms to minimize.
[2024-06-01 09:12:00] [INFO ] Deduced a trap composed of 20 places in 336 ms of which 1 ms to minimize.
[2024-06-01 09:12:00] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 1 ms to minimize.
[2024-06-01 09:12:00] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 0 ms to minimize.
[2024-06-01 09:12:00] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 1 ms to minimize.
[2024-06-01 09:12:00] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 0 ms to minimize.
[2024-06-01 09:12:01] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 1 ms to minimize.
[2024-06-01 09:12:01] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 1 ms to minimize.
[2024-06-01 09:12:01] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 0 ms to minimize.
[2024-06-01 09:12:02] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 1 ms to minimize.
[2024-06-01 09:12:02] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:12:04] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 1 ms to minimize.
[2024-06-01 09:12:05] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 1 ms to minimize.
[2024-06-01 09:12:05] [INFO ] Deduced a trap composed of 30 places in 311 ms of which 2 ms to minimize.
[2024-06-01 09:12:05] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 1 ms to minimize.
[2024-06-01 09:12:06] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 1 ms to minimize.
[2024-06-01 09:12:06] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 0 ms to minimize.
[2024-06-01 09:12:06] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 1 ms to minimize.
[2024-06-01 09:12:06] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 0 ms to minimize.
[2024-06-01 09:12:07] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 1 ms to minimize.
[2024-06-01 09:12:07] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 3 ms to minimize.
[2024-06-01 09:12:07] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 0 ms to minimize.
[2024-06-01 09:12:07] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 1 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 0 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 1 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 1 ms to minimize.
[2024-06-01 09:12:08] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 1 ms to minimize.
[2024-06-01 09:12:09] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2024-06-01 09:12:09] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 1 ms to minimize.
[2024-06-01 09:12:09] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:12:10] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 0 ms to minimize.
[2024-06-01 09:12:10] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 0 ms to minimize.
[2024-06-01 09:12:10] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 1 ms to minimize.
[2024-06-01 09:12:10] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 1 ms to minimize.
[2024-06-01 09:12:11] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2024-06-01 09:12:11] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 1 ms to minimize.
[2024-06-01 09:12:11] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 0 ms to minimize.
[2024-06-01 09:12:11] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 0 ms to minimize.
[2024-06-01 09:12:12] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 1 ms to minimize.
[2024-06-01 09:12:14] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 1 ms to minimize.
[2024-06-01 09:12:15] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2024-06-01 09:12:15] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 0 ms to minimize.
[2024-06-01 09:12:15] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 1 ms to minimize.
[2024-06-01 09:12:15] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 1 ms to minimize.
[2024-06-01 09:12:15] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 1 ms to minimize.
[2024-06-01 09:12:16] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 1 ms to minimize.
[2024-06-01 09:12:17] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 1 ms to minimize.
[2024-06-01 09:12:17] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 1 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 909 unsolved
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 0 ms to minimize.
SMT process timed out in 37831ms, After SMT, problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 37842ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38976 ms. Remains : 112/112 places, 926/926 transitions.
Treatment of property StigmergyCommit-PT-07b-LTLCardinality-01 finished in 200596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1618/1618 places, 15120/15120 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1609 transition count 15111
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1609 transition count 15111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1609 transition count 15110
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 1602 transition count 15103
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 1602 transition count 15103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 1597 transition count 15098
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 1597 transition count 15098
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1597 transition count 15097
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 1594 transition count 15094
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 1594 transition count 15094
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 1594 transition count 15093
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 1592 transition count 15091
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 1592 transition count 15091
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 1590 transition count 15089
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 1590 transition count 15089
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 1588 transition count 15087
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 1588 transition count 15087
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 1586 transition count 15085
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 1586 transition count 15085
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 1584 transition count 15083
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 1584 transition count 15083
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 1582 transition count 15081
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 1582 transition count 15081
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 1580 transition count 15079
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 1580 transition count 15079
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 1578 transition count 15077
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 1578 transition count 15077
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 1576 transition count 15075
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 1576 transition count 15075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 1576 transition count 15074
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 1575 transition count 15073
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 1575 transition count 15073
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 1574 transition count 15072
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 1574 transition count 15072
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 1573 transition count 15071
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 1573 transition count 15071
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 1572 transition count 15070
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 1572 transition count 15070
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 1571 transition count 15069
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 1571 transition count 15069
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 1570 transition count 15068
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 1570 transition count 15068
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 1570 transition count 15067
Applied a total of 101 rules in 3223 ms. Remains 1570 /1618 variables (removed 48) and now considering 15067/15120 (removed 53) transitions.
// Phase 1: matrix 15067 rows 1570 cols
[2024-06-01 09:12:28] [INFO ] Computed 9 invariants in 240 ms
[2024-06-01 09:12:32] [INFO ] Implicit Places using invariants in 4307 ms returned []
Implicit Place search using SMT only with invariants took 4308 ms to find 0 implicit places.
Running 15066 sub problems to find dead transitions.
[2024-06-01 09:12:32] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1569/16637 variables, and 0 constraints, problems are : Problem set: 0 solved, 15066 unsolved in 30176 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1570 constraints, PredecessorRefiner: 15066/1896 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15066 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1569/16637 variables, and 0 constraints, problems are : Problem set: 0 solved, 15066 unsolved in 30160 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1570 constraints, PredecessorRefiner: 13170/1896 constraints, Known Traps: 0/0 constraints]
After SMT, in 255602ms problems are : Problem set: 0 solved, 15066 unsolved
Search for dead transitions found 0 dead transitions in 255741ms
Starting structural reductions in LTL mode, iteration 1 : 1570/1618 places, 15067/15120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263316 ms. Remains : 1570/1618 places, 15067/15120 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07b-LTLCardinality-03
Product exploration explored 100000 steps with 677 reset in 654 ms.
Product exploration explored 100000 steps with 679 reset in 621 ms.
Computed a total of 328 stabilizing places and 344 stable transitions
Computed a total of 328 stabilizing places and 344 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (268 resets) in 439 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (37 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 60975 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 1
Probabilistic random walk after 60975 steps, saw 17641 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
[2024-06-01 09:16:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 393/395 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1175/1570 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1570 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16637/16637 variables, and 1579 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3269 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 1570/1570 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) 393/395 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1175/1570 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:17:02] [INFO ] Deduced a trap composed of 303 places in 5351 ms of which 7 ms to minimize.
SMT process timed out in 8943ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1570/1570 places, 15067/15067 transitions.
Graph (trivial) has 1565 edges and 1570 vertex of which 136 / 1570 are part of one of the 24 SCC in 1 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 3054 edges and 1458 vertex of which 1450 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.19 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1096 transitions
Trivial Post-agglo rules discarded 1096 transitions
Performed 1096 trivial Post agglomeration. Transition count delta: 1096
Iterating post reduction 0 with 1104 rules applied. Total rules applied 1106 place count 1450 transition count 13811
Reduce places removed 1096 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 1120 rules applied. Total rules applied 2226 place count 354 transition count 13787
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 2235 place count 346 transition count 13786
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2236 place count 345 transition count 13786
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 89 Pre rules applied. Total rules applied 2236 place count 345 transition count 13697
Deduced a syphon composed of 89 places in 5 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2414 place count 256 transition count 13697
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2415 place count 256 transition count 13696
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 5 with 114 rules applied. Total rules applied 2529 place count 199 transition count 13639
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 2545 place count 199 transition count 13623
Discarding 49 places :
Symmetric choice reduction at 6 with 49 rule applications. Total rules 2594 place count 150 transition count 965
Iterating global reduction 6 with 49 rules applied. Total rules applied 2643 place count 150 transition count 965
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 2666 place count 150 transition count 942
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 2690 place count 126 transition count 918
Iterating global reduction 7 with 24 rules applied. Total rules applied 2714 place count 126 transition count 918
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2730 place count 110 transition count 902
Iterating global reduction 7 with 16 rules applied. Total rules applied 2746 place count 110 transition count 902
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 2754 place count 110 transition count 894
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 2770 place count 102 transition count 886
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2776 place count 99 transition count 894
Free-agglomeration rule applied 42 times.
Iterating global reduction 8 with 42 rules applied. Total rules applied 2818 place count 99 transition count 852
Reduce places removed 42 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 8 with 171 rules applied. Total rules applied 2989 place count 57 transition count 723
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 2997 place count 49 transition count 715
Iterating global reduction 9 with 8 rules applied. Total rules applied 3005 place count 49 transition count 715
Drop transitions (Redundant composition of simpler transitions.) removed 384 transitions
Redundant transition composition rules discarded 384 transitions
Iterating global reduction 9 with 384 rules applied. Total rules applied 3389 place count 49 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3391 place count 48 transition count 330
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3395 place count 46 transition count 348
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3399 place count 46 transition count 344
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 3403 place count 42 transition count 344
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 3409 place count 42 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 3414 place count 42 transition count 339
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 3417 place count 39 transition count 333
Iterating global reduction 10 with 3 rules applied. Total rules applied 3420 place count 39 transition count 333
Applied a total of 3420 rules in 1444 ms. Remains 39 /1570 variables (removed 1531) and now considering 333/15067 (removed 14734) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1445 ms. Remains : 39/1570 places, 333/15067 transitions.
RANDOM walk for 1561 steps (0 resets) in 30 ms. (50 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-07b-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-07b-LTLCardinality-03 finished in 279152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 1618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1618/1618 places, 15120/15120 transitions.
Graph (trivial) has 1608 edges and 1618 vertex of which 136 / 1618 are part of one of the 24 SCC in 2 ms
Free SCC test removed 112 places
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1109 transitions
Trivial Post-agglo rules discarded 1109 transitions
Performed 1109 trivial Post agglomeration. Transition count delta: 1109
Iterating post reduction 0 with 1109 rules applied. Total rules applied 1110 place count 1505 transition count 13883
Reduce places removed 1109 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 1133 rules applied. Total rules applied 2243 place count 396 transition count 13859
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 2254 place count 388 transition count 13856
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2257 place count 385 transition count 13856
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 2257 place count 385 transition count 13772
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2425 place count 301 transition count 13772
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2436 place count 290 transition count 13761
Iterating global reduction 4 with 11 rules applied. Total rules applied 2447 place count 290 transition count 13761
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2449 place count 288 transition count 13759
Iterating global reduction 4 with 2 rules applied. Total rules applied 2451 place count 288 transition count 13759
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2452 place count 287 transition count 13758
Iterating global reduction 4 with 1 rules applied. Total rules applied 2453 place count 287 transition count 13758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2454 place count 287 transition count 13757
Performed 64 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 2582 place count 223 transition count 13690
Discarding 48 places :
Symmetric choice reduction at 5 with 48 rule applications. Total rules 2630 place count 175 transition count 1041
Iterating global reduction 5 with 48 rules applied. Total rules applied 2678 place count 175 transition count 1041
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2701 place count 175 transition count 1018
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 2725 place count 151 transition count 987
Iterating global reduction 6 with 24 rules applied. Total rules applied 2749 place count 151 transition count 987
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 2771 place count 129 transition count 958
Iterating global reduction 6 with 22 rules applied. Total rules applied 2793 place count 129 transition count 958
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2800 place count 129 transition count 951
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 2826 place count 116 transition count 965
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2827 place count 115 transition count 947
Iterating global reduction 7 with 1 rules applied. Total rules applied 2828 place count 115 transition count 947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2829 place count 115 transition count 946
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 2838 place count 115 transition count 937
Applied a total of 2838 rules in 1637 ms. Remains 115 /1618 variables (removed 1503) and now considering 937/15120 (removed 14183) transitions.
[2024-06-01 09:17:05] [INFO ] Flow matrix only has 927 transitions (discarded 10 similar events)
// Phase 1: matrix 927 rows 115 cols
[2024-06-01 09:17:05] [INFO ] Computed 2 invariants in 15 ms
[2024-06-01 09:17:05] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 09:17:05] [INFO ] Flow matrix only has 927 transitions (discarded 10 similar events)
[2024-06-01 09:17:05] [INFO ] Invariant cache hit.
[2024-06-01 09:17:06] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 09:17:06] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2024-06-01 09:17:06] [INFO ] Redundant transitions in 11 ms returned []
Running 912 sub problems to find dead transitions.
[2024-06-01 09:17:06] [INFO ] Flow matrix only has 927 transitions (discarded 10 similar events)
[2024-06-01 09:17:06] [INFO ] Invariant cache hit.
[2024-06-01 09:17:06] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-06-01 09:17:18] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 1 ms to minimize.
[2024-06-01 09:17:19] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 1 ms to minimize.
[2024-06-01 09:17:19] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 0 ms to minimize.
[2024-06-01 09:17:19] [INFO ] Deduced a trap composed of 14 places in 280 ms of which 1 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 20 places in 302 ms of which 1 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 1 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 0 ms to minimize.
[2024-06-01 09:17:20] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 1 ms to minimize.
[2024-06-01 09:17:21] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 1 ms to minimize.
[2024-06-01 09:17:21] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 1 ms to minimize.
[2024-06-01 09:17:21] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 1 ms to minimize.
[2024-06-01 09:17:21] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 1 ms to minimize.
[2024-06-01 09:17:22] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 1 ms to minimize.
[2024-06-01 09:17:22] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 1 ms to minimize.
[2024-06-01 09:17:22] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 1 ms to minimize.
[2024-06-01 09:17:23] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 1 ms to minimize.
[2024-06-01 09:17:23] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 1 ms to minimize.
[2024-06-01 09:17:23] [INFO ] Deduced a trap composed of 24 places in 350 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 1 ms to minimize.
[2024-06-01 09:17:24] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-06-01 09:17:26] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 1 ms to minimize.
[2024-06-01 09:17:27] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 1 ms to minimize.
[2024-06-01 09:17:27] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 0 ms to minimize.
[2024-06-01 09:17:27] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 0 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 1 ms to minimize.
[2024-06-01 09:17:30] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 1 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 1 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 0 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 1 ms to minimize.
[2024-06-01 09:17:31] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 1 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 0 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 1 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2024-06-01 09:17:32] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:17:33] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 1 ms to minimize.
[2024-06-01 09:17:33] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 1 ms to minimize.
[2024-06-01 09:17:34] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 0 ms to minimize.
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-06-01 09:17:35] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 1 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 0 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 1 ms to minimize.
[2024-06-01 09:17:36] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 0 ms to minimize.
[2024-06-01 09:17:37] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 1 ms to minimize.
[2024-06-01 09:17:39] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 1 ms to minimize.
[2024-06-01 09:17:39] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 1 ms to minimize.
[2024-06-01 09:17:40] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 1 ms to minimize.
[2024-06-01 09:17:40] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2024-06-01 09:17:40] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 0 ms to minimize.
[2024-06-01 09:17:40] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 1 ms to minimize.
[2024-06-01 09:17:41] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 1 ms to minimize.
[2024-06-01 09:17:41] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 1 ms to minimize.
[2024-06-01 09:17:41] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 0 ms to minimize.
[2024-06-01 09:17:41] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 1 ms to minimize.
[2024-06-01 09:17:42] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 1 ms to minimize.
[2024-06-01 09:17:43] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 0 ms to minimize.
[2024-06-01 09:17:43] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 0 ms to minimize.
[2024-06-01 09:17:44] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 0 ms to minimize.
SMT process timed out in 37226ms, After SMT, problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 37235ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1618 places, 937/15120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40146 ms. Remains : 115/1618 places, 937/15120 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-07b-LTLCardinality-04
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07b-LTLCardinality-04 finished in 40284 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 1618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1618/1618 places, 15120/15120 transitions.
Graph (trivial) has 1612 edges and 1618 vertex of which 138 / 1618 are part of one of the 24 SCC in 0 ms
Free SCC test removed 114 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1111 transitions
Trivial Post-agglo rules discarded 1111 transitions
Performed 1111 trivial Post agglomeration. Transition count delta: 1111
Iterating post reduction 0 with 1111 rules applied. Total rules applied 1112 place count 1503 transition count 13878
Reduce places removed 1111 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 1135 rules applied. Total rules applied 2247 place count 392 transition count 13854
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 2256 place count 384 transition count 13853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2257 place count 383 transition count 13853
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 86 Pre rules applied. Total rules applied 2257 place count 383 transition count 13767
Deduced a syphon composed of 86 places in 5 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 2429 place count 297 transition count 13767
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2440 place count 286 transition count 13756
Iterating global reduction 4 with 11 rules applied. Total rules applied 2451 place count 286 transition count 13756
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2453 place count 284 transition count 13754
Iterating global reduction 4 with 2 rules applied. Total rules applied 2455 place count 284 transition count 13754
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2456 place count 283 transition count 13753
Iterating global reduction 4 with 1 rules applied. Total rules applied 2457 place count 283 transition count 13753
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2458 place count 283 transition count 13752
Performed 64 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 2586 place count 219 transition count 13685
Discarding 48 places :
Symmetric choice reduction at 5 with 48 rule applications. Total rules 2634 place count 171 transition count 1035
Iterating global reduction 5 with 48 rules applied. Total rules applied 2682 place count 171 transition count 1035
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2704 place count 171 transition count 1013
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 2729 place count 146 transition count 980
Iterating global reduction 6 with 25 rules applied. Total rules applied 2754 place count 146 transition count 980
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 2779 place count 121 transition count 947
Iterating global reduction 6 with 25 rules applied. Total rules applied 2804 place count 121 transition count 947
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2813 place count 121 transition count 938
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 2837 place count 109 transition count 945
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2838 place count 108 transition count 929
Iterating global reduction 7 with 1 rules applied. Total rules applied 2839 place count 108 transition count 929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2840 place count 108 transition count 928
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 2848 place count 108 transition count 920
Applied a total of 2848 rules in 1626 ms. Remains 108 /1618 variables (removed 1510) and now considering 920/15120 (removed 14200) transitions.
[2024-06-01 09:17:45] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
// Phase 1: matrix 911 rows 108 cols
[2024-06-01 09:17:45] [INFO ] Computed 2 invariants in 17 ms
[2024-06-01 09:17:46] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 09:17:46] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
[2024-06-01 09:17:46] [INFO ] Invariant cache hit.
[2024-06-01 09:17:46] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 09:17:46] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
[2024-06-01 09:17:46] [INFO ] Redundant transitions in 17 ms returned []
Running 903 sub problems to find dead transitions.
[2024-06-01 09:17:46] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
[2024-06-01 09:17:46] [INFO ] Invariant cache hit.
[2024-06-01 09:17:47] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-06-01 09:17:58] [INFO ] Deduced a trap composed of 20 places in 340 ms of which 1 ms to minimize.
[2024-06-01 09:17:58] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 1 ms to minimize.
[2024-06-01 09:17:59] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 1 ms to minimize.
[2024-06-01 09:17:59] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 1 ms to minimize.
[2024-06-01 09:17:59] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 1 ms to minimize.
[2024-06-01 09:18:00] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 0 ms to minimize.
[2024-06-01 09:18:00] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 1 ms to minimize.
[2024-06-01 09:18:00] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 0 ms to minimize.
[2024-06-01 09:18:00] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 1 ms to minimize.
[2024-06-01 09:18:01] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 1 ms to minimize.
[2024-06-01 09:18:01] [INFO ] Deduced a trap composed of 27 places in 289 ms of which 1 ms to minimize.
[2024-06-01 09:18:01] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 1 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 0 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 0 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2024-06-01 09:18:05] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 1 ms to minimize.
[2024-06-01 09:18:05] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 0 ms to minimize.
[2024-06-01 09:18:06] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 0 ms to minimize.
[2024-06-01 09:18:07] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 1 ms to minimize.
[2024-06-01 09:18:07] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-06-01 09:18:13] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:18:13] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 1 ms to minimize.
[2024-06-01 09:18:13] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 0 ms to minimize.
[2024-06-01 09:18:13] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 1 ms to minimize.
[2024-06-01 09:18:14] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 1 ms to minimize.
[2024-06-01 09:18:14] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 1 ms to minimize.
[2024-06-01 09:18:14] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 1 ms to minimize.
[2024-06-01 09:18:14] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 1 ms to minimize.
[2024-06-01 09:18:15] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 1 ms to minimize.
[2024-06-01 09:18:15] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 1 ms to minimize.
[2024-06-01 09:18:15] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 1 ms to minimize.
[2024-06-01 09:18:15] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 0 ms to minimize.
[2024-06-01 09:18:16] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 1 ms to minimize.
[2024-06-01 09:18:16] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 1 ms to minimize.
[2024-06-01 09:18:16] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 0 ms to minimize.
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 1 ms to minimize.
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 0 ms to minimize.
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 1 ms to minimize.
[2024-06-01 09:18:17] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 1 ms to minimize.
[2024-06-01 09:18:18] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-06-01 09:18:18] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 0 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 0 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 0 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 0 ms to minimize.
[2024-06-01 09:18:19] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 1 ms to minimize.
[2024-06-01 09:18:23] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 1 ms to minimize.
[2024-06-01 09:18:23] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 1 ms to minimize.
SMT process timed out in 36991ms, After SMT, problems are : Problem set: 0 solved, 903 unsolved
Search for dead transitions found 0 dead transitions in 37000ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/1618 places, 920/15120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39697 ms. Remains : 108/1618 places, 920/15120 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07b-LTLCardinality-05
Product exploration explored 100000 steps with 6991 reset in 330 ms.
Product exploration explored 100000 steps with 6974 reset in 339 ms.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2797 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (223 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1096092 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :0 out of 1
Probabilistic random walk after 1096092 steps, saw 203425 distinct states, run finished after 3002 ms. (steps per millisecond=365 ) properties seen :0
[2024-06-01 09:18:27] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
[2024-06-01 09:18:27] [INFO ] Invariant cache hit.
[2024-06-01 09:18:27] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 104/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 909/1015 variables, 106/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 254/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1015 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1018 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1018 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1018 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1019 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1019 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1019/1019 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 255/255 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) 104/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:18:28] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 1 ms to minimize.
[2024-06-01 09:18:29] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 1 ms to minimize.
[2024-06-01 09:18:29] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 0 ms to minimize.
[2024-06-01 09:18:29] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2024-06-01 09:18:29] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 1 ms to minimize.
[2024-06-01 09:18:30] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 909/1015 variables, 106/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1015 variables, 254/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:18:30] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 1 ms to minimize.
[2024-06-01 09:18:31] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1015 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1015 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/1018 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1018 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1018 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:18:31] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1018 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1018 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1019 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1019 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1019 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3662ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 71 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 920/920 transitions.
Applied a total of 0 rules in 50 ms. Remains 108 /108 variables (removed 0) and now considering 920/920 (removed 0) transitions.
[2024-06-01 09:18:31] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
[2024-06-01 09:18:31] [INFO ] Invariant cache hit.
[2024-06-01 09:18:32] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-01 09:18:32] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
[2024-06-01 09:18:32] [INFO ] Invariant cache hit.
[2024-06-01 09:18:32] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 09:18:32] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
[2024-06-01 09:18:32] [INFO ] Redundant transitions in 11 ms returned []
Running 903 sub problems to find dead transitions.
[2024-06-01 09:18:32] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
[2024-06-01 09:18:32] [INFO ] Invariant cache hit.
[2024-06-01 09:18:32] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-06-01 09:18:44] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 1 ms to minimize.
[2024-06-01 09:18:44] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 1 ms to minimize.
[2024-06-01 09:18:45] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 1 ms to minimize.
[2024-06-01 09:18:45] [INFO ] Deduced a trap composed of 19 places in 406 ms of which 1 ms to minimize.
[2024-06-01 09:18:45] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 1 ms to minimize.
[2024-06-01 09:18:46] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 1 ms to minimize.
[2024-06-01 09:18:46] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 1 ms to minimize.
[2024-06-01 09:18:46] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 1 ms to minimize.
[2024-06-01 09:18:46] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 1 ms to minimize.
[2024-06-01 09:18:47] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 1 ms to minimize.
[2024-06-01 09:18:47] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 1 ms to minimize.
[2024-06-01 09:18:47] [INFO ] Deduced a trap composed of 24 places in 374 ms of which 1 ms to minimize.
[2024-06-01 09:18:48] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 1 ms to minimize.
[2024-06-01 09:18:50] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 1 ms to minimize.
[2024-06-01 09:18:50] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 1 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 1 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 0 ms to minimize.
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
[2024-06-01 09:18:53] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 1 ms to minimize.
[2024-06-01 09:18:53] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-06-01 09:18:59] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 0 ms to minimize.
[2024-06-01 09:18:59] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 1 ms to minimize.
[2024-06-01 09:19:00] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 1 ms to minimize.
[2024-06-01 09:19:00] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 1 ms to minimize.
[2024-06-01 09:19:00] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 1 ms to minimize.
[2024-06-01 09:19:00] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2024-06-01 09:19:01] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 1 ms to minimize.
[2024-06-01 09:19:01] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 1 ms to minimize.
[2024-06-01 09:19:01] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 1 ms to minimize.
[2024-06-01 09:19:01] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 1 ms to minimize.
[2024-06-01 09:19:02] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 1 ms to minimize.
[2024-06-01 09:19:02] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 0 ms to minimize.
[2024-06-01 09:19:02] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 1 ms to minimize.
[2024-06-01 09:19:02] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 1 ms to minimize.
[2024-06-01 09:19:03] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 1 ms to minimize.
[2024-06-01 09:19:03] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 1 ms to minimize.
[2024-06-01 09:19:03] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 1 ms to minimize.
[2024-06-01 09:19:04] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2024-06-01 09:19:04] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 2 ms to minimize.
[2024-06-01 09:19:04] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-06-01 09:19:05] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 1 ms to minimize.
[2024-06-01 09:19:05] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 0 ms to minimize.
[2024-06-01 09:19:05] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 0 ms to minimize.
[2024-06-01 09:19:05] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 0 ms to minimize.
[2024-06-01 09:19:06] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 0 ms to minimize.
[2024-06-01 09:19:09] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 1 ms to minimize.
[2024-06-01 09:19:10] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 0 ms to minimize.
SMT process timed out in 37219ms, After SMT, problems are : Problem set: 0 solved, 903 unsolved
Search for dead transitions found 0 dead transitions in 37227ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38359 ms. Remains : 108/108 places, 920/920 transitions.
Computed a total of 5 stabilizing places and 24 stable transitions
Computed a total of 5 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2790 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (219 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1103692 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 1
Probabilistic random walk after 1103692 steps, saw 204265 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
[2024-06-01 09:19:13] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
[2024-06-01 09:19:13] [INFO ] Invariant cache hit.
[2024-06-01 09:19:13] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 104/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 909/1015 variables, 106/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 254/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1015 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1018 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1018 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1018 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1019 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1019 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1019/1019 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 255/255 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) 104/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:19:14] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 1 ms to minimize.
[2024-06-01 09:19:14] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 1 ms to minimize.
[2024-06-01 09:19:14] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 1 ms to minimize.
[2024-06-01 09:19:14] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 1 ms to minimize.
[2024-06-01 09:19:15] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 1 ms to minimize.
[2024-06-01 09:19:15] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 909/1015 variables, 106/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1015 variables, 254/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:19:16] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 1 ms to minimize.
[2024-06-01 09:19:16] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1015 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1015 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/1018 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1018 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1018 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:19:16] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1018 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1018 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1019 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1019 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1019 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3548ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6970 reset in 332 ms.
Product exploration explored 100000 steps with 6992 reset in 354 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 920/920 transitions.
Applied a total of 0 rules in 45 ms. Remains 108 /108 variables (removed 0) and now considering 920/920 (removed 0) transitions.
[2024-06-01 09:19:17] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
[2024-06-01 09:19:17] [INFO ] Invariant cache hit.
[2024-06-01 09:19:18] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-06-01 09:19:18] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
[2024-06-01 09:19:18] [INFO ] Invariant cache hit.
[2024-06-01 09:19:18] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 09:19:18] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2024-06-01 09:19:18] [INFO ] Redundant transitions in 17 ms returned []
Running 903 sub problems to find dead transitions.
[2024-06-01 09:19:18] [INFO ] Flow matrix only has 911 transitions (discarded 9 similar events)
[2024-06-01 09:19:18] [INFO ] Invariant cache hit.
[2024-06-01 09:19:18] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 903 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-06-01 09:19:30] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 0 ms to minimize.
[2024-06-01 09:19:30] [INFO ] Deduced a trap composed of 23 places in 327 ms of which 1 ms to minimize.
[2024-06-01 09:19:30] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 1 ms to minimize.
[2024-06-01 09:19:31] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 0 ms to minimize.
[2024-06-01 09:19:31] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 1 ms to minimize.
[2024-06-01 09:19:31] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 1 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 1 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 1 ms to minimize.
[2024-06-01 09:19:32] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 0 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 1 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 1 ms to minimize.
[2024-06-01 09:19:33] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 1 ms to minimize.
[2024-06-01 09:19:36] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2024-06-01 09:19:36] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 0 ms to minimize.
[2024-06-01 09:19:36] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2024-06-01 09:19:36] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 0 ms to minimize.
[2024-06-01 09:19:38] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2024-06-01 09:19:38] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 1 ms to minimize.
[2024-06-01 09:19:38] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 1 ms to minimize.
[2024-06-01 09:19:44] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 1 ms to minimize.
[2024-06-01 09:19:45] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 1 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 0 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 28 places in 291 ms of which 1 ms to minimize.
[2024-06-01 09:19:46] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 1 ms to minimize.
[2024-06-01 09:19:47] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 1 ms to minimize.
[2024-06-01 09:19:47] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 1 ms to minimize.
[2024-06-01 09:19:47] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 0 ms to minimize.
[2024-06-01 09:19:47] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 0 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 1 ms to minimize.
[2024-06-01 09:19:48] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 1 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 0 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 1 ms to minimize.
[2024-06-01 09:19:49] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 903 unsolved
[2024-06-01 09:19:50] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 1 ms to minimize.
[2024-06-01 09:19:50] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 0 ms to minimize.
[2024-06-01 09:19:51] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 1 ms to minimize.
[2024-06-01 09:19:51] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 1 ms to minimize.
[2024-06-01 09:19:51] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 1 ms to minimize.
[2024-06-01 09:19:55] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 1 ms to minimize.
[2024-06-01 09:19:55] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 1 ms to minimize.
[2024-06-01 09:19:56] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 1 ms to minimize.
SMT process timed out in 37138ms, After SMT, problems are : Problem set: 0 solved, 903 unsolved
Search for dead transitions found 0 dead transitions in 37147ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38297 ms. Remains : 108/108 places, 920/920 transitions.
Treatment of property StigmergyCommit-PT-07b-LTLCardinality-05 finished in 133296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F(p1)))))'
Support contains 3 out of 1618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1618/1618 places, 15120/15120 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1609 transition count 15111
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1609 transition count 15111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1609 transition count 15110
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 1602 transition count 15103
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 1602 transition count 15103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 1597 transition count 15098
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 1597 transition count 15098
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1597 transition count 15097
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 1594 transition count 15094
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 1594 transition count 15094
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 1594 transition count 15093
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 1593 transition count 15092
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 1593 transition count 15092
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 1592 transition count 15091
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 1592 transition count 15091
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 1591 transition count 15090
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 1591 transition count 15090
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 1590 transition count 15089
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 1590 transition count 15089
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 1589 transition count 15088
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 1589 transition count 15088
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 1588 transition count 15087
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 1588 transition count 15087
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 1587 transition count 15086
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 1587 transition count 15086
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 1586 transition count 15085
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 1586 transition count 15085
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 1585 transition count 15084
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 1585 transition count 15084
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 1584 transition count 15083
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 1584 transition count 15083
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 1583 transition count 15082
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 1583 transition count 15082
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 1582 transition count 15081
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 1582 transition count 15081
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 1581 transition count 15080
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 1581 transition count 15080
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 1580 transition count 15079
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 1580 transition count 15079
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 1579 transition count 15078
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 1579 transition count 15078
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 1579 transition count 15077
Applied a total of 82 rules in 3047 ms. Remains 1579 /1618 variables (removed 39) and now considering 15077/15120 (removed 43) transitions.
// Phase 1: matrix 15077 rows 1579 cols
[2024-06-01 09:20:00] [INFO ] Computed 9 invariants in 244 ms
[2024-06-01 09:20:05] [INFO ] Implicit Places using invariants in 4501 ms returned []
Implicit Place search using SMT only with invariants took 4502 ms to find 0 implicit places.
Running 15076 sub problems to find dead transitions.
[2024-06-01 09:20:05] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1578/16656 variables, and 0 constraints, problems are : Problem set: 0 solved, 15076 unsolved in 30179 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1579 constraints, PredecessorRefiner: 15076/1906 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15076 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1578/16656 variables, and 0 constraints, problems are : Problem set: 0 solved, 15076 unsolved in 30159 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1579 constraints, PredecessorRefiner: 13170/1906 constraints, Known Traps: 0/0 constraints]
After SMT, in 257370ms problems are : Problem set: 0 solved, 15076 unsolved
Search for dead transitions found 0 dead transitions in 257505ms
Starting structural reductions in LTL mode, iteration 1 : 1579/1618 places, 15077/15120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265101 ms. Remains : 1579/1618 places, 15077/15120 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-07b-LTLCardinality-07
Stuttering criterion allowed to conclude after 134 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07b-LTLCardinality-07 finished in 265357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||p1))))'
Support contains 4 out of 1618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1618/1618 places, 15120/15120 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1610 transition count 15112
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1610 transition count 15112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1610 transition count 15111
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 1604 transition count 15105
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 1604 transition count 15105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 1600 transition count 15101
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 1600 transition count 15101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 1600 transition count 15100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 1597 transition count 15097
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 1597 transition count 15097
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 1597 transition count 15096
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 1596 transition count 15095
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 1596 transition count 15095
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 1595 transition count 15094
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 1595 transition count 15094
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 1594 transition count 15093
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 1594 transition count 15093
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 1593 transition count 15092
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 1593 transition count 15092
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 1592 transition count 15091
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 1592 transition count 15091
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 1591 transition count 15090
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 1591 transition count 15090
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 1590 transition count 15089
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 1590 transition count 15089
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 1589 transition count 15088
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 1589 transition count 15088
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 1588 transition count 15087
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 1588 transition count 15087
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 1588 transition count 15086
Applied a total of 64 rules in 1919 ms. Remains 1588 /1618 variables (removed 30) and now considering 15086/15120 (removed 34) transitions.
// Phase 1: matrix 15086 rows 1588 cols
[2024-06-01 09:24:25] [INFO ] Computed 9 invariants in 257 ms
[2024-06-01 09:24:29] [INFO ] Implicit Places using invariants in 4428 ms returned []
Implicit Place search using SMT only with invariants took 4433 ms to find 0 implicit places.
Running 15085 sub problems to find dead transitions.
[2024-06-01 09:24:29] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1587/16674 variables, and 0 constraints, problems are : Problem set: 0 solved, 15085 unsolved in 30181 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1588 constraints, PredecessorRefiner: 15085/1915 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1587/16674 variables, and 0 constraints, problems are : Problem set: 0 solved, 15085 unsolved in 30186 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1588 constraints, PredecessorRefiner: 13170/1915 constraints, Known Traps: 0/0 constraints]
After SMT, in 260330ms problems are : Problem set: 0 solved, 15085 unsolved
Search for dead transitions found 0 dead transitions in 260477ms
Starting structural reductions in LTL mode, iteration 1 : 1588/1618 places, 15086/15120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266870 ms. Remains : 1588/1618 places, 15086/15120 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-07b-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 1080 ms.
Product exploration explored 100000 steps with 50000 reset in 1411 ms.
Computed a total of 328 stabilizing places and 344 stable transitions
Computed a total of 328 stabilizing places and 344 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-07b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-07b-LTLCardinality-09 finished in 269706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1618/1618 places, 15120/15120 transitions.
Graph (trivial) has 1614 edges and 1618 vertex of which 138 / 1618 are part of one of the 24 SCC in 1 ms
Free SCC test removed 114 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1114 transitions
Trivial Post-agglo rules discarded 1114 transitions
Performed 1114 trivial Post agglomeration. Transition count delta: 1114
Iterating post reduction 0 with 1114 rules applied. Total rules applied 1115 place count 1503 transition count 13875
Reduce places removed 1114 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 1138 rules applied. Total rules applied 2253 place count 389 transition count 13851
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 2261 place count 381 transition count 13851
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 2261 place count 381 transition count 13765
Deduced a syphon composed of 86 places in 5 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 2433 place count 295 transition count 13765
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2444 place count 284 transition count 13754
Iterating global reduction 3 with 11 rules applied. Total rules applied 2455 place count 284 transition count 13754
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2457 place count 282 transition count 13752
Iterating global reduction 3 with 2 rules applied. Total rules applied 2459 place count 282 transition count 13752
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2460 place count 281 transition count 13751
Iterating global reduction 3 with 1 rules applied. Total rules applied 2461 place count 281 transition count 13751
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2462 place count 281 transition count 13750
Performed 64 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 2590 place count 217 transition count 13683
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 2639 place count 168 transition count 1032
Iterating global reduction 4 with 49 rules applied. Total rules applied 2688 place count 168 transition count 1032
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2712 place count 168 transition count 1008
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2737 place count 143 transition count 975
Iterating global reduction 5 with 25 rules applied. Total rules applied 2762 place count 143 transition count 975
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2786 place count 119 transition count 943
Iterating global reduction 5 with 24 rules applied. Total rules applied 2810 place count 119 transition count 943
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 2818 place count 119 transition count 935
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2842 place count 107 transition count 942
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2843 place count 106 transition count 926
Iterating global reduction 6 with 1 rules applied. Total rules applied 2844 place count 106 transition count 926
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2845 place count 106 transition count 925
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 2853 place count 106 transition count 917
Applied a total of 2853 rules in 1642 ms. Remains 106 /1618 variables (removed 1512) and now considering 917/15120 (removed 14203) transitions.
[2024-06-01 09:28:54] [INFO ] Flow matrix only has 908 transitions (discarded 9 similar events)
// Phase 1: matrix 908 rows 106 cols
[2024-06-01 09:28:54] [INFO ] Computed 2 invariants in 16 ms
[2024-06-01 09:28:54] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-01 09:28:54] [INFO ] Flow matrix only has 908 transitions (discarded 9 similar events)
[2024-06-01 09:28:54] [INFO ] Invariant cache hit.
[2024-06-01 09:28:54] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 09:28:55] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2024-06-01 09:28:55] [INFO ] Redundant transitions in 16 ms returned []
Running 900 sub problems to find dead transitions.
[2024-06-01 09:28:55] [INFO ] Flow matrix only has 908 transitions (discarded 9 similar events)
[2024-06-01 09:28:55] [INFO ] Invariant cache hit.
[2024-06-01 09:28:55] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 900 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 900 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 900 unsolved
[2024-06-01 09:29:08] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 1 ms to minimize.
[2024-06-01 09:29:08] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 0 ms to minimize.
[2024-06-01 09:29:09] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 1 ms to minimize.
[2024-06-01 09:29:09] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 3 ms to minimize.
[2024-06-01 09:29:09] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 1 ms to minimize.
[2024-06-01 09:29:10] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 1 ms to minimize.
[2024-06-01 09:29:10] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 1 ms to minimize.
[2024-06-01 09:29:10] [INFO ] Deduced a trap composed of 26 places in 328 ms of which 1 ms to minimize.
[2024-06-01 09:29:11] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 0 ms to minimize.
[2024-06-01 09:29:11] [INFO ] Deduced a trap composed of 34 places in 321 ms of which 1 ms to minimize.
[2024-06-01 09:29:11] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 1 ms to minimize.
[2024-06-01 09:29:12] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 0 ms to minimize.
[2024-06-01 09:29:12] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 1 ms to minimize.
[2024-06-01 09:29:12] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 1 ms to minimize.
[2024-06-01 09:29:12] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 1 ms to minimize.
[2024-06-01 09:29:13] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 1 ms to minimize.
[2024-06-01 09:29:13] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 1 ms to minimize.
[2024-06-01 09:29:13] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 1 ms to minimize.
[2024-06-01 09:29:16] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 1 ms to minimize.
[2024-06-01 09:29:16] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 900 unsolved
[2024-06-01 09:29:18] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 1 ms to minimize.
[2024-06-01 09:29:19] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 1 ms to minimize.
[2024-06-01 09:29:19] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 0 ms to minimize.
[2024-06-01 09:29:19] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 1 ms to minimize.
[2024-06-01 09:29:19] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 1 ms to minimize.
[2024-06-01 09:29:20] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 1 ms to minimize.
[2024-06-01 09:29:20] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 0 ms to minimize.
[2024-06-01 09:29:20] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 1 ms to minimize.
[2024-06-01 09:29:21] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 0 ms to minimize.
[2024-06-01 09:29:21] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 1 ms to minimize.
[2024-06-01 09:29:23] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 0 ms to minimize.
[2024-06-01 09:29:25] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 1 ms to minimize.
[2024-06-01 09:29:25] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 0 ms to minimize.
[2024-06-01 09:29:26] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 0 ms to minimize.
[2024-06-01 09:29:26] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 1 ms to minimize.
[2024-06-01 09:29:26] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 1 ms to minimize.
[2024-06-01 09:29:26] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 1 ms to minimize.
[2024-06-01 09:29:27] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 0 ms to minimize.
[2024-06-01 09:29:27] [INFO ] Deduced a trap composed of 29 places in 270 ms of which 1 ms to minimize.
[2024-06-01 09:29:27] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 900 unsolved
[2024-06-01 09:29:31] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 1 ms to minimize.
[2024-06-01 09:29:32] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2024-06-01 09:29:32] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
[2024-06-01 09:29:32] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 1 ms to minimize.
[2024-06-01 09:29:33] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 1 ms to minimize.
[2024-06-01 09:29:33] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 1 ms to minimize.
[2024-06-01 09:29:33] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 1 ms to minimize.
[2024-06-01 09:29:33] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 1 ms to minimize.
[2024-06-01 09:29:34] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 0 ms to minimize.
SMT process timed out in 38477ms, After SMT, problems are : Problem set: 0 solved, 900 unsolved
Search for dead transitions found 0 dead transitions in 38485ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/1618 places, 917/15120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41401 ms. Remains : 106/1618 places, 917/15120 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07b-LTLCardinality-12
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07b-LTLCardinality-12 finished in 41449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 1618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1618/1618 places, 15120/15120 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1611 transition count 15113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1611 transition count 15113
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1604 transition count 15106
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1604 transition count 15106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1599 transition count 15101
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1599 transition count 15101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 1595 transition count 15097
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 1595 transition count 15097
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1595 transition count 15096
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1593 transition count 15094
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1593 transition count 15094
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 1591 transition count 15092
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 1591 transition count 15092
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 1589 transition count 15090
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 1589 transition count 15090
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1587 transition count 15088
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1587 transition count 15088
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 1585 transition count 15086
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 1585 transition count 15086
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 1583 transition count 15084
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 1583 transition count 15084
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 1581 transition count 15082
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 1581 transition count 15082
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 1579 transition count 15080
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 1579 transition count 15080
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 1577 transition count 15078
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 1577 transition count 15078
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 1577 transition count 15077
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1576 transition count 15076
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1576 transition count 15076
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1575 transition count 15075
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1575 transition count 15075
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1574 transition count 15074
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1574 transition count 15074
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 1573 transition count 15073
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 1573 transition count 15073
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 1572 transition count 15072
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 1572 transition count 15072
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 1571 transition count 15071
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 1571 transition count 15071
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 1571 transition count 15070
Applied a total of 97 rules in 2860 ms. Remains 1571 /1618 variables (removed 47) and now considering 15070/15120 (removed 50) transitions.
// Phase 1: matrix 15070 rows 1571 cols
[2024-06-01 09:29:37] [INFO ] Computed 9 invariants in 238 ms
[2024-06-01 09:29:41] [INFO ] Implicit Places using invariants in 4206 ms returned []
Implicit Place search using SMT only with invariants took 4207 ms to find 0 implicit places.
Running 15069 sub problems to find dead transitions.
[2024-06-01 09:29:41] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1570/16641 variables, and 0 constraints, problems are : Problem set: 0 solved, 15069 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1571 constraints, PredecessorRefiner: 15069/1899 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15069 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1570/16641 variables, and 0 constraints, problems are : Problem set: 0 solved, 15069 unsolved in 30155 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/1571 constraints, PredecessorRefiner: 13170/1899 constraints, Known Traps: 0/0 constraints]
After SMT, in 267309ms problems are : Problem set: 0 solved, 15069 unsolved
Search for dead transitions found 0 dead transitions in 267440ms
Starting structural reductions in LTL mode, iteration 1 : 1571/1618 places, 15070/15120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274533 ms. Remains : 1571/1618 places, 15070/15120 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07b-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 930 ms.
Product exploration explored 100000 steps with 50000 reset in 893 ms.
Computed a total of 328 stabilizing places and 344 stable transitions
Computed a total of 328 stabilizing places and 344 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-07b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-07b-LTLCardinality-15 finished in 276685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 09:34:12] [INFO ] Flatten gal took : 1095 ms
[2024-06-01 09:34:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 09:34:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1618 places, 15120 transitions and 217778 arcs took 107 ms.
Total runtime 1816056 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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