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-171690532000292.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 StigmergyElection-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532000292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 11 18:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 203K 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 StigmergyElection-PT-04b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717245652194

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:40:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:40:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:40:53] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-01 12:40:53] [INFO ] Transformed 563 places.
[2024-06-01 12:40:53] [INFO ] Transformed 780 transitions.
[2024-06-01 12:40:53] [INFO ] Found NUPN structural information;
[2024-06-01 12:40:53] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA StigmergyElection-PT-04b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-04b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 493 transition count 710
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 493 transition count 710
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 175 place count 458 transition count 675
Iterating global reduction 0 with 35 rules applied. Total rules applied 210 place count 458 transition count 675
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 217 place count 451 transition count 668
Iterating global reduction 0 with 7 rules applied. Total rules applied 224 place count 451 transition count 668
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 227 place count 448 transition count 665
Iterating global reduction 0 with 3 rules applied. Total rules applied 230 place count 448 transition count 665
Applied a total of 230 rules in 141 ms. Remains 448 /563 variables (removed 115) and now considering 665/780 (removed 115) transitions.
// Phase 1: matrix 665 rows 448 cols
[2024-06-01 12:40:53] [INFO ] Computed 5 invariants in 31 ms
[2024-06-01 12:40:54] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-06-01 12:40:54] [INFO ] Invariant cache hit.
[2024-06-01 12:40:54] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 664 sub problems to find dead transitions.
[2024-06-01 12:40:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2024-06-01 12:41:05] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 28 ms to minimize.
[2024-06-01 12:41:06] [INFO ] Deduced a trap composed of 165 places in 168 ms of which 4 ms to minimize.
[2024-06-01 12:41:06] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 2 ms to minimize.
[2024-06-01 12:41:07] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 2 ms to minimize.
[2024-06-01 12:41:08] [INFO ] Deduced a trap composed of 165 places in 128 ms of which 2 ms to minimize.
[2024-06-01 12:41:09] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:41:09] [INFO ] Deduced a trap composed of 169 places in 134 ms of which 2 ms to minimize.
[2024-06-01 12:41:09] [INFO ] Deduced a trap composed of 166 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:41:09] [INFO ] Deduced a trap composed of 164 places in 135 ms of which 3 ms to minimize.
[2024-06-01 12:41:09] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 3 ms to minimize.
[2024-06-01 12:41:09] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 3 ms to minimize.
[2024-06-01 12:41:10] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 2 ms to minimize.
[2024-06-01 12:41:10] [INFO ] Deduced a trap composed of 163 places in 133 ms of which 2 ms to minimize.
[2024-06-01 12:41:10] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 3 ms to minimize.
[2024-06-01 12:41:10] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 2 ms to minimize.
[2024-06-01 12:41:10] [INFO ] Deduced a trap composed of 168 places in 131 ms of which 2 ms to minimize.
[2024-06-01 12:41:10] [INFO ] Deduced a trap composed of 169 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2024-06-01 12:41:13] [INFO ] Deduced a trap composed of 167 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:41:13] [INFO ] Deduced a trap composed of 167 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:41:15] [INFO ] Deduced a trap composed of 165 places in 135 ms of which 2 ms to minimize.
[2024-06-01 12:41:15] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 3 ms to minimize.
[2024-06-01 12:41:16] [INFO ] Deduced a trap composed of 167 places in 127 ms of which 2 ms to minimize.
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 2 ms to minimize.
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 2 ms to minimize.
[2024-06-01 12:41:17] [INFO ] Deduced a trap composed of 163 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:41:18] [INFO ] Deduced a trap composed of 167 places in 125 ms of which 2 ms to minimize.
[2024-06-01 12:41:18] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/1113 variables, and 32 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (OVERLAPS) 1/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2024-06-01 12:41:31] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 6 ms to minimize.
[2024-06-01 12:41:32] [INFO ] Deduced a trap composed of 167 places in 135 ms of which 2 ms to minimize.
[2024-06-01 12:41:33] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 3 ms to minimize.
[2024-06-01 12:41:33] [INFO ] Deduced a trap composed of 163 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 5 (OVERLAPS) 665/1113 variables, 448/484 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1113 variables, 664/1148 constraints. Problems are: Problem set: 0 solved, 664 unsolved
[2024-06-01 12:41:48] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 3 ms to minimize.
[2024-06-01 12:41:49] [INFO ] Deduced a trap composed of 167 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:41:51] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 4 ms to minimize.
[2024-06-01 12:41:51] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 5 ms to minimize.
[2024-06-01 12:41:53] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1113/1113 variables, and 1153 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 36/36 constraints]
After SMT, in 60538ms problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Starting structural reductions in LTL mode, iteration 1 : 448/563 places, 665/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61383 ms. Remains : 448/563 places, 665/780 transitions.
Support contains 36 out of 448 places after structural reductions.
[2024-06-01 12:41:55] [INFO ] Flatten gal took : 75 ms
[2024-06-01 12:41:55] [INFO ] Flatten gal took : 40 ms
[2024-06-01 12:41:55] [INFO ] Input system was already deterministic with 665 transitions.
RANDOM walk for 40000 steps (548 resets) in 1642 ms. (24 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40004 steps (105 resets) in 293 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (111 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (111 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (109 resets) in 220 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (80 resets) in 95 ms. (416 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (107 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (93 resets) in 99 ms. (400 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (108 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (109 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (111 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (109 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (109 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (108 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
[2024-06-01 12:41:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 430/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 665/1113 variables, 448/453 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 12:41:57] [INFO ] Deduced a trap composed of 167 places in 135 ms of which 3 ms to minimize.
[2024-06-01 12:41:57] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1113 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 12:41:57] [INFO ] Deduced a trap composed of 165 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1113 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1113 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1113 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 456 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1610 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 430/448 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 12:41:58] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 3 ms to minimize.
[2024-06-01 12:41:58] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 2 ms to minimize.
[2024-06-01 12:41:58] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
[2024-06-01 12:41:59] [INFO ] Deduced a trap composed of 165 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 665/1113 variables, 448/460 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1113 variables, 11/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/1113 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1113/1113 variables, and 471 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1876 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 7/7 constraints]
After SMT, in 3508ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 9 properties in 2843 ms.
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 454 edges and 448 vertex of which 61 / 448 are part of one of the 11 SCC in 6 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 762 edges and 398 vertex of which 394 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 282 rules applied. Total rules applied 284 place count 394 transition count 315
Reduce places removed 278 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 286 rules applied. Total rules applied 570 place count 116 transition count 307
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 575 place count 112 transition count 306
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 578 place count 111 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 579 place count 110 transition count 304
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 22 Pre rules applied. Total rules applied 579 place count 110 transition count 282
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 623 place count 88 transition count 282
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 625 place count 86 transition count 279
Iterating global reduction 5 with 2 rules applied. Total rules applied 627 place count 86 transition count 279
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 628 place count 86 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 629 place count 85 transition count 278
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 630 place count 84 transition count 276
Iterating global reduction 7 with 1 rules applied. Total rules applied 631 place count 84 transition count 276
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 8 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 669 place count 65 transition count 257
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 676 place count 65 transition count 250
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 690 place count 51 transition count 108
Iterating global reduction 8 with 14 rules applied. Total rules applied 704 place count 51 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 713 place count 51 transition count 99
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 715 place count 49 transition count 97
Iterating global reduction 9 with 2 rules applied. Total rules applied 717 place count 49 transition count 97
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 727 place count 44 transition count 92
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 9 with 6 rules applied. Total rules applied 733 place count 41 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 742 place count 41 transition count 91
Free-agglomeration rule applied 21 times.
Iterating global reduction 9 with 21 rules applied. Total rules applied 763 place count 41 transition count 70
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 30 rules applied. Total rules applied 793 place count 20 transition count 61
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 797 place count 16 transition count 57
Iterating global reduction 10 with 4 rules applied. Total rules applied 801 place count 16 transition count 57
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 808 place count 16 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 815 place count 16 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 816 place count 15 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 817 place count 14 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 817 place count 14 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 819 place count 13 transition count 41
Performed 5 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 831 place count 6 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 841 place count 6 transition count 7
Applied a total of 841 rules in 137 ms. Remains 6 /448 variables (removed 442) and now considering 7/665 (removed 658) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 6/448 places, 7/665 transitions.
RANDOM walk for 92 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/2 properties
FORMULA StigmergyElection-PT-04b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 60 stabilizing places and 64 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' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(F(p2)&&(!p0 U (p1||G(!p0)))))))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 452 edges and 448 vertex of which 68 / 448 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 265 place count 391 transition count 336
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 272 rules applied. Total rules applied 537 place count 127 transition count 328
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 542 place count 123 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 543 place count 122 transition count 327
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 543 place count 122 transition count 311
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 575 place count 106 transition count 311
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 580 place count 101 transition count 305
Iterating global reduction 4 with 5 rules applied. Total rules applied 585 place count 101 transition count 305
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 586 place count 101 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 587 place count 100 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 587 place count 100 transition count 303
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 589 place count 99 transition count 303
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 590 place count 98 transition count 301
Iterating global reduction 6 with 1 rules applied. Total rules applied 591 place count 98 transition count 301
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 592 place count 97 transition count 299
Iterating global reduction 6 with 1 rules applied. Total rules applied 593 place count 97 transition count 299
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
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 625 place count 81 transition count 283
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 636 place count 70 transition count 189
Iterating global reduction 6 with 11 rules applied. Total rules applied 647 place count 70 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 651 place count 70 transition count 185
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 654 place count 67 transition count 179
Iterating global reduction 7 with 3 rules applied. Total rules applied 657 place count 67 transition count 179
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 660 place count 64 transition count 173
Iterating global reduction 7 with 3 rules applied. Total rules applied 663 place count 64 transition count 173
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 683 place count 54 transition count 196
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 684 place count 53 transition count 188
Iterating global reduction 7 with 1 rules applied. Total rules applied 685 place count 53 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 686 place count 53 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 690 place count 53 transition count 183
Applied a total of 690 rules in 72 ms. Remains 53 /448 variables (removed 395) and now considering 183/665 (removed 482) transitions.
[2024-06-01 12:42:03] [INFO ] Flow matrix only has 178 transitions (discarded 5 similar events)
// Phase 1: matrix 178 rows 53 cols
[2024-06-01 12:42:03] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 12:42:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 12:42:03] [INFO ] Flow matrix only has 178 transitions (discarded 5 similar events)
[2024-06-01 12:42:03] [INFO ] Invariant cache hit.
[2024-06-01 12:42:03] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:42:03] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-06-01 12:42:03] [INFO ] Redundant transitions in 7 ms returned []
Running 166 sub problems to find dead transitions.
[2024-06-01 12:42:03] [INFO ] Flow matrix only has 178 transitions (discarded 5 similar events)
[2024-06-01 12:42:03] [INFO ] Invariant cache hit.
[2024-06-01 12:42:03] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 12:42:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-01 12:42:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:42:04] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:42:04] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:42:04] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:42:04] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:42:04] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:42:04] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:42:04] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 12:42:05] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 177/230 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 31/96 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 12:42:06] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:42:06] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 1/231 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (OVERLAPS) 0/231 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 99 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6435 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 177/230 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 166/264 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 12:42:13] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 1/231 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-01 12:42:19] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 267 constraints, problems are : Problem set: 0 solved, 166 unsolved in 15880 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 14/14 constraints]
After SMT, in 22493ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 22495ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/448 places, 183/665 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22709 ms. Remains : 53/448 places, 183/665 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-00
Stuttering criterion allowed to conclude after 99 steps with 13 reset in 2 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-00 finished in 23036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)||p0))&&(p2 U (p3||G(p2)))))'
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 442 transition count 659
Applied a total of 12 rules in 33 ms. Remains 442 /448 variables (removed 6) and now considering 659/665 (removed 6) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-06-01 12:42:26] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 12:42:26] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 12:42:26] [INFO ] Invariant cache hit.
[2024-06-01 12:42:27] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-06-01 12:42:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:42:36] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 3 ms to minimize.
[2024-06-01 12:42:36] [INFO ] Deduced a trap composed of 163 places in 117 ms of which 3 ms to minimize.
[2024-06-01 12:42:37] [INFO ] Deduced a trap composed of 162 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:42:37] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:42:38] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:42:38] [INFO ] Deduced a trap composed of 163 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:42:38] [INFO ] Deduced a trap composed of 219 places in 134 ms of which 3 ms to minimize.
[2024-06-01 12:42:38] [INFO ] Deduced a trap composed of 162 places in 122 ms of which 2 ms to minimize.
[2024-06-01 12:42:38] [INFO ] Deduced a trap composed of 164 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:42:38] [INFO ] Deduced a trap composed of 164 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:42:39] [INFO ] Deduced a trap composed of 163 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:42:39] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 2 ms to minimize.
[2024-06-01 12:42:39] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 166 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 165 places in 117 ms of which 2 ms to minimize.
[2024-06-01 12:42:40] [INFO ] Deduced a trap composed of 163 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:42:41] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 2 ms to minimize.
[2024-06-01 12:42:41] [INFO ] Deduced a trap composed of 163 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:42:42] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:42:42] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 2 ms to minimize.
[2024-06-01 12:42:42] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
[2024-06-01 12:42:42] [INFO ] Deduced a trap composed of 163 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:42:43] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:42:43] [INFO ] Deduced a trap composed of 164 places in 114 ms of which 2 ms to minimize.
[2024-06-01 12:42:44] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:42:44] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:42:44] [INFO ] Deduced a trap composed of 164 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:42:45] [INFO ] Deduced a trap composed of 165 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:42:46] [INFO ] Deduced a trap composed of 166 places in 109 ms of which 3 ms to minimize.
[2024-06-01 12:42:48] [INFO ] Deduced a trap composed of 192 places in 137 ms of which 3 ms to minimize.
[2024-06-01 12:42:48] [INFO ] Deduced a trap composed of 163 places in 129 ms of which 2 ms to minimize.
[2024-06-01 12:42:48] [INFO ] Deduced a trap composed of 166 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:42:48] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 40 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:43:05] [INFO ] Deduced a trap composed of 164 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:43:12] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:43:15] [INFO ] Deduced a trap composed of 164 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:43:16] [INFO ] Deduced a trap composed of 164 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1101 variables, and 44 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 39/39 constraints]
After SMT, in 60264ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Starting structural reductions in LTL mode, iteration 1 : 442/448 places, 659/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60717 ms. Remains : 442/448 places, 659/665 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p3 p2 p0 p1), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) p2))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 14 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-04b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-04b-LTLFireability-02 finished in 61367 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((G((F(p0)&&F(G(p1)))) U p2)))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 451 edges and 448 vertex of which 68 / 448 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 263 place count 391 transition count 338
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 270 rules applied. Total rules applied 533 place count 129 transition count 330
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 539 place count 125 transition count 328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 541 place count 123 transition count 328
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 541 place count 123 transition count 312
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 573 place count 107 transition count 312
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 579 place count 101 transition count 305
Iterating global reduction 4 with 6 rules applied. Total rules applied 585 place count 101 transition count 305
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 586 place count 101 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 587 place count 100 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 587 place count 100 transition count 303
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 589 place count 99 transition count 303
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 590 place count 98 transition count 301
Iterating global reduction 6 with 1 rules applied. Total rules applied 591 place count 98 transition count 301
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 592 place count 97 transition count 299
Iterating global reduction 6 with 1 rules applied. Total rules applied 593 place count 97 transition count 299
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
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 625 place count 81 transition count 283
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 638 place count 68 transition count 163
Iterating global reduction 6 with 13 rules applied. Total rules applied 651 place count 68 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 657 place count 68 transition count 157
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 660 place count 65 transition count 151
Iterating global reduction 7 with 3 rules applied. Total rules applied 663 place count 65 transition count 151
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 666 place count 62 transition count 145
Iterating global reduction 7 with 3 rules applied. Total rules applied 669 place count 62 transition count 145
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 687 place count 53 transition count 162
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 688 place count 52 transition count 154
Iterating global reduction 7 with 1 rules applied. Total rules applied 689 place count 52 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 690 place count 52 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 694 place count 52 transition count 149
Applied a total of 694 rules in 78 ms. Remains 52 /448 variables (removed 396) and now considering 149/665 (removed 516) transitions.
[2024-06-01 12:43:28] [INFO ] Flow matrix only has 144 transitions (discarded 5 similar events)
// Phase 1: matrix 144 rows 52 cols
[2024-06-01 12:43:28] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:43:28] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 12:43:28] [INFO ] Flow matrix only has 144 transitions (discarded 5 similar events)
[2024-06-01 12:43:28] [INFO ] Invariant cache hit.
[2024-06-01 12:43:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:43:28] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-01 12:43:28] [INFO ] Redundant transitions in 4 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 12:43:28] [INFO ] Flow matrix only has 144 transitions (discarded 5 similar events)
[2024-06-01 12:43:28] [INFO ] Invariant cache hit.
[2024-06-01 12:43:28] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 12:43:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:43:28] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:43:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:43:28] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:43:28] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:43:29] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:43:29] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:43:29] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:43:29] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:43:29] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 143/195 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 31/95 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 12:43:30] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 12:43:30] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 98 constraints, problems are : Problem set: 0 solved, 140 unsolved in 5509 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 143/195 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 31/97 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 140/237 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 1/196 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 12:43:38] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 239 constraints, problems are : Problem set: 0 solved, 140 unsolved in 9928 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 13/13 constraints]
After SMT, in 15514ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 15515ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/448 places, 149/665 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15835 ms. Remains : 52/448 places, 149/665 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-04 finished in 16046 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 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 442 transition count 659
Applied a total of 12 rules in 31 ms. Remains 442 /448 variables (removed 6) and now considering 659/665 (removed 6) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-06-01 12:43:44] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 12:43:44] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 12:43:44] [INFO ] Invariant cache hit.
[2024-06-01 12:43:44] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-06-01 12:43:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 162 places in 143 ms of which 3 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 163 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 162 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 163 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:43:56] [INFO ] Deduced a trap composed of 219 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:43:56] [INFO ] Deduced a trap composed of 162 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:43:56] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:43:56] [INFO ] Deduced a trap composed of 164 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:43:56] [INFO ] Deduced a trap composed of 163 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:43:56] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:43:57] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 2 ms to minimize.
[2024-06-01 12:43:57] [INFO ] Deduced a trap composed of 165 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 166 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 165 places in 124 ms of which 2 ms to minimize.
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 163 places in 96 ms of which 1 ms to minimize.
[2024-06-01 12:43:59] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 2 ms to minimize.
[2024-06-01 12:43:59] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:43:59] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:44:00] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 2 ms to minimize.
[2024-06-01 12:44:00] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-06-01 12:44:00] [INFO ] Deduced a trap composed of 163 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:44:00] [INFO ] Deduced a trap composed of 165 places in 115 ms of which 3 ms to minimize.
[2024-06-01 12:44:01] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 2 ms to minimize.
[2024-06-01 12:44:02] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:44:02] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 3 ms to minimize.
[2024-06-01 12:44:02] [INFO ] Deduced a trap composed of 164 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:44:03] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:44:04] [INFO ] Deduced a trap composed of 166 places in 110 ms of which 3 ms to minimize.
[2024-06-01 12:44:05] [INFO ] Deduced a trap composed of 192 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:44:05] [INFO ] Deduced a trap composed of 163 places in 115 ms of which 3 ms to minimize.
[2024-06-01 12:44:06] [INFO ] Deduced a trap composed of 166 places in 105 ms of which 3 ms to minimize.
[2024-06-01 12:44:06] [INFO ] Deduced a trap composed of 164 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 40 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:44:22] [INFO ] Deduced a trap composed of 164 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:44:30] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:44:32] [INFO ] Deduced a trap composed of 164 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:44:33] [INFO ] Deduced a trap composed of 164 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 658 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 442/1101 variables, and 44 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 39/39 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60251ms
Starting structural reductions in LTL mode, iteration 1 : 442/448 places, 659/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60684 ms. Remains : 442/448 places, 659/665 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 490 steps with 6 reset in 3 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-06 finished in 60774 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 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 442 transition count 659
Applied a total of 12 rules in 30 ms. Remains 442 /448 variables (removed 6) and now considering 659/665 (removed 6) transitions.
[2024-06-01 12:44:44] [INFO ] Invariant cache hit.
[2024-06-01 12:44:44] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 12:44:44] [INFO ] Invariant cache hit.
[2024-06-01 12:44:45] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-06-01 12:44:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:44:55] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 3 ms to minimize.
[2024-06-01 12:44:55] [INFO ] Deduced a trap composed of 163 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:44:55] [INFO ] Deduced a trap composed of 162 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:44:55] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:44:56] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:44:56] [INFO ] Deduced a trap composed of 163 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:44:57] [INFO ] Deduced a trap composed of 219 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:44:57] [INFO ] Deduced a trap composed of 162 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:44:57] [INFO ] Deduced a trap composed of 164 places in 114 ms of which 2 ms to minimize.
[2024-06-01 12:44:57] [INFO ] Deduced a trap composed of 164 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:44:57] [INFO ] Deduced a trap composed of 163 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:44:57] [INFO ] Deduced a trap composed of 165 places in 128 ms of which 3 ms to minimize.
[2024-06-01 12:44:57] [INFO ] Deduced a trap composed of 164 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:44:58] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:44:59] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
[2024-06-01 12:44:59] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:44:59] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:44:59] [INFO ] Deduced a trap composed of 163 places in 101 ms of which 3 ms to minimize.
[2024-06-01 12:45:00] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:45:00] [INFO ] Deduced a trap composed of 163 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:45:00] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 2 ms to minimize.
[2024-06-01 12:45:00] [INFO ] Deduced a trap composed of 164 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:45:01] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 2 ms to minimize.
[2024-06-01 12:45:01] [INFO ] Deduced a trap composed of 163 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:45:01] [INFO ] Deduced a trap composed of 165 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:45:01] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 2 ms to minimize.
[2024-06-01 12:45:02] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 2 ms to minimize.
[2024-06-01 12:45:02] [INFO ] Deduced a trap composed of 165 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:45:03] [INFO ] Deduced a trap composed of 164 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:45:04] [INFO ] Deduced a trap composed of 165 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:45:05] [INFO ] Deduced a trap composed of 166 places in 108 ms of which 1 ms to minimize.
[2024-06-01 12:45:06] [INFO ] Deduced a trap composed of 192 places in 133 ms of which 3 ms to minimize.
[2024-06-01 12:45:06] [INFO ] Deduced a trap composed of 163 places in 118 ms of which 3 ms to minimize.
[2024-06-01 12:45:06] [INFO ] Deduced a trap composed of 166 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:45:06] [INFO ] Deduced a trap composed of 164 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 40 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:45:23] [INFO ] Deduced a trap composed of 164 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:45:31] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:45:33] [INFO ] Deduced a trap composed of 164 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:45:34] [INFO ] Deduced a trap composed of 164 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1101 variables, and 44 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 0/658 constraints, Known Traps: 39/39 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in LTL mode, iteration 1 : 442/448 places, 659/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60686 ms. Remains : 442/448 places, 659/665 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-07
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-07 finished in 60768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 455 edges and 448 vertex of which 68 / 448 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 268 rules applied. Total rules applied 269 place count 391 transition count 332
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 276 rules applied. Total rules applied 545 place count 123 transition count 324
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 551 place count 119 transition count 322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 553 place count 117 transition count 322
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 553 place count 117 transition count 307
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 583 place count 102 transition count 307
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 589 place count 96 transition count 300
Iterating global reduction 4 with 6 rules applied. Total rules applied 595 place count 96 transition count 300
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 596 place count 96 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 597 place count 95 transition count 299
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 597 place count 95 transition count 298
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 599 place count 94 transition count 298
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 600 place count 93 transition count 296
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 93 transition count 296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 602 place count 92 transition count 294
Iterating global reduction 6 with 1 rules applied. Total rules applied 603 place count 92 transition count 294
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
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 635 place count 76 transition count 278
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 649 place count 62 transition count 139
Iterating global reduction 6 with 14 rules applied. Total rules applied 663 place count 62 transition count 139
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 671 place count 62 transition count 131
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 674 place count 59 transition count 125
Iterating global reduction 7 with 3 rules applied. Total rules applied 677 place count 59 transition count 125
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 680 place count 56 transition count 119
Iterating global reduction 7 with 3 rules applied. Total rules applied 683 place count 56 transition count 119
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 703 place count 46 transition count 142
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 704 place count 45 transition count 134
Iterating global reduction 7 with 1 rules applied. Total rules applied 705 place count 45 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 706 place count 45 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 710 place count 45 transition count 129
Applied a total of 710 rules in 41 ms. Remains 45 /448 variables (removed 403) and now considering 129/665 (removed 536) transitions.
[2024-06-01 12:45:45] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
// Phase 1: matrix 124 rows 45 cols
[2024-06-01 12:45:45] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:45:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 12:45:45] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2024-06-01 12:45:45] [INFO ] Invariant cache hit.
[2024-06-01 12:45:45] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:45:45] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-06-01 12:45:45] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
[2024-06-01 12:45:45] [INFO ] Flow matrix only has 124 transitions (discarded 5 similar events)
[2024-06-01 12:45:45] [INFO ] Invariant cache hit.
[2024-06-01 12:45:45] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 2/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 12:45:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:45:46] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:45:46] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:45:46] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:45:46] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:45:46] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:45:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 12:45:46] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 12:45:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 123/168 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 31/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-01 12:45:47] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 1/169 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 0/169 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 89 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3661 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 2/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 123/168 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 31/88 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 112/200 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 1/169 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 201 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4936 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 10/10 constraints]
After SMT, in 8655ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 8656ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/448 places, 129/665 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8841 ms. Remains : 45/448 places, 129/665 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-08
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-08 finished in 8931 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(((p1||X(X(F((p1||X(p2))))))&&p0)))'
Support contains 9 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 445 transition count 662
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 442 transition count 659
Applied a total of 12 rules in 23 ms. Remains 442 /448 variables (removed 6) and now considering 659/665 (removed 6) transitions.
// Phase 1: matrix 659 rows 442 cols
[2024-06-01 12:45:54] [INFO ] Computed 5 invariants in 6 ms
[2024-06-01 12:45:54] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 12:45:54] [INFO ] Invariant cache hit.
[2024-06-01 12:45:54] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 658 sub problems to find dead transitions.
[2024-06-01 12:45:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:46:04] [INFO ] Deduced a trap composed of 162 places in 152 ms of which 3 ms to minimize.
[2024-06-01 12:46:04] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:46:04] [INFO ] Deduced a trap composed of 162 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:46:05] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:46:05] [INFO ] Deduced a trap composed of 165 places in 115 ms of which 3 ms to minimize.
[2024-06-01 12:46:05] [INFO ] Deduced a trap composed of 163 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:46:06] [INFO ] Deduced a trap composed of 219 places in 130 ms of which 4 ms to minimize.
[2024-06-01 12:46:06] [INFO ] Deduced a trap composed of 162 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:46:06] [INFO ] Deduced a trap composed of 164 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:46:06] [INFO ] Deduced a trap composed of 164 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:46:06] [INFO ] Deduced a trap composed of 163 places in 105 ms of which 1 ms to minimize.
[2024-06-01 12:46:06] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 2 ms to minimize.
[2024-06-01 12:46:07] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 2 ms to minimize.
[2024-06-01 12:46:07] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:46:08] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 2 ms to minimize.
[2024-06-01 12:46:08] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 2 ms to minimize.
[2024-06-01 12:46:08] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:46:08] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:46:09] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:46:09] [INFO ] Deduced a trap composed of 163 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:46:09] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:46:10] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 3 ms to minimize.
[2024-06-01 12:46:10] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 2 ms to minimize.
[2024-06-01 12:46:10] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:46:10] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:46:11] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 3 ms to minimize.
[2024-06-01 12:46:12] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:46:12] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:46:12] [INFO ] Deduced a trap composed of 164 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:46:13] [INFO ] Deduced a trap composed of 165 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:46:14] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:46:15] [INFO ] Deduced a trap composed of 192 places in 131 ms of which 2 ms to minimize.
[2024-06-01 12:46:15] [INFO ] Deduced a trap composed of 163 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:46:15] [INFO ] Deduced a trap composed of 166 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:46:16] [INFO ] Deduced a trap composed of 164 places in 112 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:46:24] [INFO ] Deduced a trap composed of 164 places in 102 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1101 variables, and 41 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:46:30] [INFO ] Deduced a trap composed of 164 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:46:31] [INFO ] Deduced a trap composed of 164 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:46:33] [INFO ] Deduced a trap composed of 164 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 5 (OVERLAPS) 659/1101 variables, 442/486 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1101 variables, 658/1144 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-06-01 12:46:53] [INFO ] Deduced a trap composed of 166 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1101/1101 variables, and 1145 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 40/40 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 442/448 places, 659/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60666 ms. Remains : 442/448 places, 659/665 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-09
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-09 finished in 60852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 446 transition count 663
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 446 transition count 663
Applied a total of 4 rules in 15 ms. Remains 446 /448 variables (removed 2) and now considering 663/665 (removed 2) transitions.
// Phase 1: matrix 663 rows 446 cols
[2024-06-01 12:46:55] [INFO ] Computed 5 invariants in 7 ms
[2024-06-01 12:46:55] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 12:46:55] [INFO ] Invariant cache hit.
[2024-06-01 12:46:55] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 662 sub problems to find dead transitions.
[2024-06-01 12:46:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-06-01 12:47:06] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 3 ms to minimize.
[2024-06-01 12:47:06] [INFO ] Deduced a trap composed of 167 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:47:06] [INFO ] Deduced a trap composed of 164 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:47:06] [INFO ] Deduced a trap composed of 162 places in 108 ms of which 3 ms to minimize.
[2024-06-01 12:47:07] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 3 ms to minimize.
[2024-06-01 12:47:07] [INFO ] Deduced a trap composed of 219 places in 132 ms of which 2 ms to minimize.
[2024-06-01 12:47:07] [INFO ] Deduced a trap composed of 163 places in 125 ms of which 3 ms to minimize.
[2024-06-01 12:47:07] [INFO ] Deduced a trap composed of 163 places in 114 ms of which 2 ms to minimize.
[2024-06-01 12:47:07] [INFO ] Deduced a trap composed of 162 places in 102 ms of which 1 ms to minimize.
[2024-06-01 12:47:08] [INFO ] Deduced a trap composed of 167 places in 123 ms of which 3 ms to minimize.
[2024-06-01 12:47:08] [INFO ] Deduced a trap composed of 165 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:47:08] [INFO ] Deduced a trap composed of 165 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:47:09] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 3 ms to minimize.
[2024-06-01 12:47:09] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 2 ms to minimize.
[2024-06-01 12:47:09] [INFO ] Deduced a trap composed of 167 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:47:09] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
[2024-06-01 12:47:09] [INFO ] Deduced a trap composed of 163 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:47:10] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 3 ms to minimize.
[2024-06-01 12:47:10] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 2 ms to minimize.
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 222 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-06-01 12:47:11] [INFO ] Deduced a trap composed of 169 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:47:13] [INFO ] Deduced a trap composed of 168 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:47:13] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 2 ms to minimize.
[2024-06-01 12:47:16] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:47:16] [INFO ] Deduced a trap composed of 167 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:47:16] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 2 ms to minimize.
[2024-06-01 12:47:16] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:47:16] [INFO ] Deduced a trap composed of 220 places in 117 ms of which 2 ms to minimize.
[2024-06-01 12:47:16] [INFO ] Deduced a trap composed of 169 places in 114 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1109 variables, and 34 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 662 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-06-01 12:47:35] [INFO ] Deduced a trap composed of 164 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 662 unsolved
[2024-06-01 12:47:37] [INFO ] Deduced a trap composed of 168 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 6 (OVERLAPS) 663/1109 variables, 446/482 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1109 variables, 662/1144 constraints. Problems are: Problem set: 0 solved, 662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1144 constraints, problems are : Problem set: 0 solved, 662 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 662/662 constraints, Known Traps: 31/31 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 662 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 446/448 places, 663/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60722 ms. Remains : 446/448 places, 663/665 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-10
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-10 finished in 60889 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)))'
Support contains 4 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 454 edges and 448 vertex of which 68 / 448 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 267 place count 391 transition count 334
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 274 rules applied. Total rules applied 541 place count 125 transition count 326
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 547 place count 121 transition count 324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 549 place count 119 transition count 324
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 549 place count 119 transition count 308
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 581 place count 103 transition count 308
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 587 place count 97 transition count 301
Iterating global reduction 4 with 6 rules applied. Total rules applied 593 place count 97 transition count 301
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 594 place count 97 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 595 place count 96 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 595 place count 96 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 597 place count 95 transition count 299
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 598 place count 94 transition count 297
Iterating global reduction 6 with 1 rules applied. Total rules applied 599 place count 94 transition count 297
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 600 place count 93 transition count 295
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 93 transition count 295
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
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 633 place count 77 transition count 279
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 648 place count 62 transition count 139
Iterating global reduction 6 with 15 rules applied. Total rules applied 663 place count 62 transition count 139
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 671 place count 62 transition count 131
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 674 place count 59 transition count 125
Iterating global reduction 7 with 3 rules applied. Total rules applied 677 place count 59 transition count 125
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 679 place count 57 transition count 121
Iterating global reduction 7 with 2 rules applied. Total rules applied 681 place count 57 transition count 121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 701 place count 47 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 711 place count 47 transition count 136
Applied a total of 711 rules in 33 ms. Remains 47 /448 variables (removed 401) and now considering 136/665 (removed 529) transitions.
[2024-06-01 12:47:56] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 47 cols
[2024-06-01 12:47:56] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:47:56] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 12:47:56] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2024-06-01 12:47:56] [INFO ] Invariant cache hit.
[2024-06-01 12:47:56] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:47:56] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-06-01 12:47:56] [INFO ] Redundant transitions in 1 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-01 12:47:56] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2024-06-01 12:47:56] [INFO ] Invariant cache hit.
[2024-06-01 12:47:56] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:47:56] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:47:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:47:56] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:47:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:47:56] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:47:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:47:57] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:47:57] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:47:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:47:57] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:47:57] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:47:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:47:57] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 130/177 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:47:59] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 95 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4132 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:48:00] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 130/177 variables, 47/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 31/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 118/213 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:48:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:48:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:48:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (OVERLAPS) 1/178 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 14 (OVERLAPS) 0/178 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 217 constraints, problems are : Problem set: 0 solved, 118 unsolved in 7921 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 18/18 constraints]
After SMT, in 12114ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 12117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/448 places, 136/665 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12338 ms. Remains : 47/448 places, 136/665 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-04b-LTLFireability-12 finished in 12421 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||F(p1)||X((p2 U (p3||G(p2))))))))'
Support contains 3 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 446 transition count 663
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 443 transition count 660
Applied a total of 10 rules in 36 ms. Remains 443 /448 variables (removed 5) and now considering 660/665 (removed 5) transitions.
// Phase 1: matrix 660 rows 443 cols
[2024-06-01 12:48:08] [INFO ] Computed 5 invariants in 9 ms
[2024-06-01 12:48:08] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 12:48:08] [INFO ] Invariant cache hit.
[2024-06-01 12:48:09] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2024-06-01 12:48:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:48:18] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 2 ms to minimize.
[2024-06-01 12:48:19] [INFO ] Deduced a trap composed of 165 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:48:19] [INFO ] Deduced a trap composed of 164 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:48:20] [INFO ] Deduced a trap composed of 220 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:48:20] [INFO ] Deduced a trap composed of 163 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:48:20] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:48:20] [INFO ] Deduced a trap composed of 165 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:48:21] [INFO ] Deduced a trap composed of 166 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:48:21] [INFO ] Deduced a trap composed of 163 places in 134 ms of which 2 ms to minimize.
[2024-06-01 12:48:21] [INFO ] Deduced a trap composed of 165 places in 128 ms of which 2 ms to minimize.
[2024-06-01 12:48:22] [INFO ] Deduced a trap composed of 163 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:48:22] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 3 ms to minimize.
[2024-06-01 12:48:22] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 3 ms to minimize.
[2024-06-01 12:48:22] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 2 ms to minimize.
[2024-06-01 12:48:23] [INFO ] Deduced a trap composed of 219 places in 121 ms of which 3 ms to minimize.
[2024-06-01 12:48:23] [INFO ] Deduced a trap composed of 163 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:48:23] [INFO ] Deduced a trap composed of 165 places in 124 ms of which 2 ms to minimize.
[2024-06-01 12:48:24] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 2 ms to minimize.
[2024-06-01 12:48:24] [INFO ] Deduced a trap composed of 164 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:48:24] [INFO ] Deduced a trap composed of 163 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:48:27] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:48:27] [INFO ] Deduced a trap composed of 218 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:48:27] [INFO ] Deduced a trap composed of 166 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 218 places in 138 ms of which 2 ms to minimize.
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 166 places in 141 ms of which 2 ms to minimize.
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 2 ms to minimize.
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 2 ms to minimize.
[2024-06-01 12:48:29] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:48:36] [INFO ] Deduced a trap composed of 166 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:48:36] [INFO ] Deduced a trap composed of 165 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:48:38] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1103 variables, and 36 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:48:47] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
[2024-06-01 12:48:47] [INFO ] Deduced a trap composed of 166 places in 117 ms of which 2 ms to minimize.
[2024-06-01 12:48:48] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:48:48] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 2 ms to minimize.
[2024-06-01 12:48:48] [INFO ] Deduced a trap composed of 164 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:48:48] [INFO ] Deduced a trap composed of 163 places in 126 ms of which 2 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 166 places in 125 ms of which 2 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 193 places in 130 ms of which 3 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 165 places in 124 ms of which 2 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 200 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 163 places in 99 ms of which 1 ms to minimize.
[2024-06-01 12:48:49] [INFO ] Deduced a trap composed of 164 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:48:52] [INFO ] Deduced a trap composed of 164 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:48:54] [INFO ] Deduced a trap composed of 162 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:48:54] [INFO ] Deduced a trap composed of 165 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 6 (OVERLAPS) 660/1103 variables, 443/495 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 659/1154 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1103/1103 variables, and 1154 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 47/47 constraints]
After SMT, in 60266ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Starting structural reductions in LTL mode, iteration 1 : 443/448 places, 660/665 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60727 ms. Remains : 443/448 places, 660/665 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-13
Product exploration explored 100000 steps with 1362 reset in 175 ms.
Product exploration explored 100000 steps with 352 reset in 117 ms.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 79 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (539 resets) in 303 ms. (131 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (107 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (110 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (109 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (110 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
[2024-06-01 12:49:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 214/217 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/443 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 660/1103 variables, 443/448 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1103 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 448 constraints, problems are : Problem set: 1 solved, 3 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 215/217 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/443 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 12:49:10] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 3 ms to minimize.
[2024-06-01 12:49:10] [INFO ] Deduced a trap composed of 164 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 660/1103 variables, 443/450 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 3/453 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 12:49:11] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1103 variables, 1/454 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1103 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1103 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1103 variables, and 454 constraints, problems are : Problem set: 1 solved, 3 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1151ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 268 ms.
Support contains 2 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 660/660 transitions.
Graph (trivial) has 450 edges and 443 vertex of which 61 / 443 are part of one of the 11 SCC in 1 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 757 edges and 393 vertex of which 389 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 276 rules applied. Total rules applied 278 place count 389 transition count 316
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 283 rules applied. Total rules applied 561 place count 117 transition count 305
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 567 place count 111 transition count 305
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 567 place count 111 transition count 283
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 611 place count 89 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 612 place count 89 transition count 282
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 654 place count 68 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 661 place count 68 transition count 254
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 677 place count 52 transition count 109
Iterating global reduction 5 with 16 rules applied. Total rules applied 693 place count 52 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 702 place count 52 transition count 100
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 705 place count 49 transition count 97
Iterating global reduction 6 with 3 rules applied. Total rules applied 708 place count 49 transition count 97
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 718 place count 44 transition count 92
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 726 place count 40 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 727 place count 40 transition count 99
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 735 place count 40 transition count 91
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 756 place count 40 transition count 70
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 782 place count 19 transition count 65
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 786 place count 15 transition count 61
Iterating global reduction 8 with 4 rules applied. Total rules applied 790 place count 15 transition count 61
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 801 place count 15 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 808 place count 15 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 809 place count 14 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 810 place count 13 transition count 42
Performed 4 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 820 place count 7 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 829 place count 7 transition count 9
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 11 with 2 rules applied. Total rules applied 831 place count 6 transition count 8
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 832 place count 6 transition count 7
Applied a total of 832 rules in 28 ms. Remains 6 /443 variables (removed 437) and now considering 7/660 (removed 653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 6/443 places, 7/660 transitions.
RANDOM walk for 90 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/3 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR p1 p2 p3)))]
Knowledge based reduction with 12 factoid took 249 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 660/660 transitions.
Applied a total of 0 rules in 8 ms. Remains 443 /443 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-06-01 12:49:12] [INFO ] Invariant cache hit.
[2024-06-01 12:49:12] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 12:49:12] [INFO ] Invariant cache hit.
[2024-06-01 12:49:12] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2024-06-01 12:49:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:49:22] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 3 ms to minimize.
[2024-06-01 12:49:23] [INFO ] Deduced a trap composed of 165 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:49:23] [INFO ] Deduced a trap composed of 164 places in 114 ms of which 2 ms to minimize.
[2024-06-01 12:49:24] [INFO ] Deduced a trap composed of 220 places in 133 ms of which 2 ms to minimize.
[2024-06-01 12:49:24] [INFO ] Deduced a trap composed of 163 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:49:24] [INFO ] Deduced a trap composed of 165 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:49:24] [INFO ] Deduced a trap composed of 165 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:49:25] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 2 ms to minimize.
[2024-06-01 12:49:25] [INFO ] Deduced a trap composed of 163 places in 137 ms of which 3 ms to minimize.
[2024-06-01 12:49:25] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 3 ms to minimize.
[2024-06-01 12:49:25] [INFO ] Deduced a trap composed of 163 places in 122 ms of which 2 ms to minimize.
[2024-06-01 12:49:26] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 3 ms to minimize.
[2024-06-01 12:49:26] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 3 ms to minimize.
[2024-06-01 12:49:26] [INFO ] Deduced a trap composed of 166 places in 139 ms of which 3 ms to minimize.
[2024-06-01 12:49:27] [INFO ] Deduced a trap composed of 219 places in 131 ms of which 3 ms to minimize.
[2024-06-01 12:49:27] [INFO ] Deduced a trap composed of 163 places in 121 ms of which 3 ms to minimize.
[2024-06-01 12:49:27] [INFO ] Deduced a trap composed of 165 places in 125 ms of which 3 ms to minimize.
[2024-06-01 12:49:27] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 2 ms to minimize.
[2024-06-01 12:49:28] [INFO ] Deduced a trap composed of 164 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:49:28] [INFO ] Deduced a trap composed of 163 places in 138 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:49:31] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 3 ms to minimize.
[2024-06-01 12:49:31] [INFO ] Deduced a trap composed of 218 places in 138 ms of which 2 ms to minimize.
[2024-06-01 12:49:31] [INFO ] Deduced a trap composed of 166 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:49:32] [INFO ] Deduced a trap composed of 218 places in 140 ms of which 2 ms to minimize.
[2024-06-01 12:49:33] [INFO ] Deduced a trap composed of 166 places in 145 ms of which 2 ms to minimize.
[2024-06-01 12:49:33] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 2 ms to minimize.
[2024-06-01 12:49:33] [INFO ] Deduced a trap composed of 166 places in 132 ms of which 3 ms to minimize.
[2024-06-01 12:49:33] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:49:40] [INFO ] Deduced a trap composed of 166 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:49:40] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:49:42] [INFO ] Deduced a trap composed of 163 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1103 variables, and 36 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:49:50] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 3 ms to minimize.
[2024-06-01 12:49:51] [INFO ] Deduced a trap composed of 166 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:49:51] [INFO ] Deduced a trap composed of 165 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 166 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 164 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 163 places in 128 ms of which 2 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 166 places in 123 ms of which 2 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 2 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 193 places in 128 ms of which 2 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 2 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 200 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 163 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:49:53] [INFO ] Deduced a trap composed of 164 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:49:56] [INFO ] Deduced a trap composed of 164 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:49:57] [INFO ] Deduced a trap composed of 162 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:49:58] [INFO ] Deduced a trap composed of 165 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 6 (OVERLAPS) 660/1103 variables, 443/495 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 659/1154 constraints. Problems are: Problem set: 0 solved, 659 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 1103/1103 variables, and 1154 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 47/47 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Finished structural reductions in LTL mode , in 1 iterations and 60636 ms. Remains : 443/443 places, 660/660 transitions.
Computed a total of 60 stabilizing places and 64 stable transitions
Computed a total of 60 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (545 resets) in 116 ms. (341 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (109 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (108 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (107 resets) in 26 ms. (1481 steps per ms) remains 3/3 properties
[2024-06-01 12:50:13] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 215/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/443 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 660/1103 variables, 443/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1103 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 448 constraints, problems are : Problem set: 0 solved, 3 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 215/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/443 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:50:13] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 2 ms to minimize.
[2024-06-01 12:50:14] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 660/1103 variables, 443/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 12:50:14] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1103 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1103 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1103 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1103 variables, and 454 constraints, problems are : Problem set: 0 solved, 3 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1137ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 190 ms.
Support contains 2 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 660/660 transitions.
Graph (trivial) has 450 edges and 443 vertex of which 61 / 443 are part of one of the 11 SCC in 0 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 757 edges and 393 vertex of which 389 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 276 rules applied. Total rules applied 278 place count 389 transition count 316
Reduce places removed 272 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 283 rules applied. Total rules applied 561 place count 117 transition count 305
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 567 place count 111 transition count 305
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 567 place count 111 transition count 283
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 611 place count 89 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 612 place count 89 transition count 282
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 654 place count 68 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 661 place count 68 transition count 254
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 677 place count 52 transition count 109
Iterating global reduction 5 with 16 rules applied. Total rules applied 693 place count 52 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 702 place count 52 transition count 100
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 705 place count 49 transition count 97
Iterating global reduction 6 with 3 rules applied. Total rules applied 708 place count 49 transition count 97
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 718 place count 44 transition count 92
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 726 place count 40 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 727 place count 40 transition count 99
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 735 place count 40 transition count 91
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 756 place count 40 transition count 70
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 782 place count 19 transition count 65
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 786 place count 15 transition count 61
Iterating global reduction 8 with 4 rules applied. Total rules applied 790 place count 15 transition count 61
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 801 place count 15 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 808 place count 15 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 809 place count 14 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 810 place count 13 transition count 42
Performed 4 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 820 place count 7 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 829 place count 7 transition count 9
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 11 with 2 rules applied. Total rules applied 831 place count 6 transition count 8
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 832 place count 6 transition count 7
Applied a total of 832 rules in 28 ms. Remains 6 /443 variables (removed 437) and now considering 7/660 (removed 653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 6/443 places, 7/660 transitions.
RANDOM walk for 67 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p1 p2 p3))), (F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 247 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 1361 reset in 105 ms.
Product exploration explored 100000 steps with 1363 reset in 212 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 443/443 places, 660/660 transitions.
Graph (trivial) has 448 edges and 443 vertex of which 61 / 443 are part of one of the 11 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Performed 263 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 263 rules applied. Total rules applied 264 place count 393 transition count 603
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 270 place count 393 transition count 598
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 270 place count 393 transition count 603
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 280 place count 393 transition count 603
Discarding 222 places :
Symmetric choice reduction at 2 with 222 rule applications. Total rules 502 place count 171 transition count 381
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 724 place count 171 transition count 381
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 757 place count 171 transition count 381
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 802 place count 126 transition count 204
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 847 place count 126 transition count 204
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 856 place count 126 transition count 195
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 872 place count 110 transition count 176
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 888 place count 110 transition count 176
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 891 place count 107 transition count 173
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 894 place count 107 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 895 place count 107 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 896 place count 106 transition count 172
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 897 place count 106 transition count 172
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 907 place count 106 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 908 place count 106 transition count 229
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 921 place count 93 transition count 203
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 4 with 13 rules applied. Total rules applied 934 place count 93 transition count 203
Deduced a syphon composed of 43 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 946 place count 93 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 947 place count 93 transition count 204
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 948 place count 92 transition count 202
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 949 place count 92 transition count 202
Deduced a syphon composed of 43 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 953 place count 92 transition count 198
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 953 rules in 57 ms. Remains 92 /443 variables (removed 351) and now considering 198/660 (removed 462) transitions.
[2024-06-01 12:50:16] [INFO ] Redundant transitions in 2 ms returned []
Running 194 sub problems to find dead transitions.
[2024-06-01 12:50:16] [INFO ] Flow matrix only has 193 transitions (discarded 5 similar events)
// Phase 1: matrix 193 rows 92 cols
[2024-06-01 12:50:16] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:50:16] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 9/11 constraints. Problems are: Problem set: 18 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 18 solved, 176 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 4 (OVERLAPS) 192/284 variables, 92/103 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 35/138 constraints. Problems are: Problem set: 75 solved, 119 unsolved
[2024-06-01 12:50:18] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:50:19] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 2/140 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/140 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 1/285 variables, 1/141 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/141 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/141 constraints. Problems are: Problem set: 75 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 141 constraints, problems are : Problem set: 75 solved, 119 unsolved in 6647 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 75 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 44/92 variables, 2/2 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 11/13 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 192/284 variables, 92/105 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 35/140 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 119/259 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/259 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 1/285 variables, 1/260 constraints. Problems are: Problem set: 75 solved, 119 unsolved
[2024-06-01 12:50:26] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 1/261 constraints. Problems are: Problem set: 75 solved, 119 unsolved
[2024-06-01 12:50:28] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 1/262 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/262 constraints. Problems are: Problem set: 75 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/285 variables, 0/262 constraints. Problems are: Problem set: 75 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 262 constraints, problems are : Problem set: 75 solved, 119 unsolved in 9827 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 119/194 constraints, Known Traps: 13/13 constraints]
After SMT, in 16548ms problems are : Problem set: 75 solved, 119 unsolved
Search for dead transitions found 75 dead transitions in 16550ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 92/443 places, 123/660 transitions.
Graph (complete) has 256 edges and 92 vertex of which 49 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 49 /92 variables (removed 43) and now considering 123/123 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/443 places, 123/660 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16633 ms. Remains : 49/443 places, 123/660 transitions.
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 443/443 places, 660/660 transitions.
Applied a total of 0 rules in 20 ms. Remains 443 /443 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 443 cols
[2024-06-01 12:50:32] [INFO ] Computed 5 invariants in 6 ms
[2024-06-01 12:50:33] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 12:50:33] [INFO ] Invariant cache hit.
[2024-06-01 12:50:33] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2024-06-01 12:50:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:50:43] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 2 ms to minimize.
[2024-06-01 12:50:43] [INFO ] Deduced a trap composed of 165 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:50:44] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:50:44] [INFO ] Deduced a trap composed of 220 places in 129 ms of which 2 ms to minimize.
[2024-06-01 12:50:44] [INFO ] Deduced a trap composed of 163 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:50:45] [INFO ] Deduced a trap composed of 165 places in 117 ms of which 2 ms to minimize.
[2024-06-01 12:50:45] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 2 ms to minimize.
[2024-06-01 12:50:46] [INFO ] Deduced a trap composed of 166 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:50:46] [INFO ] Deduced a trap composed of 163 places in 139 ms of which 2 ms to minimize.
[2024-06-01 12:50:46] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:50:46] [INFO ] Deduced a trap composed of 163 places in 126 ms of which 3 ms to minimize.
[2024-06-01 12:50:46] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 3 ms to minimize.
[2024-06-01 12:50:47] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 2 ms to minimize.
[2024-06-01 12:50:47] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 3 ms to minimize.
[2024-06-01 12:50:47] [INFO ] Deduced a trap composed of 219 places in 123 ms of which 2 ms to minimize.
[2024-06-01 12:50:47] [INFO ] Deduced a trap composed of 163 places in 117 ms of which 2 ms to minimize.
[2024-06-01 12:50:48] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:50:48] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 3 ms to minimize.
[2024-06-01 12:50:48] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:50:48] [INFO ] Deduced a trap composed of 163 places in 137 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:50:51] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 2 ms to minimize.
[2024-06-01 12:50:52] [INFO ] Deduced a trap composed of 218 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:50:52] [INFO ] Deduced a trap composed of 166 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:50:53] [INFO ] Deduced a trap composed of 218 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:50:53] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 3 ms to minimize.
[2024-06-01 12:50:54] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 2 ms to minimize.
[2024-06-01 12:50:54] [INFO ] Deduced a trap composed of 166 places in 132 ms of which 2 ms to minimize.
[2024-06-01 12:50:54] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:51:01] [INFO ] Deduced a trap composed of 166 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:51:01] [INFO ] Deduced a trap composed of 165 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:51:03] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1103 variables, and 36 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:51:11] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 3 ms to minimize.
[2024-06-01 12:51:11] [INFO ] Deduced a trap composed of 166 places in 110 ms of which 2 ms to minimize.
[2024-06-01 12:51:12] [INFO ] Deduced a trap composed of 165 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:51:12] [INFO ] Deduced a trap composed of 166 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:51:12] [INFO ] Deduced a trap composed of 164 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:51:12] [INFO ] Deduced a trap composed of 163 places in 129 ms of which 3 ms to minimize.
[2024-06-01 12:51:13] [INFO ] Deduced a trap composed of 166 places in 127 ms of which 2 ms to minimize.
[2024-06-01 12:51:13] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 2 ms to minimize.
[2024-06-01 12:51:13] [INFO ] Deduced a trap composed of 193 places in 132 ms of which 2 ms to minimize.
[2024-06-01 12:51:13] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:51:13] [INFO ] Deduced a trap composed of 200 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:51:13] [INFO ] Deduced a trap composed of 163 places in 97 ms of which 1 ms to minimize.
[2024-06-01 12:51:13] [INFO ] Deduced a trap composed of 164 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-06-01 12:51:16] [INFO ] Deduced a trap composed of 164 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:51:17] [INFO ] Deduced a trap composed of 162 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:51:18] [INFO ] Deduced a trap composed of 165 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 6 (OVERLAPS) 660/1103 variables, 443/495 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 659/1154 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1103/1103 variables, and 1154 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 47/47 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Finished structural reductions in LTL mode , in 1 iterations and 60736 ms. Remains : 443/443 places, 660/660 transitions.
Treatment of property StigmergyElection-PT-04b-LTLFireability-13 finished in 205118 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||F(p1)||X((p2 U (p3||G(p2))))))))'
Found a Lengthening insensitive property : StigmergyElection-PT-04b-LTLFireability-13
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 448 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 448/448 places, 665/665 transitions.
Graph (trivial) has 453 edges and 448 vertex of which 61 / 448 are part of one of the 11 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 267 rules applied. Total rules applied 268 place count 397 transition count 340
Reduce places removed 267 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 278 rules applied. Total rules applied 546 place count 130 transition count 329
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 553 place count 124 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 554 place count 123 transition count 328
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 554 place count 123 transition count 311
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 588 place count 106 transition count 311
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 594 place count 100 transition count 304
Iterating global reduction 4 with 6 rules applied. Total rules applied 600 place count 100 transition count 304
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 601 place count 100 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 602 place count 99 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 602 place count 99 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 604 place count 98 transition count 302
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 605 place count 97 transition count 300
Iterating global reduction 6 with 1 rules applied. Total rules applied 606 place count 97 transition count 300
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 607 place count 96 transition count 298
Iterating global reduction 6 with 1 rules applied. Total rules applied 608 place count 96 transition count 298
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
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 640 place count 80 transition count 282
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 654 place count 66 transition count 144
Iterating global reduction 6 with 14 rules applied. Total rules applied 668 place count 66 transition count 144
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 676 place count 66 transition count 136
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 678 place count 64 transition count 132
Iterating global reduction 7 with 2 rules applied. Total rules applied 680 place count 64 transition count 132
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 682 place count 62 transition count 128
Iterating global reduction 7 with 2 rules applied. Total rules applied 684 place count 62 transition count 128
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
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 708 place count 50 transition count 150
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 709 place count 49 transition count 140
Iterating global reduction 7 with 1 rules applied. Total rules applied 710 place count 49 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 711 place count 49 transition count 139
Applied a total of 711 rules in 30 ms. Remains 49 /448 variables (removed 399) and now considering 139/665 (removed 526) transitions.
[2024-06-01 12:51:34] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
// Phase 1: matrix 134 rows 49 cols
[2024-06-01 12:51:34] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:51:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 12:51:34] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 12:51:34] [INFO ] Invariant cache hit.
[2024-06-01 12:51:34] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:51:34] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 12:51:34] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 12:51:34] [INFO ] Invariant cache hit.
[2024-06-01 12:51:34] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:34] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:51:34] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:51:34] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:51:34] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:51:34] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:51:34] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:51:34] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:51:34] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:51:34] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:35] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 133/182 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:36] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 1/183 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:37] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/183 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 95 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5406 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 133/182 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 122/216 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:40] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:42] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 1/183 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 219 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 14/14 constraints]
After SMT, in 13606ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 13608ms
Starting structural reductions in LI_LTL mode, iteration 1 : 49/448 places, 139/665 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13756 ms. Remains : 49/448 places, 139/665 transitions.
Running random walk in product with property : StigmergyElection-PT-04b-LTLFireability-13
Product exploration explored 100000 steps with 381 reset in 142 ms.
Product exploration explored 100000 steps with 1114 reset in 163 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 118 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (5170 resets) in 175 ms. (227 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (581 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (590 resets) in 19 ms. (2000 steps per ms) remains 1/3 properties
[2024-06-01 12:51:48] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 12:51:48] [INFO ] Invariant cache hit.
[2024-06-01 12:51:48] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 179/183 variables, and 48 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 47/49 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR p1 p2 p3)))]
Knowledge based reduction with 12 factoid took 307 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-06-01 12:51:49] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 12:51:49] [INFO ] Invariant cache hit.
[2024-06-01 12:51:49] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 12:51:49] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 12:51:49] [INFO ] Invariant cache hit.
[2024-06-01 12:51:49] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:51:49] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 12:51:49] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 12:51:49] [INFO ] Invariant cache hit.
[2024-06-01 12:51:49] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:49] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:51:49] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:51:49] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:51:49] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:51:49] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:51:49] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:51:49] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:51:50] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:51:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:50] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 133/182 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:51] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 1/183 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:52] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/183 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 95 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5001 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 133/182 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 122/216 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:51:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 1/183 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 219 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 14/14 constraints]
After SMT, in 13115ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 13116ms
Finished structural reductions in LTL mode , in 1 iterations and 13224 ms. Remains : 49/49 places, 139/139 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (5221 resets) in 193 ms. (206 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (569 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (578 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
[2024-06-01 12:52:02] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 12:52:02] [INFO ] Invariant cache hit.
[2024-06-01 12:52:02] [INFO ] State equation strengthened by 32 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/179 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/182 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 83 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:52:02] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:52:02] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:52:02] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 132/179 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 31/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:52:03] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/182 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/183 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/183 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p1 p2 p3))), (F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 294 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 360 reset in 44 ms.
Product exploration explored 100000 steps with 649 reset in 42 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1)]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 139/139 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 135
Applied a total of 4 rules in 9 ms. Remains 49 /49 variables (removed 0) and now considering 135/139 (removed 4) transitions.
[2024-06-01 12:52:04] [INFO ] Redundant transitions in 1 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-01 12:52:04] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
// Phase 1: matrix 130 rows 49 cols
[2024-06-01 12:52:04] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:52:04] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:52:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:52:04] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:52:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:52:04] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:52:04] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:52:04] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:52:04] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:52:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:52:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:52:05] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:52:05] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 129/178 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 1/179 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 94 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3277 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:52:07] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:52:07] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:52:07] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 129/178 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 31/96 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 118/214 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:52:09] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 1/179 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 12:52:12] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 14 (OVERLAPS) 0/179 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 217 constraints, problems are : Problem set: 0 solved, 118 unsolved in 8262 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 16/16 constraints]
After SMT, in 11597ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 11598ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/49 places, 135/139 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11612 ms. Remains : 49/49 places, 135/139 transitions.
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-06-01 12:52:15] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
// Phase 1: matrix 134 rows 49 cols
[2024-06-01 12:52:15] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:52:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 12:52:15] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 12:52:15] [INFO ] Invariant cache hit.
[2024-06-01 12:52:15] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 12:52:15] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 12:52:15] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 12:52:15] [INFO ] Invariant cache hit.
[2024-06-01 12:52:15] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:52:16] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:52:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:52:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:52:16] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:52:16] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:52:16] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:52:16] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:52:16] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:52:16] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:52:17] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 133/182 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:52:17] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 1/183 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:52:19] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/183 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 95 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4946 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 133/182 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 122/216 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:52:22] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 12:52:23] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 1/183 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 219 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7811 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 14/14 constraints]
After SMT, in 12828ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 12829ms
Finished structural reductions in LTL mode , in 1 iterations and 12936 ms. Remains : 49/49 places, 139/139 transitions.
Treatment of property StigmergyElection-PT-04b-LTLFireability-13 finished in 55124 ms.
[2024-06-01 12:52:28] [INFO ] Flatten gal took : 38 ms
[2024-06-01 12:52:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 12:52:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 448 places, 665 transitions and 2450 arcs took 7 ms.
Total runtime 695598 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-04b-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717246711442

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyElection-PT-04b-LTLFireability-13
ltl formula formula --ltl=/tmp/2960/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 448 places, 665 transitions and 2450 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2960/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2960/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2960/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.020 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2960/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 450 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 449, there are 679 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~79 levels ~10000 states ~30816 transitions
pnml2lts-mc( 1/ 4): ~81 levels ~20000 states ~51632 transitions
pnml2lts-mc( 1/ 4): ~81 levels ~40000 states ~104252 transitions
pnml2lts-mc( 1/ 4): ~81 levels ~80000 states ~221900 transitions
pnml2lts-mc( 1/ 4): ~81 levels ~160000 states ~521216 transitions
pnml2lts-mc( 1/ 4): ~89 levels ~320000 states ~1049276 transitions
pnml2lts-mc( 0/ 4): ~87 levels ~640000 states ~1801856 transitions
pnml2lts-mc( 1/ 4): ~89 levels ~1280000 states ~4636052 transitions
pnml2lts-mc( 1/ 4): ~89 levels ~2560000 states ~9249468 transitions
pnml2lts-mc( 1/ 4): ~89 levels ~5120000 states ~19282456 transitions
pnml2lts-mc( 1/ 4): ~89 levels ~10240000 states ~38506568 transitions
pnml2lts-mc( 1/ 4): ~4787 levels ~20480000 states ~78425088 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30846114
pnml2lts-mc( 0/ 4): unique states count: 33542425
pnml2lts-mc( 0/ 4): unique transitions count: 147422926
pnml2lts-mc( 0/ 4): - self-loop count: 3838
pnml2lts-mc( 0/ 4): - claim dead count: 111070684
pnml2lts-mc( 0/ 4): - claim found count: 2789165
pnml2lts-mc( 0/ 4): - claim success count: 33542440
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7501
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33542446 states 147422975 transitions, fanout: 4.395
pnml2lts-mc( 0/ 4): Total exploration time 361.610 sec (361.600 sec minimum, 361.602 sec on average)
pnml2lts-mc( 0/ 4): States per second: 92759, Transitions per second: 407685
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.5MB, 8.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 677 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.5MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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