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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 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 428K 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-05b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717246015158

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-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:46:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:46:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:46:56] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-06-01 12:46:56] [INFO ] Transformed 699 places.
[2024-06-01 12:46:56] [INFO ] Transformed 1266 transitions.
[2024-06-01 12:46:56] [INFO ] Found NUPN structural information;
[2024-06-01 12:46:56] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 225 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 3 formulas.
FORMULA StigmergyElection-PT-05b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 85 place count 614 transition count 1181
Iterating global reduction 0 with 85 rules applied. Total rules applied 170 place count 614 transition count 1181
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 212 place count 572 transition count 1139
Iterating global reduction 0 with 42 rules applied. Total rules applied 254 place count 572 transition count 1139
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 262 place count 564 transition count 1131
Iterating global reduction 0 with 8 rules applied. Total rules applied 270 place count 564 transition count 1131
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 273 place count 561 transition count 1128
Iterating global reduction 0 with 3 rules applied. Total rules applied 276 place count 561 transition count 1128
Applied a total of 276 rules in 173 ms. Remains 561 /699 variables (removed 138) and now considering 1128/1266 (removed 138) transitions.
// Phase 1: matrix 1128 rows 561 cols
[2024-06-01 12:46:56] [INFO ] Computed 6 invariants in 38 ms
[2024-06-01 12:46:57] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-06-01 12:46:57] [INFO ] Invariant cache hit.
[2024-06-01 12:46:57] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Running 1127 sub problems to find dead transitions.
[2024-06-01 12:46:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 1 (OVERLAPS) 1/561 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-06-01 12:47:21] [INFO ] Deduced a trap composed of 166 places in 368 ms of which 36 ms to minimize.
[2024-06-01 12:47:21] [INFO ] Deduced a trap composed of 165 places in 282 ms of which 8 ms to minimize.
[2024-06-01 12:47:23] [INFO ] Deduced a trap composed of 168 places in 274 ms of which 3 ms to minimize.
[2024-06-01 12:47:23] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 2 ms to minimize.
[2024-06-01 12:47:23] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 3 ms to minimize.
[2024-06-01 12:47:24] [INFO ] Deduced a trap composed of 165 places in 227 ms of which 2 ms to minimize.
[2024-06-01 12:47:24] [INFO ] Deduced a trap composed of 167 places in 205 ms of which 2 ms to minimize.
[2024-06-01 12:47:25] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 3 ms to minimize.
[2024-06-01 12:47:26] [INFO ] Deduced a trap composed of 167 places in 232 ms of which 3 ms to minimize.
[2024-06-01 12:47:26] [INFO ] Deduced a trap composed of 170 places in 211 ms of which 3 ms to minimize.
[2024-06-01 12:47:27] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 2 ms to minimize.
[2024-06-01 12:47:27] [INFO ] Deduced a trap composed of 167 places in 218 ms of which 2 ms to minimize.
[2024-06-01 12:47:28] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 2 ms to minimize.
[2024-06-01 12:47:28] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 3 ms to minimize.
[2024-06-01 12:47:28] [INFO ] Deduced a trap composed of 170 places in 243 ms of which 3 ms to minimize.
[2024-06-01 12:47:29] [INFO ] Deduced a trap composed of 168 places in 234 ms of which 3 ms to minimize.
[2024-06-01 12:47:29] [INFO ] Deduced a trap composed of 167 places in 217 ms of which 2 ms to minimize.
[2024-06-01 12:47:29] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1689 variables, and 24 constraints, problems are : Problem set: 0 solved, 1127 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 1127/1127 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 1 (OVERLAPS) 1/561 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-06-01 12:47:41] [INFO ] Deduced a trap composed of 166 places in 275 ms of which 3 ms to minimize.
[2024-06-01 12:47:42] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 3 ms to minimize.
[2024-06-01 12:47:47] [INFO ] Deduced a trap composed of 225 places in 237 ms of which 2 ms to minimize.
[2024-06-01 12:47:48] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 2 ms to minimize.
[2024-06-01 12:47:48] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 2 ms to minimize.
[2024-06-01 12:47:48] [INFO ] Deduced a trap composed of 168 places in 261 ms of which 3 ms to minimize.
[2024-06-01 12:47:49] [INFO ] Deduced a trap composed of 169 places in 271 ms of which 3 ms to minimize.
[2024-06-01 12:47:49] [INFO ] Deduced a trap composed of 193 places in 253 ms of which 3 ms to minimize.
[2024-06-01 12:47:49] [INFO ] Deduced a trap composed of 172 places in 231 ms of which 3 ms to minimize.
[2024-06-01 12:47:49] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 2 ms to minimize.
[2024-06-01 12:47:50] [INFO ] Deduced a trap composed of 167 places in 217 ms of which 3 ms to minimize.
[2024-06-01 12:47:50] [INFO ] Deduced a trap composed of 165 places in 220 ms of which 2 ms to minimize.
[2024-06-01 12:47:50] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 3 ms to minimize.
[2024-06-01 12:47:51] [INFO ] Deduced a trap composed of 167 places in 255 ms of which 4 ms to minimize.
[2024-06-01 12:47:51] [INFO ] Deduced a trap composed of 222 places in 227 ms of which 2 ms to minimize.
[2024-06-01 12:47:51] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 3 ms to minimize.
[2024-06-01 12:47:59] [INFO ] Deduced a trap composed of 167 places in 208 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1689 variables, and 41 constraints, problems are : Problem set: 0 solved, 1127 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 0/1127 constraints, Known Traps: 35/35 constraints]
After SMT, in 62403ms problems are : Problem set: 0 solved, 1127 unsolved
Search for dead transitions found 0 dead transitions in 62431ms
Starting structural reductions in LTL mode, iteration 1 : 561/699 places, 1128/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63361 ms. Remains : 561/699 places, 1128/1266 transitions.
Support contains 58 out of 561 places after structural reductions.
[2024-06-01 12:48:00] [INFO ] Flatten gal took : 141 ms
[2024-06-01 12:48:00] [INFO ] Flatten gal took : 79 ms
[2024-06-01 12:48:00] [INFO ] Input system was already deterministic with 1128 transitions.
Support contains 54 out of 561 places (down from 58) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 36 to 35
RANDOM walk for 40000 steps (448 resets) in 2101 ms. (19 steps per ms) remains 25/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
[2024-06-01 12:48:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 514/561 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 12:48:02] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 3 ms to minimize.
[2024-06-01 12:48:02] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 2 ms to minimize.
[2024-06-01 12:48:03] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 2 ms to minimize.
[2024-06-01 12:48:03] [INFO ] Deduced a trap composed of 165 places in 211 ms of which 3 ms to minimize.
[2024-06-01 12:48:03] [INFO ] Deduced a trap composed of 170 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1128/1689 variables, 561/572 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1689 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/1689 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1689/1689 variables, and 572 constraints, problems are : Problem set: 0 solved, 25 unsolved in 3677 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 514/561 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 5/11 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-01 12:48:05] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 1128/1689 variables, 561/573 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1689 variables, 24/597 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1689 variables, 0/597 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/1689 variables, 0/597 constraints. Problems are: Problem set: 1 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1689/1689 variables, and 597 constraints, problems are : Problem set: 1 solved, 24 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 24/25 constraints, Known Traps: 6/6 constraints]
After SMT, in 8750ms problems are : Problem set: 1 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Graph (trivial) has 486 edges and 561 vertex of which 69 / 561 are part of one of the 12 SCC in 4 ms
Free SCC test removed 57 places
Drop transitions (Empty/Sink Transition effects.) removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1072 edges and 504 vertex of which 500 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 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 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 284 rules applied. Total rules applied 286 place count 500 transition count 768
Reduce places removed 280 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 295 rules applied. Total rules applied 581 place count 220 transition count 753
Reduce places removed 8 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 44 rules applied. Total rules applied 625 place count 212 transition count 717
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 661 place count 176 transition count 717
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 661 place count 176 transition count 695
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 705 place count 154 transition count 695
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 706 place count 153 transition count 693
Iterating global reduction 4 with 1 rules applied. Total rules applied 707 place count 153 transition count 693
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 708 place count 153 transition count 692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 709 place count 152 transition count 692
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 710 place count 151 transition count 690
Iterating global reduction 6 with 1 rules applied. Total rules applied 711 place count 151 transition count 690
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 4 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 755 place count 129 transition count 667
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 760 place count 129 transition count 662
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 763 place count 126 transition count 651
Iterating global reduction 7 with 3 rules applied. Total rules applied 766 place count 126 transition count 651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 767 place count 126 transition count 650
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 783 place count 118 transition count 642
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 793 place count 113 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 795 place count 113 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 796 place count 113 transition count 647
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 797 place count 113 transition count 646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 798 place count 112 transition count 646
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 801 place count 112 transition count 646
Applied a total of 801 rules in 304 ms. Remains 112 /561 variables (removed 449) and now considering 646/1128 (removed 482) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 112/561 places, 646/1128 transitions.
RANDOM walk for 40000 steps (2263 resets) in 484 ms. (82 steps per ms) remains 19/24 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (26 resets) in 9 ms. (400 steps per ms) remains 14/19 properties
BEST_FIRST walk for 4002 steps (20 resets) in 6 ms. (571 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (33 resets) in 7 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (27 resets) in 6 ms. (572 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (14 resets) in 6 ms. (571 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4002 steps (29 resets) in 12 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (31 resets) in 7 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (34 resets) in 8 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (29 resets) in 24 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (31 resets) in 12 ms. (307 steps per ms) remains 12/12 properties
// Phase 1: matrix 646 rows 112 cols
[2024-06-01 12:48:11] [INFO ] Computed 6 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 83/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 3/112 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 646/758 variables, 112/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/758 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/758 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 758/758 variables, and 118 constraints, problems are : Problem set: 0 solved, 12 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 83/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 3/112 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 646/758 variables, 112/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/758 variables, 12/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/758 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/758 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 758/758 variables, and 130 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1298 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 2346ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 8 properties in 1322 ms.
Support contains 13 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 646/646 transitions.
Graph (trivial) has 78 edges and 112 vertex of which 8 / 112 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 522 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 106 transition count 620
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 90 transition count 620
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 35 place count 90 transition count 613
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 49 place count 83 transition count 613
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 79 transition count 609
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 79 transition count 609
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 57 place count 79 transition count 608
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 78 transition count 608
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 76 transition count 526
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 76 transition count 526
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 76 transition count 525
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 3 with 10 rules applied. Total rules applied 74 place count 71 transition count 520
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 71 transition count 517
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 81 place count 67 transition count 513
Iterating global reduction 4 with 4 rules applied. Total rules applied 85 place count 67 transition count 513
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 94 place count 67 transition count 504
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 4 with 2 rules applied. Total rules applied 96 place count 66 transition count 503
Free-agglomeration rule applied 35 times.
Iterating global reduction 4 with 35 rules applied. Total rules applied 131 place count 66 transition count 468
Reduce places removed 35 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 4 with 44 rules applied. Total rules applied 175 place count 31 transition count 459
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 179 place count 27 transition count 455
Iterating global reduction 5 with 4 rules applied. Total rules applied 183 place count 27 transition count 455
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 190 place count 27 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 6 with 126 rules applied. Total rules applied 316 place count 27 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 317 place count 26 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 318 place count 25 transition count 321
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 318 place count 25 transition count 320
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 320 place count 24 transition count 320
Performed 5 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 330 place count 19 transition count 194
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 7 with 77 rules applied. Total rules applied 407 place count 19 transition count 117
Applied a total of 407 rules in 175 ms. Remains 19 /112 variables (removed 93) and now considering 117/646 (removed 529) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 19/112 places, 117/646 transitions.
RANDOM walk for 8727 steps (1178 resets) in 205 ms. (42 steps per ms) remains 0/4 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 75 stabilizing places and 80 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Graph (trivial) has 567 edges and 561 vertex of which 84 / 561 are part of one of the 14 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 335 place count 490 transition count 713
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 344 rules applied. Total rules applied 679 place count 156 transition count 703
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 685 place count 151 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 686 place count 150 transition count 702
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 686 place count 150 transition count 682
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 726 place count 130 transition count 682
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 735 place count 121 transition count 671
Iterating global reduction 4 with 9 rules applied. Total rules applied 744 place count 121 transition count 671
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 745 place count 121 transition count 670
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 746 place count 120 transition count 670
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 746 place count 120 transition count 669
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 748 place count 119 transition count 669
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 751 place count 116 transition count 664
Iterating global reduction 6 with 3 rules applied. Total rules applied 754 place count 116 transition count 664
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 756 place count 114 transition count 660
Iterating global reduction 6 with 2 rules applied. Total rules applied 758 place count 114 transition count 660
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 796 place count 95 transition count 641
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 809 place count 82 transition count 339
Iterating global reduction 6 with 13 rules applied. Total rules applied 822 place count 82 transition count 339
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 828 place count 82 transition count 333
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 831 place count 79 transition count 327
Iterating global reduction 7 with 3 rules applied. Total rules applied 834 place count 79 transition count 327
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 837 place count 76 transition count 321
Iterating global reduction 7 with 3 rules applied. Total rules applied 840 place count 76 transition count 321
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 858 place count 67 transition count 328
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 859 place count 66 transition count 318
Iterating global reduction 7 with 1 rules applied. Total rules applied 860 place count 66 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 861 place count 66 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 866 place count 66 transition count 312
Applied a total of 866 rules in 122 ms. Remains 66 /561 variables (removed 495) and now considering 312/1128 (removed 816) transitions.
[2024-06-01 12:48:15] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
// Phase 1: matrix 306 rows 66 cols
[2024-06-01 12:48:15] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 12:48:15] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 12:48:15] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
[2024-06-01 12:48:15] [INFO ] Invariant cache hit.
[2024-06-01 12:48:15] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 12:48:16] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-06-01 12:48:16] [INFO ] Redundant transitions in 15 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-01 12:48:16] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
[2024-06-01 12:48:16] [INFO ] Invariant cache hit.
[2024-06-01 12:48:16] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 12:48:17] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2024-06-01 12:48:17] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2024-06-01 12:48:17] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2024-06-01 12:48:17] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:48:17] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:48:17] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 12:48:18] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2024-06-01 12:48:18] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2024-06-01 12:48:18] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2024-06-01 12:48:18] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2024-06-01 12:48:18] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 0 ms to minimize.
[2024-06-01 12:48:18] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2024-06-01 12:48:18] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:48:18] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2024-06-01 12:48:19] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:48:19] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:48:19] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:48:19] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 305/371 variables, 66/87 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 30/117 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-01 12:48:22] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2024-06-01 12:48:22] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 120 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13166 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 305/371 variables, 66/89 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 30/119 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 295/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 415 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 20/20 constraints]
After SMT, in 43729ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 43732ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/561 places, 312/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44406 ms. Remains : 66/561 places, 312/1128 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-00
Product exploration explored 100000 steps with 2373 reset in 213 ms.
Product exploration explored 100000 steps with 1014 reset in 97 ms.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 96 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (4239 resets) in 586 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (405 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (310 resets) in 50 ms. (784 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (413 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2024-06-01 12:49:00] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
[2024-06-01 12:49:00] [INFO ] Invariant cache hit.
[2024-06-01 12:49:00] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/64 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 304/368 variables, 64/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 30/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/371 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/372 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 100 constraints, problems are : Problem set: 1 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/64 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 304/368 variables, 64/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 30/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/371 variables, 2/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/372 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/372 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 101 constraints, problems are : Problem set: 1 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 12 factoid took 152 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLFireability-00 finished in 46023 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 U p1)) U p2))'
Support contains 7 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Graph (trivial) has 559 edges and 561 vertex of which 86 / 561 are part of one of the 15 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 489 transition count 716
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 341 rules applied. Total rules applied 673 place count 158 transition count 706
Reduce places removed 5 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 12 rules applied. Total rules applied 685 place count 153 transition count 699
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 692 place count 146 transition count 699
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 692 place count 146 transition count 680
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 730 place count 127 transition count 680
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 739 place count 118 transition count 669
Iterating global reduction 4 with 9 rules applied. Total rules applied 748 place count 118 transition count 669
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 749 place count 118 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 750 place count 117 transition count 668
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 750 place count 117 transition count 667
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 752 place count 116 transition count 667
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 755 place count 113 transition count 662
Iterating global reduction 6 with 3 rules applied. Total rules applied 758 place count 113 transition count 662
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 760 place count 111 transition count 658
Iterating global reduction 6 with 2 rules applied. Total rules applied 762 place count 111 transition count 658
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 800 place count 92 transition count 639
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 816 place count 76 transition count 209
Iterating global reduction 6 with 16 rules applied. Total rules applied 832 place count 76 transition count 209
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 842 place count 76 transition count 199
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 844 place count 74 transition count 195
Iterating global reduction 7 with 2 rules applied. Total rules applied 846 place count 74 transition count 195
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 848 place count 72 transition count 191
Iterating global reduction 7 with 2 rules applied. Total rules applied 850 place count 72 transition count 191
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
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 870 place count 62 transition count 198
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 871 place count 61 transition count 186
Iterating global reduction 7 with 1 rules applied. Total rules applied 872 place count 61 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 873 place count 61 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 879 place count 61 transition count 179
Applied a total of 879 rules in 68 ms. Remains 61 /561 variables (removed 500) and now considering 179/1128 (removed 949) transitions.
[2024-06-01 12:49:01] [INFO ] Flow matrix only has 173 transitions (discarded 6 similar events)
// Phase 1: matrix 173 rows 61 cols
[2024-06-01 12:49:01] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 12:49:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 12:49:01] [INFO ] Flow matrix only has 173 transitions (discarded 6 similar events)
[2024-06-01 12:49:01] [INFO ] Invariant cache hit.
[2024-06-01 12:49:01] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 12:49:01] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-06-01 12:49:01] [INFO ] Redundant transitions in 2 ms returned []
Running 162 sub problems to find dead transitions.
[2024-06-01 12:49:01] [INFO ] Flow matrix only has 173 transitions (discarded 6 similar events)
[2024-06-01 12:49:01] [INFO ] Invariant cache hit.
[2024-06-01 12:49:01] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:49:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:49:03] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:49:03] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:49:03] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:49:03] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:49:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:49:03] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:49:03] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 12:49:03] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:49:03] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:49:04] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:49:04] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 172/233 variables, 61/86 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 12:49:05] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 1/234 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 118 constraints, problems are : Problem set: 0 solved, 162 unsolved in 7547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 172/233 variables, 61/87 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 30/117 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 162/279 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (OVERLAPS) 1/234 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 280 constraints, problems are : Problem set: 0 solved, 162 unsolved in 11264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 24/24 constraints]
After SMT, in 18954ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 18955ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/561 places, 179/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19209 ms. Remains : 61/561 places, 179/1128 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-02
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-02 finished in 19363 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&&G(p1)&&F(p2)))))'
Support contains 7 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 552 transition count 1119
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 551 transition count 1118
Applied a total of 20 rules in 42 ms. Remains 551 /561 variables (removed 10) and now considering 1118/1128 (removed 10) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2024-06-01 12:49:20] [INFO ] Computed 6 invariants in 16 ms
[2024-06-01 12:49:20] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-01 12:49:21] [INFO ] Invariant cache hit.
[2024-06-01 12:49:21] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2024-06-01 12:49:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (OVERLAPS) 1/551 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-06-01 12:49:43] [INFO ] Deduced a trap composed of 164 places in 282 ms of which 3 ms to minimize.
[2024-06-01 12:49:43] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2024-06-01 12:49:43] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 2 ms to minimize.
[2024-06-01 12:49:45] [INFO ] Deduced a trap composed of 167 places in 249 ms of which 3 ms to minimize.
[2024-06-01 12:49:45] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 2 ms to minimize.
[2024-06-01 12:49:45] [INFO ] Deduced a trap composed of 163 places in 201 ms of which 3 ms to minimize.
[2024-06-01 12:49:46] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 2 ms to minimize.
[2024-06-01 12:49:46] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2024-06-01 12:49:47] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 3 ms to minimize.
[2024-06-01 12:49:47] [INFO ] Deduced a trap composed of 163 places in 214 ms of which 2 ms to minimize.
[2024-06-01 12:49:48] [INFO ] Deduced a trap composed of 165 places in 238 ms of which 3 ms to minimize.
[2024-06-01 12:49:48] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 2 ms to minimize.
[2024-06-01 12:49:49] [INFO ] Deduced a trap composed of 167 places in 245 ms of which 3 ms to minimize.
[2024-06-01 12:49:49] [INFO ] Deduced a trap composed of 221 places in 220 ms of which 3 ms to minimize.
[2024-06-01 12:49:49] [INFO ] Deduced a trap composed of 169 places in 211 ms of which 3 ms to minimize.
[2024-06-01 12:49:50] [INFO ] Deduced a trap composed of 218 places in 229 ms of which 2 ms to minimize.
[2024-06-01 12:49:51] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 2 ms to minimize.
[2024-06-01 12:49:51] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 2 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 3 ms to minimize.
[2024-06-01 12:49:52] [INFO ] Deduced a trap composed of 221 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1669 variables, and 26 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/551 constraints, PredecessorRefiner: 1117/1117 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (OVERLAPS) 1/551 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-06-01 12:50:06] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 3 ms to minimize.
[2024-06-01 12:50:06] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 2 ms to minimize.
[2024-06-01 12:50:06] [INFO ] Deduced a trap composed of 163 places in 236 ms of which 3 ms to minimize.
[2024-06-01 12:50:07] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 2 ms to minimize.
[2024-06-01 12:50:07] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
[2024-06-01 12:50:07] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 3 ms to minimize.
[2024-06-01 12:50:08] [INFO ] Deduced a trap composed of 167 places in 211 ms of which 2 ms to minimize.
[2024-06-01 12:50:09] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 3 ms to minimize.
[2024-06-01 12:50:09] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 3 ms to minimize.
[2024-06-01 12:50:09] [INFO ] Deduced a trap composed of 167 places in 197 ms of which 3 ms to minimize.
[2024-06-01 12:50:10] [INFO ] Deduced a trap composed of 167 places in 220 ms of which 3 ms to minimize.
[2024-06-01 12:50:11] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 2 ms to minimize.
[2024-06-01 12:50:11] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 3 ms to minimize.
[2024-06-01 12:50:11] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
[2024-06-01 12:50:12] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 2 ms to minimize.
[2024-06-01 12:50:12] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 2 ms to minimize.
[2024-06-01 12:50:14] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 3 ms to minimize.
[2024-06-01 12:50:14] [INFO ] Deduced a trap composed of 163 places in 259 ms of which 3 ms to minimize.
[2024-06-01 12:50:14] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 2 ms to minimize.
[2024-06-01 12:50:15] [INFO ] Deduced a trap composed of 164 places in 251 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-06-01 12:50:15] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 2 ms to minimize.
[2024-06-01 12:50:20] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 4 ms to minimize.
[2024-06-01 12:50:21] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 3 ms to minimize.
[2024-06-01 12:50:21] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 3 ms to minimize.
[2024-06-01 12:50:23] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 2 ms to minimize.
[2024-06-01 12:50:23] [INFO ] Deduced a trap composed of 167 places in 201 ms of which 2 ms to minimize.
SMT process timed out in 62119ms, After SMT, problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 62131ms
Starting structural reductions in LTL mode, iteration 1 : 551/561 places, 1118/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62830 ms. Remains : 551/561 places, 1118/1128 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-03
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-03 finished in 63071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 553 transition count 1120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 553 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 550 transition count 1117
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 549 transition count 1116
Applied a total of 24 rules in 37 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-06-01 12:50:23] [INFO ] Computed 6 invariants in 15 ms
[2024-06-01 12:50:24] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 12:50:24] [INFO ] Invariant cache hit.
[2024-06-01 12:50:24] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-06-01 12:50:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 12:50:46] [INFO ] Deduced a trap composed of 164 places in 307 ms of which 3 ms to minimize.
[2024-06-01 12:50:46] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 3 ms to minimize.
[2024-06-01 12:50:46] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 2 ms to minimize.
[2024-06-01 12:50:48] [INFO ] Deduced a trap composed of 163 places in 250 ms of which 3 ms to minimize.
[2024-06-01 12:50:48] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 3 ms to minimize.
[2024-06-01 12:50:48] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 2 ms to minimize.
[2024-06-01 12:50:49] [INFO ] Deduced a trap composed of 163 places in 225 ms of which 2 ms to minimize.
[2024-06-01 12:50:49] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 3 ms to minimize.
[2024-06-01 12:50:49] [INFO ] Deduced a trap composed of 165 places in 238 ms of which 3 ms to minimize.
[2024-06-01 12:50:50] [INFO ] Deduced a trap composed of 165 places in 247 ms of which 3 ms to minimize.
[2024-06-01 12:50:50] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 2 ms to minimize.
[2024-06-01 12:50:50] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 2 ms to minimize.
[2024-06-01 12:50:51] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 3 ms to minimize.
[2024-06-01 12:50:51] [INFO ] Deduced a trap composed of 165 places in 208 ms of which 2 ms to minimize.
[2024-06-01 12:50:52] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2024-06-01 12:50:52] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 2 ms to minimize.
[2024-06-01 12:50:53] [INFO ] Deduced a trap composed of 163 places in 209 ms of which 2 ms to minimize.
[2024-06-01 12:50:53] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 3 ms to minimize.
[2024-06-01 12:50:54] [INFO ] Deduced a trap composed of 167 places in 215 ms of which 2 ms to minimize.
[2024-06-01 12:50:55] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
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 0.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 1.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 0.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 1.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 0.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 1.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 0.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 timeout
0.0)
(s371 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 12:51:07] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 2 ms to minimize.
[2024-06-01 12:51:10] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 2 ms to minimize.
[2024-06-01 12:51:10] [INFO ] Deduced a trap composed of 165 places in 211 ms of which 2 ms to minimize.
[2024-06-01 12:51:11] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 2 ms to minimize.
[2024-06-01 12:51:12] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
[2024-06-01 12:51:13] [INFO ] Deduced a trap composed of 167 places in 252 ms of which 3 ms to minimize.
[2024-06-01 12:51:14] [INFO ] Deduced a trap composed of 167 places in 242 ms of which 3 ms to minimize.
[2024-06-01 12:51:14] [INFO ] Deduced a trap composed of 166 places in 234 ms of which 3 ms to minimize.
[2024-06-01 12:51:15] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 3 ms to minimize.
[2024-06-01 12:51:15] [INFO ] Deduced a trap composed of 166 places in 264 ms of which 3 ms to minimize.
[2024-06-01 12:51:15] [INFO ] Deduced a trap composed of 167 places in 241 ms of which 2 ms to minimize.
[2024-06-01 12:51:16] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 3 ms to minimize.
[2024-06-01 12:51:16] [INFO ] Deduced a trap composed of 164 places in 276 ms of which 3 ms to minimize.
[2024-06-01 12:51:16] [INFO ] Deduced a trap composed of 167 places in 265 ms of which 4 ms to minimize.
[2024-06-01 12:51:17] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 3 ms to minimize.
[2024-06-01 12:51:17] [INFO ] Deduced a trap composed of 203 places in 245 ms of which 3 ms to minimize.
[2024-06-01 12:51:17] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 2 ms to minimize.
[2024-06-01 12:51:17] [INFO ] Deduced a trap composed of 167 places in 224 ms of which 2 ms to minimize.
[2024-06-01 12:51:18] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 61938ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61951ms
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62692 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 621 steps with 6 reset in 2 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-04 finished in 62837 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)||X(X(F(p1)))))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 551 transition count 1118
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 550 transition count 1117
Applied a total of 22 rules in 36 ms. Remains 550 /561 variables (removed 11) and now considering 1117/1128 (removed 11) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2024-06-01 12:51:26] [INFO ] Computed 6 invariants in 15 ms
[2024-06-01 12:51:26] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-01 12:51:26] [INFO ] Invariant cache hit.
[2024-06-01 12:51:27] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-06-01 12:51:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (OVERLAPS) 1/550 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 12:51:49] [INFO ] Deduced a trap composed of 164 places in 276 ms of which 3 ms to minimize.
[2024-06-01 12:51:49] [INFO ] Deduced a trap composed of 164 places in 275 ms of which 4 ms to minimize.
[2024-06-01 12:51:50] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 3 ms to minimize.
[2024-06-01 12:51:50] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 2 ms to minimize.
[2024-06-01 12:51:51] [INFO ] Deduced a trap composed of 165 places in 209 ms of which 2 ms to minimize.
[2024-06-01 12:51:51] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 3 ms to minimize.
[2024-06-01 12:51:52] [INFO ] Deduced a trap composed of 162 places in 269 ms of which 3 ms to minimize.
[2024-06-01 12:51:52] [INFO ] Deduced a trap composed of 163 places in 255 ms of which 3 ms to minimize.
[2024-06-01 12:51:52] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 3 ms to minimize.
[2024-06-01 12:51:53] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 2 ms to minimize.
[2024-06-01 12:51:53] [INFO ] Deduced a trap composed of 163 places in 200 ms of which 2 ms to minimize.
[2024-06-01 12:51:54] [INFO ] Deduced a trap composed of 217 places in 214 ms of which 2 ms to minimize.
[2024-06-01 12:51:55] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 3 ms to minimize.
[2024-06-01 12:51:55] [INFO ] Deduced a trap composed of 163 places in 194 ms of which 2 ms to minimize.
[2024-06-01 12:51:55] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 2 ms to minimize.
[2024-06-01 12:51:57] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 3 ms to minimize.
[2024-06-01 12:51:57] [INFO ] Deduced a trap composed of 167 places in 208 ms of which 3 ms to minimize.
[2024-06-01 12:51:59] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 3 ms to minimize.
SMT process timed out in 32035ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 32046ms
Starting structural reductions in LTL mode, iteration 1 : 550/561 places, 1117/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32785 ms. Remains : 550/561 places, 1117/1128 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-05
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-05 finished in 32962 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||(p1&&G(p2)&&X(p0)))))'
Support contains 7 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 552 transition count 1119
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 551 transition count 1118
Applied a total of 20 rules in 45 ms. Remains 551 /561 variables (removed 10) and now considering 1118/1128 (removed 10) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2024-06-01 12:51:59] [INFO ] Computed 6 invariants in 12 ms
[2024-06-01 12:51:59] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-01 12:51:59] [INFO ] Invariant cache hit.
[2024-06-01 12:52:00] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2024-06-01 12:52:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (OVERLAPS) 1/551 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-06-01 12:52:22] [INFO ] Deduced a trap composed of 162 places in 264 ms of which 3 ms to minimize.
[2024-06-01 12:52:22] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 3 ms to minimize.
[2024-06-01 12:52:22] [INFO ] Deduced a trap composed of 165 places in 204 ms of which 2 ms to minimize.
[2024-06-01 12:52:22] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 3 ms to minimize.
[2024-06-01 12:52:23] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 2 ms to minimize.
[2024-06-01 12:52:24] [INFO ] Deduced a trap composed of 166 places in 268 ms of which 3 ms to minimize.
[2024-06-01 12:52:24] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 3 ms to minimize.
[2024-06-01 12:52:25] [INFO ] Deduced a trap composed of 165 places in 231 ms of which 3 ms to minimize.
[2024-06-01 12:52:26] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 2 ms to minimize.
[2024-06-01 12:52:26] [INFO ] Deduced a trap composed of 165 places in 196 ms of which 2 ms to minimize.
[2024-06-01 12:52:27] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 3 ms to minimize.
[2024-06-01 12:52:27] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 2 ms to minimize.
[2024-06-01 12:52:28] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 2 ms to minimize.
[2024-06-01 12:52:28] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 2 ms to minimize.
[2024-06-01 12:52:29] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
[2024-06-01 12:52:29] [INFO ] Deduced a trap composed of 167 places in 204 ms of which 2 ms to minimize.
[2024-06-01 12:52:30] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 2 ms to minimize.
[2024-06-01 12:52:31] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
[2024-06-01 12:52:32] [INFO ] Deduced a trap composed of 165 places in 231 ms of which 3 ms to minimize.
SMT process timed out in 32180ms, After SMT, problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 32190ms
Starting structural reductions in LTL mode, iteration 1 : 551/561 places, 1118/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32855 ms. Remains : 551/561 places, 1118/1128 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-06
Product exploration explored 100000 steps with 1123 reset in 130 ms.
Product exploration explored 100000 steps with 1117 reset in 139 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (NOT p0) (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 135 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (447 resets) in 565 ms. (70 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (62 resets) in 45 ms. (869 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (61 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (78 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (77 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
[2024-06-01 12:52:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 530/537 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/551 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1118/1669 variables, 551/557 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1669 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1669 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1669/1669 variables, and 557 constraints, problems are : Problem set: 1 solved, 3 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 551/551 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/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 530/537 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 12:52:34] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 3 ms to minimize.
[2024-06-01 12:52:34] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 3 ms to minimize.
[2024-06-01 12:52:34] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 3 ms to minimize.
[2024-06-01 12:52:35] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 3 ms to minimize.
[2024-06-01 12:52:35] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 3 ms to minimize.
[2024-06-01 12:52:35] [INFO ] Deduced a trap composed of 193 places in 242 ms of which 3 ms to minimize.
[2024-06-01 12:52:35] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 14/551 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1118/1669 variables, 551/564 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1669 variables, 3/567 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1669 variables, 0/567 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1669 variables, 0/567 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1669/1669 variables, and 567 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2460 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 3005ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 89 ms.
Support contains 7 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 1118/1118 transitions.
Graph (trivial) has 535 edges and 551 vertex of which 85 / 551 are part of one of the 15 SCC in 5 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1043 edges and 481 vertex of which 476 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 324 rules applied. Total rules applied 326 place count 476 transition count 699
Reduce places removed 319 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 329 rules applied. Total rules applied 655 place count 157 transition count 689
Reduce places removed 5 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 24 rules applied. Total rules applied 679 place count 152 transition count 670
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 698 place count 133 transition count 670
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 698 place count 133 transition count 646
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 746 place count 109 transition count 646
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 747 place count 108 transition count 644
Iterating global reduction 4 with 1 rules applied. Total rules applied 748 place count 108 transition count 644
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 749 place count 108 transition count 643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 750 place count 107 transition count 643
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 751 place count 106 transition count 641
Iterating global reduction 6 with 1 rules applied. Total rules applied 752 place count 106 transition count 641
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 798 place count 83 transition count 618
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 807 place count 83 transition count 609
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 826 place count 64 transition count 170
Iterating global reduction 7 with 19 rules applied. Total rules applied 845 place count 64 transition count 170
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 856 place count 64 transition count 159
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 860 place count 60 transition count 155
Iterating global reduction 8 with 4 rules applied. Total rules applied 864 place count 60 transition count 155
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 8 with 10 rules applied. Total rules applied 874 place count 55 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 880 place count 52 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 888 place count 52 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 890 place count 51 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 898 place count 51 transition count 148
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 907 place count 51 transition count 139
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 916 place count 42 transition count 139
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 921 place count 37 transition count 134
Iterating global reduction 9 with 5 rules applied. Total rules applied 926 place count 37 transition count 134
Applied a total of 926 rules in 73 ms. Remains 37 /551 variables (removed 514) and now considering 134/1118 (removed 984) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 37/551 places, 134/1118 transitions.
RANDOM walk for 5215 steps (395 resets) in 39 ms. (130 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (NOT p0) (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F (NOT p0)), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT (AND (OR p0 p2) (OR p0 p1))))
Knowledge based reduction with 17 factoid took 269 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLFireability-06 finished in 37449 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(((X(p0)&&F(!p1))||G(p0)))))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 553 transition count 1120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 553 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 550 transition count 1117
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 549 transition count 1116
Applied a total of 24 rules in 39 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-06-01 12:52:37] [INFO ] Computed 6 invariants in 7 ms
[2024-06-01 12:52:37] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 12:52:37] [INFO ] Invariant cache hit.
[2024-06-01 12:52:37] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-06-01 12:52:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 12:52:59] [INFO ] Deduced a trap composed of 164 places in 270 ms of which 3 ms to minimize.
[2024-06-01 12:52:59] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2024-06-01 12:52:59] [INFO ] Deduced a trap composed of 165 places in 216 ms of which 2 ms to minimize.
[2024-06-01 12:53:01] [INFO ] Deduced a trap composed of 163 places in 254 ms of which 3 ms to minimize.
[2024-06-01 12:53:01] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 3 ms to minimize.
[2024-06-01 12:53:01] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 2 ms to minimize.
[2024-06-01 12:53:02] [INFO ] Deduced a trap composed of 163 places in 216 ms of which 2 ms to minimize.
[2024-06-01 12:53:02] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 3 ms to minimize.
[2024-06-01 12:53:02] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 3 ms to minimize.
[2024-06-01 12:53:02] [INFO ] Deduced a trap composed of 165 places in 236 ms of which 3 ms to minimize.
[2024-06-01 12:53:03] [INFO ] Deduced a trap composed of 226 places in 223 ms of which 3 ms to minimize.
[2024-06-01 12:53:03] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 ms to minimize.
[2024-06-01 12:53:03] [INFO ] Deduced a trap composed of 163 places in 240 ms of which 2 ms to minimize.
[2024-06-01 12:53:04] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 2 ms to minimize.
[2024-06-01 12:53:05] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2024-06-01 12:53:05] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 ms to minimize.
[2024-06-01 12:53:06] [INFO ] Deduced a trap composed of 163 places in 197 ms of which 2 ms to minimize.
[2024-06-01 12:53:06] [INFO ] Deduced a trap composed of 165 places in 230 ms of which 4 ms to minimize.
[2024-06-01 12:53:07] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 3 ms to minimize.
[2024-06-01 12:53:08] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
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 0.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 1.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 0.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 1.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 0.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 1.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 0.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 1.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 0.0)
(s406 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 12:53:21] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 3 ms to minimize.
[2024-06-01 12:53:24] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 2 ms to minimize.
[2024-06-01 12:53:24] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 2 ms to minimize.
[2024-06-01 12:53:24] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 3 ms to minimize.
[2024-06-01 12:53:26] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 2 ms to minimize.
[2024-06-01 12:53:26] [INFO ] Deduced a trap composed of 167 places in 249 ms of which 2 ms to minimize.
[2024-06-01 12:53:28] [INFO ] Deduced a trap composed of 167 places in 259 ms of which 2 ms to minimize.
[2024-06-01 12:53:28] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
[2024-06-01 12:53:28] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 3 ms to minimize.
[2024-06-01 12:53:29] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 3 ms to minimize.
[2024-06-01 12:53:29] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 3 ms to minimize.
[2024-06-01 12:53:29] [INFO ] Deduced a trap composed of 166 places in 277 ms of which 2 ms to minimize.
[2024-06-01 12:53:30] [INFO ] Deduced a trap composed of 164 places in 280 ms of which 3 ms to minimize.
[2024-06-01 12:53:30] [INFO ] Deduced a trap composed of 167 places in 266 ms of which 3 ms to minimize.
[2024-06-01 12:53:30] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 4 ms to minimize.
[2024-06-01 12:53:31] [INFO ] Deduced a trap composed of 203 places in 253 ms of which 4 ms to minimize.
[2024-06-01 12:53:31] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 3 ms to minimize.
[2024-06-01 12:53:31] [INFO ] Deduced a trap composed of 167 places in 222 ms of which 3 ms to minimize.
[2024-06-01 12:53:31] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 61951ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61965ms
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62665 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 187 ms.
Product exploration explored 100000 steps with 33333 reset in 185 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLFireability-07 finished in 63261 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((G(!p0)||(!p0&&F(p1))))))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Graph (trivial) has 568 edges and 561 vertex of which 87 / 561 are part of one of the 15 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 488 transition count 713
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 342 rules applied. Total rules applied 675 place count 156 transition count 703
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 681 place count 151 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 682 place count 150 transition count 702
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 682 place count 150 transition count 682
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 722 place count 130 transition count 682
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 731 place count 121 transition count 671
Iterating global reduction 4 with 9 rules applied. Total rules applied 740 place count 121 transition count 671
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 741 place count 121 transition count 670
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 742 place count 120 transition count 670
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 742 place count 120 transition count 669
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 744 place count 119 transition count 669
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 747 place count 116 transition count 664
Iterating global reduction 6 with 3 rules applied. Total rules applied 750 place count 116 transition count 664
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 752 place count 114 transition count 660
Iterating global reduction 6 with 2 rules applied. Total rules applied 754 place count 114 transition count 660
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 794 place count 94 transition count 640
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 806 place count 82 transition count 419
Iterating global reduction 6 with 12 rules applied. Total rules applied 818 place count 82 transition count 419
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 823 place count 82 transition count 414
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 826 place count 79 transition count 408
Iterating global reduction 7 with 3 rules applied. Total rules applied 829 place count 79 transition count 408
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 832 place count 76 transition count 402
Iterating global reduction 7 with 3 rules applied. Total rules applied 835 place count 76 transition count 402
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 853 place count 67 transition count 409
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 854 place count 66 transition count 399
Iterating global reduction 7 with 1 rules applied. Total rules applied 855 place count 66 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 856 place count 66 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 861 place count 66 transition count 393
Applied a total of 861 rules in 75 ms. Remains 66 /561 variables (removed 495) and now considering 393/1128 (removed 735) transitions.
[2024-06-01 12:53:40] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
// Phase 1: matrix 387 rows 66 cols
[2024-06-01 12:53:40] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 12:53:40] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 12:53:40] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-06-01 12:53:40] [INFO ] Invariant cache hit.
[2024-06-01 12:53:40] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 12:53:40] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-06-01 12:53:40] [INFO ] Redundant transitions in 5 ms returned []
Running 376 sub problems to find dead transitions.
[2024-06-01 12:53:40] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-06-01 12:53:40] [INFO ] Invariant cache hit.
[2024-06-01 12:53:40] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 4 ms to minimize.
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2024-06-01 12:53:43] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2024-06-01 12:53:44] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 12:53:45] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-01 12:53:45] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 0 ms to minimize.
[2024-06-01 12:53:45] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (OVERLAPS) 386/452 variables, 66/81 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 30/111 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 12:53:49] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-06-01 12:53:50] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2024-06-01 12:53:51] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 10 (OVERLAPS) 1/453 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 12 (OVERLAPS) 0/453 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 115 constraints, problems are : Problem set: 0 solved, 376 unsolved in 23269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (OVERLAPS) 386/452 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 30/114 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 376/490 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 9 (OVERLAPS) 1/453 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/453 variables, and 491 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 16/16 constraints]
After SMT, in 54324ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 54327ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/561 places, 393/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54844 ms. Remains : 66/561 places, 393/1128 transitions.
Stuttering acceptance computed with spot in 112 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-09
Product exploration explored 100000 steps with 9761 reset in 230 ms.
Product exploration explored 100000 steps with 9764 reset in 182 ms.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Detected a total of 3/66 stabilizing places and 19/393 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 238 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (3894 resets) in 138 ms. (287 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (366 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (432 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
[2024-06-01 12:54:36] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-06-01 12:54:36] [INFO ] Invariant cache hit.
[2024-06-01 12:54:36] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/64 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 385/449 variables, 64/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 30/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/452 variables, 2/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/453 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/453 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 99 constraints, problems are : Problem set: 1 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/64 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 385/449 variables, 64/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 30/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/452 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/453 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/453 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 100 constraints, problems are : Problem set: 1 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 475ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 9 factoid took 395 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Support contains 5 out of 66 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 393/393 transitions.
Applied a total of 0 rules in 12 ms. Remains 66 /66 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2024-06-01 12:54:37] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-06-01 12:54:37] [INFO ] Invariant cache hit.
[2024-06-01 12:54:37] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 12:54:37] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-06-01 12:54:37] [INFO ] Invariant cache hit.
[2024-06-01 12:54:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 12:54:37] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-06-01 12:54:37] [INFO ] Redundant transitions in 2 ms returned []
Running 376 sub problems to find dead transitions.
[2024-06-01 12:54:37] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-06-01 12:54:37] [INFO ] Invariant cache hit.
[2024-06-01 12:54:37] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 12:54:39] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-06-01 12:54:40] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2024-06-01 12:54:40] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-06-01 12:54:40] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2024-06-01 12:54:40] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:54:40] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:54:40] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 12:54:40] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2024-06-01 12:54:41] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-06-01 12:54:41] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 12:54:42] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-06-01 12:54:42] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-06-01 12:54:42] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (OVERLAPS) 386/452 variables, 66/81 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 30/111 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 12:54:46] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-06-01 12:54:47] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2024-06-01 12:54:47] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 10 (OVERLAPS) 1/453 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 12 (OVERLAPS) 0/453 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 115 constraints, problems are : Problem set: 0 solved, 376 unsolved in 22759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (OVERLAPS) 386/452 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 30/114 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 376/490 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 9 (OVERLAPS) 1/453 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/453 variables, and 491 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 16/16 constraints]
After SMT, in 53990ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 53993ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54266 ms. Remains : 66/66 places, 393/393 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
RANDOM walk for 40000 steps (3938 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (416 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 569747 steps, run visited all 1 properties in 919 ms. (steps per millisecond=619 )
Probabilistic random walk after 569747 steps, saw 120855 distinct states, run finished after 924 ms. (steps per millisecond=616 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Stuttering acceptance computed with spot in 81 ms :[p0, p0]
Product exploration explored 100000 steps with 9745 reset in 157 ms.
Product exploration explored 100000 steps with 607 reset in 95 ms.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 393/393 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 66 transition count 392
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 392
Applied a total of 2 rules in 14 ms. Remains 65 /66 variables (removed 1) and now considering 392/393 (removed 1) transitions.
[2024-06-01 12:55:33] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
// Phase 1: matrix 386 rows 65 cols
[2024-06-01 12:55:33] [INFO ] Computed 2 invariants in 6 ms
[2024-06-01 12:55:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 12:55:33] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
[2024-06-01 12:55:33] [INFO ] Invariant cache hit.
[2024-06-01 12:55:33] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 12:55:33] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-06-01 12:55:33] [INFO ] Redundant transitions in 6 ms returned []
Running 375 sub problems to find dead transitions.
[2024-06-01 12:55:33] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
[2024-06-01 12:55:33] [INFO ] Invariant cache hit.
[2024-06-01 12:55:33] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 12:55:35] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-06-01 12:55:35] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2024-06-01 12:55:36] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-06-01 12:55:36] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2024-06-01 12:55:36] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-06-01 12:55:36] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2024-06-01 12:55:36] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 12:55:36] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2024-06-01 12:55:36] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2024-06-01 12:55:36] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 1 ms to minimize.
[2024-06-01 12:55:36] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:55:37] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 0 ms to minimize.
[2024-06-01 12:55:37] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-06-01 12:55:37] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:55:37] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:55:38] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 12:55:38] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2024-06-01 12:55:39] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 385/450 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 30/115 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-01 12:55:42] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 10 (OVERLAPS) 1/451 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 12 (OVERLAPS) 0/451 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 117 constraints, problems are : Problem set: 0 solved, 375 unsolved in 22420 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 385/450 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 375/491 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 9 (OVERLAPS) 1/451 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 492 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 19/19 constraints]
After SMT, in 53532ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 53536ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/66 places, 392/393 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53820 ms. Remains : 65/66 places, 392/393 transitions.
Treatment of property StigmergyElection-PT-05b-LTLFireability-09 finished in 166835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(p0))) U p1)))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 551 transition count 1118
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 550 transition count 1117
Applied a total of 22 rules in 49 ms. Remains 550 /561 variables (removed 11) and now considering 1117/1128 (removed 11) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2024-06-01 12:56:27] [INFO ] Computed 6 invariants in 7 ms
[2024-06-01 12:56:27] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 12:56:27] [INFO ] Invariant cache hit.
[2024-06-01 12:56:27] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-06-01 12:56:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (OVERLAPS) 1/550 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 162 places in 278 ms of which 3 ms to minimize.
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2024-06-01 12:56:51] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 2 ms to minimize.
[2024-06-01 12:56:52] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 3 ms to minimize.
[2024-06-01 12:56:52] [INFO ] Deduced a trap composed of 163 places in 207 ms of which 3 ms to minimize.
[2024-06-01 12:56:54] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 3 ms to minimize.
[2024-06-01 12:56:54] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 2 ms to minimize.
[2024-06-01 12:56:56] [INFO ] Deduced a trap composed of 167 places in 208 ms of which 2 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 163 places in 215 ms of which 3 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 3 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 165 places in 238 ms of which 2 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 ms to minimize.
[2024-06-01 12:56:59] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2024-06-01 12:56:59] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 3 ms to minimize.
[2024-06-01 12:56:59] [INFO ] Deduced a trap composed of 165 places in 277 ms of which 3 ms to minimize.
[2024-06-01 12:56:59] [INFO ] Deduced a trap composed of 166 places in 266 ms of which 3 ms to minimize.
[2024-06-01 12:57:00] [INFO ] Deduced a trap composed of 218 places in 243 ms of which 3 ms to minimize.
SMT process timed out in 32189ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 32202ms
Starting structural reductions in LTL mode, iteration 1 : 550/561 places, 1117/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32883 ms. Remains : 550/561 places, 1117/1128 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-10 finished in 33142 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||(F(p1)&&G(p2))))))'
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 551 transition count 1118
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 550 transition count 1117
Applied a total of 22 rules in 41 ms. Remains 550 /561 variables (removed 11) and now considering 1117/1128 (removed 11) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2024-06-01 12:57:00] [INFO ] Computed 6 invariants in 7 ms
[2024-06-01 12:57:00] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 12:57:00] [INFO ] Invariant cache hit.
[2024-06-01 12:57:01] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-06-01 12:57:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (OVERLAPS) 1/550 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 12:57:23] [INFO ] Deduced a trap composed of 165 places in 273 ms of which 3 ms to minimize.
[2024-06-01 12:57:23] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 3 ms to minimize.
[2024-06-01 12:57:24] [INFO ] Deduced a trap composed of 163 places in 253 ms of which 3 ms to minimize.
[2024-06-01 12:57:25] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 2 ms to minimize.
[2024-06-01 12:57:25] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 2 ms to minimize.
[2024-06-01 12:57:27] [INFO ] Deduced a trap composed of 165 places in 225 ms of which 2 ms to minimize.
[2024-06-01 12:57:27] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 3 ms to minimize.
[2024-06-01 12:57:27] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
[2024-06-01 12:57:27] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 3 ms to minimize.
[2024-06-01 12:57:29] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 3 ms to minimize.
[2024-06-01 12:57:30] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 3 ms to minimize.
[2024-06-01 12:57:31] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 2 ms to minimize.
[2024-06-01 12:57:31] [INFO ] Deduced a trap composed of 163 places in 220 ms of which 2 ms to minimize.
[2024-06-01 12:57:31] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 2 ms to minimize.
[2024-06-01 12:57:31] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 3 ms to minimize.
[2024-06-01 12:57:32] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 3 ms to minimize.
[2024-06-01 12:57:32] [INFO ] Deduced a trap composed of 167 places in 240 ms of which 3 ms to minimize.
[2024-06-01 12:57:32] [INFO ] Deduced a trap composed of 166 places in 267 ms of which 3 ms to minimize.
[2024-06-01 12:57:33] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 3 ms to minimize.
[2024-06-01 12:57:33] [INFO ] Deduced a trap composed of 164 places in 264 ms of which 3 ms to minimize.
SMT process timed out in 32353ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 32362ms
Starting structural reductions in LTL mode, iteration 1 : 550/561 places, 1117/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33065 ms. Remains : 550/561 places, 1117/1128 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 19 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLFireability-11 finished in 33626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U G((!p2||F(p3))))))'
Support contains 14 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 553 transition count 1120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 553 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 550 transition count 1117
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 549 transition count 1116
Applied a total of 24 rules in 40 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-06-01 12:57:33] [INFO ] Computed 6 invariants in 12 ms
[2024-06-01 12:57:34] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 12:57:34] [INFO ] Invariant cache hit.
[2024-06-01 12:57:34] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-06-01 12:57:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 12:57:56] [INFO ] Deduced a trap composed of 164 places in 264 ms of which 3 ms to minimize.
[2024-06-01 12:57:56] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 3 ms to minimize.
[2024-06-01 12:57:57] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 2 ms to minimize.
[2024-06-01 12:57:58] [INFO ] Deduced a trap composed of 163 places in 258 ms of which 3 ms to minimize.
[2024-06-01 12:57:58] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 3 ms to minimize.
[2024-06-01 12:57:59] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 3 ms to minimize.
[2024-06-01 12:57:59] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 2 ms to minimize.
[2024-06-01 12:57:59] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 2 ms to minimize.
[2024-06-01 12:57:59] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 3 ms to minimize.
[2024-06-01 12:58:00] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 3 ms to minimize.
[2024-06-01 12:58:00] [INFO ] Deduced a trap composed of 226 places in 220 ms of which 2 ms to minimize.
[2024-06-01 12:58:00] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 2 ms to minimize.
[2024-06-01 12:58:00] [INFO ] Deduced a trap composed of 163 places in 197 ms of which 2 ms to minimize.
[2024-06-01 12:58:01] [INFO ] Deduced a trap composed of 165 places in 209 ms of which 2 ms to minimize.
[2024-06-01 12:58:02] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 2 ms to minimize.
[2024-06-01 12:58:02] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 3 ms to minimize.
[2024-06-01 12:58:02] [INFO ] Deduced a trap composed of 163 places in 213 ms of which 3 ms to minimize.
[2024-06-01 12:58:03] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 2 ms to minimize.
[2024-06-01 12:58:04] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 3 ms to minimize.
[2024-06-01 12:58:05] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 12:58:17] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 2 ms to minimize.
[2024-06-01 12:58:20] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 2 ms to minimize.
[2024-06-01 12:58:21] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 2 ms to minimize.
[2024-06-01 12:58:21] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 2 ms to minimize.
[2024-06-01 12:58:22] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 2 ms to minimize.
[2024-06-01 12:58:23] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 3 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 167 places in 255 ms of which 2 ms to minimize.
[2024-06-01 12:58:25] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 3 ms to minimize.
[2024-06-01 12:58:25] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 2 ms to minimize.
[2024-06-01 12:58:25] [INFO ] Deduced a trap composed of 166 places in 258 ms of which 3 ms to minimize.
[2024-06-01 12:58:26] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
[2024-06-01 12:58:26] [INFO ] Deduced a trap composed of 166 places in 264 ms of which 2 ms to minimize.
[2024-06-01 12:58:26] [INFO ] Deduced a trap composed of 164 places in 266 ms of which 3 ms to minimize.
[2024-06-01 12:58:27] [INFO ] Deduced a trap composed of 167 places in 261 ms of which 3 ms to minimize.
[2024-06-01 12:58:27] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 3 ms to minimize.
[2024-06-01 12:58:27] [INFO ] Deduced a trap composed of 203 places in 253 ms of which 7 ms to minimize.
[2024-06-01 12:58:28] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 2 ms to minimize.
[2024-06-01 12:58:28] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 2 ms to minimize.
[2024-06-01 12:58:28] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 61855ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61865ms
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62526 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p0) p2 (NOT p3)), (AND p2 (NOT p3) (NOT p0)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) p2), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p3) p2)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-12
Product exploration explored 100000 steps with 1119 reset in 115 ms.
Product exploration explored 100000 steps with 1122 reset in 124 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p3) (NOT p0))), (X (NOT p3)), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3) p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 92 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p2 (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (448 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (78 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (78 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (78 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 484280 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 3
Probabilistic random walk after 484280 steps, saw 85115 distinct states, run finished after 3004 ms. (steps per millisecond=161 ) properties seen :0
[2024-06-01 12:58:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 525/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 555 constraints, problems are : Problem set: 0 solved, 3 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 525/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1665 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 558 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1923ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 94 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Parikh walk visited 3 properties in 18 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p3) (NOT p0))), (X (NOT p3)), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3) p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p2) p3))), (F p3)]
Knowledge based reduction with 19 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 75 ms :[(AND p2 (NOT p3)), (NOT p3)]
Support contains 10 out of 549 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 548 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 314 place count 478 transition count 722
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 323 rules applied. Total rules applied 637 place count 165 transition count 712
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 643 place count 160 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 644 place count 159 transition count 711
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 644 place count 159 transition count 690
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 686 place count 138 transition count 690
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 690 place count 134 transition count 686
Iterating global reduction 4 with 4 rules applied. Total rules applied 694 place count 134 transition count 686
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 742 place count 110 transition count 662
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 754 place count 98 transition count 512
Iterating global reduction 4 with 12 rules applied. Total rules applied 766 place count 98 transition count 512
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 768 place count 98 transition count 510
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 773 place count 93 transition count 500
Iterating global reduction 5 with 5 rules applied. Total rules applied 778 place count 93 transition count 500
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 783 place count 88 transition count 490
Iterating global reduction 5 with 5 rules applied. Total rules applied 788 place count 88 transition count 490
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 806 place count 79 transition count 497
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 807 place count 78 transition count 487
Iterating global reduction 5 with 1 rules applied. Total rules applied 808 place count 78 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 809 place count 78 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 814 place count 78 transition count 481
Applied a total of 814 rules in 67 ms. Remains 78 /549 variables (removed 471) and now considering 481/1116 (removed 635) transitions.
[2024-06-01 12:58:42] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
// Phase 1: matrix 475 rows 78 cols
[2024-06-01 12:58:42] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 12:58:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 12:58:42] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2024-06-01 12:58:42] [INFO ] Invariant cache hit.
[2024-06-01 12:58:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 12:58:43] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-06-01 12:58:43] [INFO ] Redundant transitions in 5 ms returned []
Running 464 sub problems to find dead transitions.
[2024-06-01 12:58:43] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2024-06-01 12:58:43] [INFO ] Invariant cache hit.
[2024-06-01 12:58:43] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 12:58:46] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2024-06-01 12:58:46] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2024-06-01 12:58:46] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-06-01 12:58:46] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2024-06-01 12:58:46] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2024-06-01 12:58:46] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-06-01 12:58:47] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2024-06-01 12:58:47] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2024-06-01 12:58:47] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2024-06-01 12:58:47] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2024-06-01 12:58:47] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2024-06-01 12:58:47] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-06-01 12:58:47] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-06-01 12:58:47] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2024-06-01 12:58:48] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-06-01 12:58:48] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-06-01 12:58:48] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-06-01 12:58:49] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2024-06-01 12:58:49] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (OVERLAPS) 474/552 variables, 78/99 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 30/129 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 12:58:55] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 9 (OVERLAPS) 1/553 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 11 (OVERLAPS) 0/553 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 131 constraints, problems are : Problem set: 0 solved, 464 unsolved in 29360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (OVERLAPS) 474/552 variables, 78/100 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 30/130 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 464/594 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 464 unsolved
SMT process timed out in 60924ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60929ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/549 places, 481/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61254 ms. Remains : 78/549 places, 481/1116 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND p2 (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (3801 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (359 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (367 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (367 resets) in 62 ms. (634 steps per ms) remains 2/3 properties
[2024-06-01 12:59:44] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2024-06-01 12:59:44] [INFO ] Invariant cache hit.
[2024-06-01 12:59:44] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 473/549 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 30/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/552 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/553 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/553 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 473/549 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 30/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/552 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/553 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/553 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 113 constraints, problems are : Problem set: 0 solved, 2 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 865ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 12 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p2) p3))), (F p3)]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 75 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 86 ms :[(AND p2 (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 491 reset in 40 ms.
Product exploration explored 100000 steps with 4653 reset in 104 ms.
Support contains 10 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 481/481 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 78 transition count 476
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 73 transition count 476
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 72 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 72 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 72 transition count 394
Applied a total of 13 rules in 13 ms. Remains 72 /78 variables (removed 6) and now considering 394/481 (removed 87) transitions.
[2024-06-01 12:59:45] [INFO ] Flow matrix only has 388 transitions (discarded 6 similar events)
// Phase 1: matrix 388 rows 72 cols
[2024-06-01 12:59:45] [INFO ] Computed 2 invariants in 7 ms
[2024-06-01 12:59:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 12:59:45] [INFO ] Flow matrix only has 388 transitions (discarded 6 similar events)
[2024-06-01 12:59:45] [INFO ] Invariant cache hit.
[2024-06-01 12:59:45] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 12:59:45] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-01 12:59:45] [INFO ] Redundant transitions in 2 ms returned []
Running 377 sub problems to find dead transitions.
[2024-06-01 12:59:46] [INFO ] Flow matrix only has 388 transitions (discarded 6 similar events)
[2024-06-01 12:59:46] [INFO ] Invariant cache hit.
[2024-06-01 12:59:46] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-01 12:59:48] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2024-06-01 12:59:48] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-06-01 12:59:48] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-06-01 12:59:48] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2024-06-01 12:59:48] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2024-06-01 12:59:48] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-06-01 12:59:48] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2024-06-01 12:59:48] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-06-01 12:59:48] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-06-01 12:59:48] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-06-01 12:59:49] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:59:49] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:59:49] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-06-01 12:59:50] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2024-06-01 12:59:50] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 0 ms to minimize.
[2024-06-01 12:59:50] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:59:50] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:59:50] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 387/459 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-01 12:59:54] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 9 (OVERLAPS) 1/460 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 11 (OVERLAPS) 0/460 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 124 constraints, problems are : Problem set: 0 solved, 377 unsolved in 21604 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 387/459 variables, 72/93 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 30/123 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 377/500 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 9 (OVERLAPS) 1/460 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 501 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 19/19 constraints]
After SMT, in 52449ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 52453ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/78 places, 394/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52692 ms. Remains : 72/78 places, 394/481 transitions.
Treatment of property StigmergyElection-PT-05b-LTLFireability-12 finished in 184600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||(p1&&X(p2)))))'
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 552 transition count 1119
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 552 transition count 1119
Applied a total of 18 rules in 32 ms. Remains 552 /561 variables (removed 9) and now considering 1119/1128 (removed 9) transitions.
// Phase 1: matrix 1119 rows 552 cols
[2024-06-01 13:00:38] [INFO ] Computed 6 invariants in 13 ms
[2024-06-01 13:00:38] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 13:00:38] [INFO ] Invariant cache hit.
[2024-06-01 13:00:39] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 1118 sub problems to find dead transitions.
[2024-06-01 13:00:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
At refinement iteration 1 (OVERLAPS) 1/552 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1118 unsolved
[2024-06-01 13:01:01] [INFO ] Deduced a trap composed of 165 places in 269 ms of which 3 ms to minimize.
[2024-06-01 13:01:01] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 2 ms to minimize.
[2024-06-01 13:01:03] [INFO ] Deduced a trap composed of 163 places in 389 ms of which 3 ms to minimize.
[2024-06-01 13:01:03] [INFO ] Deduced a trap composed of 165 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:01:03] [INFO ] Deduced a trap composed of 163 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:01:05] [INFO ] Deduced a trap composed of 166 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:01:05] [INFO ] Deduced a trap composed of 163 places in 221 ms of which 2 ms to minimize.
[2024-06-01 13:01:06] [INFO ] Deduced a trap composed of 165 places in 214 ms of which 2 ms to minimize.
[2024-06-01 13:01:07] [INFO ] Deduced a trap composed of 167 places in 224 ms of which 2 ms to minimize.
[2024-06-01 13:01:09] [INFO ] Deduced a trap composed of 163 places in 241 ms of which 2 ms to minimize.
[2024-06-01 13:01:09] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:01:09] [INFO ] Deduced a trap composed of 165 places in 211 ms of which 2 ms to minimize.
[2024-06-01 13:01:10] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:01:10] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 2 ms to minimize.
[2024-06-01 13:01:10] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 2 ms to minimize.
[2024-06-01 13:01:10] [INFO ] Deduced a trap composed of 217 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:01:11] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:01:11] [INFO ] Deduced a trap composed of 165 places in 274 ms of which 3 ms to minimize.
SMT process timed out in 32180ms, After SMT, problems are : Problem set: 0 solved, 1118 unsolved
Search for dead transitions found 0 dead transitions in 32192ms
Starting structural reductions in LTL mode, iteration 1 : 552/561 places, 1119/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32892 ms. Remains : 552/561 places, 1119/1128 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-13 finished in 33171 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||X(X(p1))))) U (X(X(p3))&&p2)))'
Support contains 8 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 553 transition count 1120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 553 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 550 transition count 1117
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 549 transition count 1116
Applied a total of 24 rules in 42 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-06-01 13:01:11] [INFO ] Computed 6 invariants in 15 ms
[2024-06-01 13:01:11] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 13:01:11] [INFO ] Invariant cache hit.
[2024-06-01 13:01:12] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-06-01 13:01:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 13:01:34] [INFO ] Deduced a trap composed of 164 places in 282 ms of which 3 ms to minimize.
[2024-06-01 13:01:34] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:01:34] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 2 ms to minimize.
[2024-06-01 13:01:36] [INFO ] Deduced a trap composed of 163 places in 248 ms of which 2 ms to minimize.
[2024-06-01 13:01:36] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:01:36] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:01:36] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:01:37] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 2 ms to minimize.
[2024-06-01 13:01:37] [INFO ] Deduced a trap composed of 165 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:01:37] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:01:38] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:01:38] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2024-06-01 13:01:38] [INFO ] Deduced a trap composed of 163 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:01:39] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:01:39] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:01:40] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:01:40] [INFO ] Deduced a trap composed of 163 places in 194 ms of which 2 ms to minimize.
[2024-06-01 13:01:41] [INFO ] Deduced a trap composed of 165 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:01:42] [INFO ] Deduced a trap composed of 167 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:01:42] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 13:01:55] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:01:59] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2024-06-01 13:02:00] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 2 ms to minimize.
[2024-06-01 13:02:01] [INFO ] Deduced a trap composed of 167 places in 269 ms of which 3 ms to minimize.
[2024-06-01 13:02:02] [INFO ] Deduced a trap composed of 167 places in 326 ms of which 3 ms to minimize.
[2024-06-01 13:02:03] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 2 ms to minimize.
[2024-06-01 13:02:03] [INFO ] Deduced a trap composed of 167 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:02:03] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:02:04] [INFO ] Deduced a trap composed of 167 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:02:04] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 2 ms to minimize.
[2024-06-01 13:02:04] [INFO ] Deduced a trap composed of 164 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:02:05] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:02:05] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 2 ms to minimize.
[2024-06-01 13:02:05] [INFO ] Deduced a trap composed of 203 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:02:05] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:02:06] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 2 ms to minimize.
[2024-06-01 13:02:06] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 62151ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62163ms
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62837 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-15
Product exploration explored 100000 steps with 33444 reset in 224 ms.
Product exploration explored 100000 steps with 33200 reset in 163 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 113 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 10 to 6
RANDOM walk for 40000 steps (446 resets) in 219 ms. (181 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (57 resets) in 29 ms. (1333 steps per ms) remains 1/5 properties
[2024-06-01 13:02:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 530/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 530/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10681 steps, including 124 resets, run visited all 1 properties in 18 ms. (steps per millisecond=593 )
Parikh walk visited 1 properties in 19 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F p0), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F p1)]
Knowledge based reduction with 12 factoid took 447 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
[2024-06-01 13:02:18] [INFO ] Invariant cache hit.
[2024-06-01 13:02:18] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 13:02:18] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2024-06-01 13:02:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:02:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 13:02:19] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2024-06-01 13:02:19] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 78 ms.
[2024-06-01 13:02:20] [INFO ] Added : 79 causal constraints over 16 iterations in 950 ms. Result :sat
Could not prove EG (NOT p2)
[2024-06-01 13:02:20] [INFO ] Invariant cache hit.
[2024-06-01 13:02:21] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 13:02:21] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-06-01 13:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:02:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 13:02:22] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2024-06-01 13:02:22] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 85 ms.
[2024-06-01 13:02:23] [INFO ] Added : 92 causal constraints over 19 iterations in 971 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 8 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 10 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-01 13:02:23] [INFO ] Invariant cache hit.
[2024-06-01 13:02:23] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 13:02:23] [INFO ] Invariant cache hit.
[2024-06-01 13:02:23] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-06-01 13:02:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 164 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 2 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 165 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 163 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:02:48] [INFO ] Deduced a trap composed of 163 places in 204 ms of which 2 ms to minimize.
[2024-06-01 13:02:48] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:02:48] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 2 ms to minimize.
[2024-06-01 13:02:48] [INFO ] Deduced a trap composed of 165 places in 244 ms of which 2 ms to minimize.
[2024-06-01 13:02:49] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 2 ms to minimize.
[2024-06-01 13:02:49] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:02:49] [INFO ] Deduced a trap composed of 163 places in 217 ms of which 2 ms to minimize.
[2024-06-01 13:02:50] [INFO ] Deduced a trap composed of 165 places in 227 ms of which 2 ms to minimize.
[2024-06-01 13:02:51] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2024-06-01 13:02:51] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:02:52] [INFO ] Deduced a trap composed of 163 places in 245 ms of which 2 ms to minimize.
[2024-06-01 13:02:52] [INFO ] Deduced a trap composed of 165 places in 214 ms of which 2 ms to minimize.
[2024-06-01 13:02:53] [INFO ] Deduced a trap composed of 167 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:02:54] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 13:03:07] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:03:10] [INFO ] Deduced a trap composed of 162 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:03:10] [INFO ] Deduced a trap composed of 165 places in 225 ms of which 2 ms to minimize.
[2024-06-01 13:03:10] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:03:12] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 2 ms to minimize.
[2024-06-01 13:03:13] [INFO ] Deduced a trap composed of 167 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:03:14] [INFO ] Deduced a trap composed of 167 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:03:15] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:03:15] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 2 ms to minimize.
[2024-06-01 13:03:15] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:03:15] [INFO ] Deduced a trap composed of 167 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:03:16] [INFO ] Deduced a trap composed of 166 places in 253 ms of which 2 ms to minimize.
[2024-06-01 13:03:16] [INFO ] Deduced a trap composed of 164 places in 296 ms of which 3 ms to minimize.
[2024-06-01 13:03:16] [INFO ] Deduced a trap composed of 167 places in 291 ms of which 3 ms to minimize.
[2024-06-01 13:03:17] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:03:17] [INFO ] Deduced a trap composed of 203 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:03:17] [INFO ] Deduced a trap composed of 166 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:03:18] [INFO ] Deduced a trap composed of 167 places in 235 ms of which 2 ms to minimize.
[2024-06-01 13:03:18] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 61912ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61922ms
Finished structural reductions in LTL mode , in 1 iterations and 62556 ms. Remains : 549/549 places, 1116/1116 transitions.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 116 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 10 to 6
RANDOM walk for 40000 steps (447 resets) in 217 ms. (183 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (58 resets) in 20 ms. (1904 steps per ms) remains 1/5 properties
[2024-06-01 13:03:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 530/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 530/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 906ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 5 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 558 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1041 edges and 479 vertex of which 474 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 339 rules applied. Total rules applied 341 place count 474 transition count 682
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 344 rules applied. Total rules applied 685 place count 140 transition count 672
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 690 place count 135 transition count 672
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 690 place count 135 transition count 646
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 742 place count 109 transition count 646
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 743 place count 109 transition count 645
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 795 place count 83 transition count 619
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 805 place count 83 transition count 609
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 822 place count 66 transition count 297
Iterating global reduction 5 with 17 rules applied. Total rules applied 839 place count 66 transition count 297
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 846 place count 66 transition count 290
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 851 place count 61 transition count 285
Iterating global reduction 6 with 5 rules applied. Total rules applied 856 place count 61 transition count 285
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 866 place count 56 transition count 280
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 6 with 6 rules applied. Total rules applied 872 place count 53 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 880 place count 53 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 882 place count 52 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 890 place count 52 transition count 278
Free-agglomeration rule applied 30 times.
Iterating global reduction 6 with 30 rules applied. Total rules applied 920 place count 52 transition count 248
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 967 place count 22 transition count 231
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 972 place count 17 transition count 226
Iterating global reduction 7 with 5 rules applied. Total rules applied 977 place count 17 transition count 226
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1008 place count 17 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 8 with 50 rules applied. Total rules applied 1058 place count 17 transition count 145
Applied a total of 1058 rules in 58 ms. Remains 17 /549 variables (removed 532) and now considering 145/1116 (removed 971) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 17/549 places, 145/1116 transitions.
RANDOM walk for 265 steps (0 resets) in 4 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F p0), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F p1)]
Knowledge based reduction with 12 factoid took 317 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
[2024-06-01 13:03:28] [INFO ] Invariant cache hit.
[2024-06-01 13:03:28] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 13:03:28] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2024-06-01 13:03:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:03:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 13:03:29] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2024-06-01 13:03:29] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 60 ms.
[2024-06-01 13:03:30] [INFO ] Added : 79 causal constraints over 16 iterations in 882 ms. Result :sat
Could not prove EG (NOT p2)
[2024-06-01 13:03:30] [INFO ] Invariant cache hit.
[2024-06-01 13:03:30] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 13:03:31] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2024-06-01 13:03:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:03:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 13:03:32] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2024-06-01 13:03:32] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 53 ms.
[2024-06-01 13:03:33] [INFO ] Added : 92 causal constraints over 19 iterations in 950 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 33334 reset in 154 ms.
Product exploration explored 100000 steps with 33468 reset in 160 ms.
Applying partial POR strategy [false, false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Support contains 8 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 552 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 0 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Performed 321 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 321 rules applied. Total rules applied 322 place count 479 transition count 1036
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 327 place count 479 transition count 1031
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 327 place count 479 transition count 1036
Deduced a syphon composed of 331 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 479 transition count 1036
Discarding 272 places :
Symmetric choice reduction at 2 with 272 rule applications. Total rules 609 place count 207 transition count 764
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 2 with 272 rules applied. Total rules applied 881 place count 207 transition count 764
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 921 place count 207 transition count 764
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 972 place count 156 transition count 413
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 1023 place count 156 transition count 413
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1029 place count 156 transition count 407
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1045 place count 140 transition count 386
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 1061 place count 140 transition count 386
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1066 place count 135 transition count 381
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 1071 place count 135 transition count 381
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1079 place count 135 transition count 421
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1092 place count 122 transition count 395
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 1105 place count 122 transition count 395
Deduced a syphon composed of 52 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1115 place count 122 transition count 385
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 1115 rules in 90 ms. Remains 122 /549 variables (removed 427) and now considering 385/1116 (removed 731) transitions.
[2024-06-01 13:03:34] [INFO ] Redundant transitions in 2 ms returned []
Running 377 sub problems to find dead transitions.
[2024-06-01 13:03:34] [INFO ] Flow matrix only has 379 transitions (discarded 6 similar events)
// Phase 1: matrix 379 rows 122 cols
[2024-06-01 13:03:34] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 13:03:34] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:03:39] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/22 constraints. Problems are: Problem set: 8 solved, 369 unsolved
[2024-06-01 13:03:40] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/23 constraints. Problems are: Problem set: 8 solved, 369 unsolved
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/24 constraints. Problems are: Problem set: 10 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/24 constraints. Problems are: Problem set: 10 solved, 367 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 6 (OVERLAPS) 378/500 variables, 122/146 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 30/176 constraints. Problems are: Problem set: 75 solved, 302 unsolved
[2024-06-01 13:03:45] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 1/177 constraints. Problems are: Problem set: 75 solved, 302 unsolved
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 9/186 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/186 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 11 (OVERLAPS) 1/501 variables, 1/187 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/501 variables, 0/187 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 13 (OVERLAPS) 0/501 variables, 0/187 constraints. Problems are: Problem set: 75 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 187 constraints, problems are : Problem set: 75 solved, 302 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 75 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 53/122 variables, 2/2 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 32/34 constraints. Problems are: Problem set: 75 solved, 302 unsolved
[2024-06-01 13:04:05] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/35 constraints. Problems are: Problem set: 75 solved, 302 unsolved
[2024-06-01 13:04:06] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/36 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/36 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 378/500 variables, 122/158 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 30/188 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 302/490 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/490 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 10 (OVERLAPS) 1/501 variables, 1/491 constraints. Problems are: Problem set: 75 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 491 constraints, problems are : Problem set: 75 solved, 302 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 302/377 constraints, Known Traps: 34/34 constraints]
After SMT, in 60574ms problems are : Problem set: 75 solved, 302 unsolved
Search for dead transitions found 75 dead transitions in 60577ms
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 : 122/549 places, 310/1116 transitions.
Graph (complete) has 414 edges and 122 vertex of which 70 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.0 ms
Discarding 52 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 318
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 8 ms. Remains 70 /122 variables (removed 52) and now considering 318/310 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/549 places, 318/1116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60683 ms. Remains : 70/549 places, 318/1116 transitions.
Support contains 8 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 11 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-06-01 13:04:34] [INFO ] Computed 6 invariants in 6 ms
[2024-06-01 13:04:35] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 13:04:35] [INFO ] Invariant cache hit.
[2024-06-01 13:04:35] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-06-01 13:04:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 13:04:57] [INFO ] Deduced a trap composed of 164 places in 301 ms of which 3 ms to minimize.
[2024-06-01 13:04:57] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 2 ms to minimize.
[2024-06-01 13:04:58] [INFO ] Deduced a trap composed of 165 places in 231 ms of which 2 ms to minimize.
[2024-06-01 13:04:59] [INFO ] Deduced a trap composed of 163 places in 278 ms of which 3 ms to minimize.
[2024-06-01 13:05:00] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:05:00] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:05:00] [INFO ] Deduced a trap composed of 163 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:05:00] [INFO ] Deduced a trap composed of 164 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:05:01] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:05:01] [INFO ] Deduced a trap composed of 165 places in 252 ms of which 2 ms to minimize.
[2024-06-01 13:05:01] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 2 ms to minimize.
[2024-06-01 13:05:02] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:05:02] [INFO ] Deduced a trap composed of 163 places in 220 ms of which 2 ms to minimize.
[2024-06-01 13:05:02] [INFO ] Deduced a trap composed of 165 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:05:03] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:05:04] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:05:04] [INFO ] Deduced a trap composed of 163 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:05:05] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 2 ms to minimize.
[2024-06-01 13:05:06] [INFO ] Deduced a trap composed of 167 places in 224 ms of which 2 ms to minimize.
[2024-06-01 13:05:06] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1665 variables, and 26 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/549 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-06-01 13:05:18] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 2 ms to minimize.
[2024-06-01 13:05:21] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:05:21] [INFO ] Deduced a trap composed of 165 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:05:22] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:05:23] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:05:24] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 2 ms to minimize.
[2024-06-01 13:05:25] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:05:25] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:05:26] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:05:26] [INFO ] Deduced a trap composed of 166 places in 265 ms of which 2 ms to minimize.
[2024-06-01 13:05:26] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 2 ms to minimize.
[2024-06-01 13:05:27] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:05:27] [INFO ] Deduced a trap composed of 164 places in 270 ms of which 3 ms to minimize.
[2024-06-01 13:05:27] [INFO ] Deduced a trap composed of 167 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:05:28] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:05:28] [INFO ] Deduced a trap composed of 203 places in 253 ms of which 2 ms to minimize.
[2024-06-01 13:05:28] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:05:28] [INFO ] Deduced a trap composed of 167 places in 217 ms of which 2 ms to minimize.
[2024-06-01 13:05:29] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1665 variables, and 45 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 39/39 constraints]
After SMT, in 62035ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62046ms
Finished structural reductions in LTL mode , in 1 iterations and 62666 ms. Remains : 549/549 places, 1116/1116 transitions.
Treatment of property StigmergyElection-PT-05b-LTLFireability-15 finished in 265857 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((G(!p0)||(!p0&&F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U G((!p2||F(p3))))))'
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||X(X(p1))))) U (X(X(p3))&&p2)))'
[2024-06-01 13:05:37] [INFO ] Flatten gal took : 50 ms
[2024-06-01 13:05:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 13:05:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 561 places, 1128 transitions and 6465 arcs took 9 ms.
Total runtime 1121711 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-05b-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717248540920

--------------------
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-05b-LTLFireability-09
ltl formula formula --ltl=/tmp/3596/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 561 places, 1128 transitions and 6465 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3596/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3596/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3596/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.030 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3596/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 562 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 562, there are 1154 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): ~95 levels ~10000 states ~25324 transitions
pnml2lts-mc( 0/ 4): ~94 levels ~20000 states ~43268 transitions
pnml2lts-mc( 0/ 4): ~94 levels ~40000 states ~102476 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~80000 states ~205980 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~160000 states ~443552 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~320000 states ~896948 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~640000 states ~1807784 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~1280000 states ~3966304 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~2560000 states ~9011708 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~5120000 states ~19080164 transitions
pnml2lts-mc( 2/ 4): ~110 levels ~10240000 states ~39472316 transitions
pnml2lts-mc( 2/ 4): ~110 levels ~20480000 states ~77687056 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32785399
pnml2lts-mc( 0/ 4): unique states count: 33553078
pnml2lts-mc( 0/ 4): unique transitions count: 149601315
pnml2lts-mc( 0/ 4): - self-loop count: 4367
pnml2lts-mc( 0/ 4): - claim dead count: 115823428
pnml2lts-mc( 0/ 4): - claim found count: 219221
pnml2lts-mc( 0/ 4): - claim success count: 33553086
pnml2lts-mc( 0/ 4): - cum. max stack depth: 545
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553086 states 149601332 transitions, fanout: 4.459
pnml2lts-mc( 0/ 4): Total exploration time 703.800 sec (703.790 sec minimum, 703.797 sec on average)
pnml2lts-mc( 0/ 4): States per second: 47674, Transitions per second: 212562
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 261.3MB, 8.2 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/8.0%
pnml2lts-mc( 0/ 4): Stored 1158 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 261.3MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-05b-LTLFireability-12
ltl formula formula --ltl=/tmp/3596/ltl_1_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 561 places, 1128 transitions and 6465 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.050 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3596/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3596/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3596/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3596/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 562 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 562, there are 2655 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( 1/ 4): ~95 levels ~10000 states ~31524 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~20000 states ~65952 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~40000 states ~137356 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~80000 states ~301428 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~160000 states ~662352 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~320000 states ~1378772 transitions
pnml2lts-mc( 1/ 4): ~103 levels ~640000 states ~2758676 transitions
pnml2lts-mc( 1/ 4): ~103 levels ~1280000 states ~5518768 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~2560000 states ~9293636 transitions
pnml2lts-mc( 3/ 4): ~118 levels ~5120000 states ~19209448 transitions
pnml2lts-mc( 0/ 4): ~102 levels ~10240000 states ~37123988 transitions
pnml2lts-mc( 0/ 4): ~110 levels ~20480000 states ~75964184 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31690113
pnml2lts-mc( 0/ 4): unique states count: 33552823
pnml2lts-mc( 0/ 4): unique transitions count: 149938013
pnml2lts-mc( 0/ 4): - self-loop count: 3801
pnml2lts-mc( 0/ 4): - claim dead count: 115712895
pnml2lts-mc( 0/ 4): - claim found count: 666935
pnml2lts-mc( 0/ 4): - claim success count: 33552833
pnml2lts-mc( 0/ 4): - cum. max stack depth: 905
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552833 states 149938059 transitions, fanout: 4.469
pnml2lts-mc( 0/ 4): Total exploration time 697.100 sec (697.090 sec minimum, 697.093 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48132, Transitions per second: 215088
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 263.1MB, 8.2 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/11.0%
pnml2lts-mc( 0/ 4): Stored 1158 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 263.1MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-05b-LTLFireability-15
ltl formula formula --ltl=/tmp/3596/ltl_2_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 561 places, 1128 transitions and 6465 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.050 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3596/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3596/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3596/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3596/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 562, there are 1302 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~76!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 275
pnml2lts-mc( 0/ 4): unique transitions count: 2319
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 285
pnml2lts-mc( 0/ 4): - cum. max stack depth: 285
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 285 states 2358 transitions, fanout: 8.274
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 14250, Transitions per second: 117900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 21.4 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1158 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~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-05b"
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-05b, 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-171690532000308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05b.tgz
mv StigmergyElection-PT-05b 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 ;