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.r399-tall-171690530100308.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 greatspnxred
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 r399-tall-171690530100308
=====================================================================

--------------------
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 1717010154048

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:15:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:15:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:15:55] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-29 19:15:55] [INFO ] Transformed 699 places.
[2024-05-29 19:15:55] [INFO ] Transformed 1266 transitions.
[2024-05-29 19:15:55] [INFO ] Found NUPN structural information;
[2024-05-29 19:15:55] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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 175 ms. Remains 561 /699 variables (removed 138) and now considering 1128/1266 (removed 138) transitions.
// Phase 1: matrix 1128 rows 561 cols
[2024-05-29 19:15:55] [INFO ] Computed 6 invariants in 41 ms
[2024-05-29 19:15:56] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-29 19:15:56] [INFO ] Invariant cache hit.
[2024-05-29 19:15:56] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 1127 sub problems to find dead transitions.
[2024-05-29 19:15:56] [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-05-29 19:16:20] [INFO ] Deduced a trap composed of 166 places in 396 ms of which 40 ms to minimize.
[2024-05-29 19:16:20] [INFO ] Deduced a trap composed of 165 places in 256 ms of which 3 ms to minimize.
[2024-05-29 19:16:22] [INFO ] Deduced a trap composed of 168 places in 279 ms of which 3 ms to minimize.
[2024-05-29 19:16:22] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 3 ms to minimize.
[2024-05-29 19:16:22] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 3 ms to minimize.
[2024-05-29 19:16:23] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 3 ms to minimize.
[2024-05-29 19:16:23] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 2 ms to minimize.
[2024-05-29 19:16:24] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 2 ms to minimize.
[2024-05-29 19:16:24] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 3 ms to minimize.
[2024-05-29 19:16:25] [INFO ] Deduced a trap composed of 170 places in 214 ms of which 3 ms to minimize.
[2024-05-29 19:16:26] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 3 ms to minimize.
[2024-05-29 19:16:26] [INFO ] Deduced a trap composed of 167 places in 209 ms of which 2 ms to minimize.
[2024-05-29 19:16:27] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 3 ms to minimize.
[2024-05-29 19:16:27] [INFO ] Deduced a trap composed of 167 places in 217 ms of which 2 ms to minimize.
[2024-05-29 19:16:27] [INFO ] Deduced a trap composed of 170 places in 257 ms of which 3 ms to minimize.
[2024-05-29 19:16:28] [INFO ] Deduced a trap composed of 168 places in 260 ms of which 2 ms to minimize.
[2024-05-29 19:16:28] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
[2024-05-29 19:16:28] [INFO ] Deduced a trap composed of 166 places in 216 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 30051 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-05-29 19:16:40] [INFO ] Deduced a trap composed of 166 places in 292 ms of which 3 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 2 ms to minimize.
[2024-05-29 19:16:46] [INFO ] Deduced a trap composed of 225 places in 367 ms of which 3 ms to minimize.
[2024-05-29 19:16:47] [INFO ] Deduced a trap composed of 167 places in 300 ms of which 3 ms to minimize.
[2024-05-29 19:16:47] [INFO ] Deduced a trap composed of 170 places in 268 ms of which 3 ms to minimize.
[2024-05-29 19:16:48] [INFO ] Deduced a trap composed of 168 places in 310 ms of which 4 ms to minimize.
[2024-05-29 19:16:48] [INFO ] Deduced a trap composed of 169 places in 281 ms of which 3 ms to minimize.
[2024-05-29 19:16:48] [INFO ] Deduced a trap composed of 193 places in 253 ms of which 3 ms to minimize.
[2024-05-29 19:16:48] [INFO ] Deduced a trap composed of 172 places in 245 ms of which 3 ms to minimize.
[2024-05-29 19:16:49] [INFO ] Deduced a trap composed of 170 places in 228 ms of which 2 ms to minimize.
[2024-05-29 19:16:49] [INFO ] Deduced a trap composed of 167 places in 205 ms of which 2 ms to minimize.
[2024-05-29 19:16:49] [INFO ] Deduced a trap composed of 165 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:16:50] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 3 ms to minimize.
[2024-05-29 19:16:50] [INFO ] Deduced a trap composed of 167 places in 269 ms of which 3 ms to minimize.
[2024-05-29 19:16:50] [INFO ] Deduced a trap composed of 222 places in 263 ms of which 3 ms to minimize.
[2024-05-29 19:16:51] [INFO ] Deduced a trap composed of 170 places in 242 ms of which 2 ms to minimize.
[2024-05-29 19:16:58] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 2 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 30028 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 62523ms problems are : Problem set: 0 solved, 1127 unsolved
Search for dead transitions found 0 dead transitions in 62552ms
Starting structural reductions in LTL mode, iteration 1 : 561/699 places, 1128/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63490 ms. Remains : 561/699 places, 1128/1266 transitions.
Support contains 58 out of 561 places after structural reductions.
[2024-05-29 19:16:59] [INFO ] Flatten gal took : 133 ms
[2024-05-29 19:16:59] [INFO ] Flatten gal took : 85 ms
[2024-05-29 19:16:59] [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 (447 resets) in 1442 ms. (27 steps per ms) remains 25/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 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 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 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 15 ms. (250 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 21 ms. (182 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 4003 steps (8 resets) in 17 ms. (222 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 4002 steps (8 resets) in 11 ms. (333 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 11 ms. (333 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
[2024-05-29 19:17:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 502/547 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-29 19:17:00] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 3 ms to minimize.
[2024-05-29 19:17:01] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 3 ms to minimize.
[2024-05-29 19:17:01] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 14/561 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1128/1689 variables, 561/570 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1689 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/1689 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1689/1689 variables, and 570 constraints, problems are : Problem set: 0 solved, 24 unsolved in 3128 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 502/547 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-05-29 19:17:04] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 14/561 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1128/1689 variables, 561/571 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1689 variables, 23/594 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-05-29 19:17:06] [INFO ] Deduced a trap composed of 167 places in 199 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1689 variables, 1/595 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1689 variables, 0/595 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1689/1689 variables, and 595 constraints, problems are : Problem set: 1 solved, 23 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 23/24 constraints, Known Traps: 5/5 constraints]
After SMT, in 8207ms problems are : Problem set: 1 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Graph (trivial) has 490 edges and 561 vertex of which 69 / 561 are part of one of the 12 SCC in 10 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.7 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 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 287 rules applied. Total rules applied 289 place count 500 transition count 765
Reduce places removed 283 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 298 rules applied. Total rules applied 587 place count 217 transition count 750
Reduce places removed 8 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 42 rules applied. Total rules applied 629 place count 209 transition count 716
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 663 place count 175 transition count 716
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 663 place count 175 transition count 693
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 709 place count 152 transition count 693
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 710 place count 151 transition count 691
Iterating global reduction 4 with 1 rules applied. Total rules applied 711 place count 151 transition count 691
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 712 place count 151 transition count 690
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 713 place count 150 transition count 690
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 714 place count 149 transition count 688
Iterating global reduction 6 with 1 rules applied. Total rules applied 715 place count 149 transition count 688
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 759 place count 127 transition count 665
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 764 place count 127 transition count 660
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 768 place count 123 transition count 648
Iterating global reduction 7 with 4 rules applied. Total rules applied 772 place count 123 transition count 648
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 773 place count 123 transition count 647
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 789 place count 115 transition count 639
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 799 place count 110 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 801 place count 110 transition count 645
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 810 place count 110 transition count 636
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 812 place count 109 transition count 642
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 820 place count 109 transition count 634
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 821 place count 109 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 822 place count 108 transition count 633
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 827 place count 103 transition count 628
Iterating global reduction 10 with 5 rules applied. Total rules applied 832 place count 103 transition count 628
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 834 place count 103 transition count 628
Applied a total of 834 rules in 277 ms. Remains 103 /561 variables (removed 458) and now considering 628/1128 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 103/561 places, 628/1128 transitions.
RANDOM walk for 40000 steps (2102 resets) in 1266 ms. (31 steps per ms) remains 17/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (29 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (14 resets) in 7 ms. (500 steps per ms) remains 10/17 properties
BEST_FIRST walk for 4004 steps (17 resets) in 8 ms. (444 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4004 steps (29 resets) in 8 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4002 steps (28 resets) in 21 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4004 steps (30 resets) in 9 ms. (400 steps per ms) remains 8/8 properties
// Phase 1: matrix 628 rows 103 cols
[2024-05-29 19:17:09] [INFO ] Computed 6 invariants in 7 ms
[2024-05-29 19:17:09] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 80/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 628/731 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 14/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/731 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 731/731 variables, and 123 constraints, problems are : Problem set: 0 solved, 8 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 80/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 628/731 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 14/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 8/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/731 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 731/731 variables, and 131 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1606ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 2 properties in 1129 ms.
Support contains 16 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 628/628 transitions.
Graph (trivial) has 72 edges and 103 vertex of which 8 / 103 are part of one of the 4 SCC in 0 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 487 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 97 transition count 605
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 84 transition count 605
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 29 place count 84 transition count 600
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 39 place count 79 transition count 600
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 44 place count 74 transition count 515
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 74 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 74 transition count 514
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 74 transition count 513
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 73 transition count 513
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 53 place count 73 transition count 512
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 72 transition count 511
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 72 transition count 511
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 4 with 10 rules applied. Total rules applied 65 place count 67 transition count 506
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 67 place count 67 transition count 504
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 72 place count 62 transition count 499
Iterating global reduction 5 with 5 rules applied. Total rules applied 77 place count 62 transition count 499
Free-agglomeration rule applied 34 times.
Iterating global reduction 5 with 34 rules applied. Total rules applied 111 place count 62 transition count 465
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 153 place count 28 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 6 with 54 rules applied. Total rules applied 207 place count 28 transition count 403
Applied a total of 207 rules in 105 ms. Remains 28 /103 variables (removed 75) and now considering 403/628 (removed 225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 28/103 places, 403/628 transitions.
RANDOM walk for 36470 steps (3264 resets) in 244 ms. (148 steps per ms) remains 0/6 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 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 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 95 ms. Remains 66 /561 variables (removed 495) and now considering 312/1128 (removed 816) transitions.
[2024-05-29 19:17:12] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
// Phase 1: matrix 306 rows 66 cols
[2024-05-29 19:17:12] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 19:17:12] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 19:17:12] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
[2024-05-29 19:17:12] [INFO ] Invariant cache hit.
[2024-05-29 19:17:13] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 19:17:13] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-29 19:17:13] [INFO ] Redundant transitions in 16 ms returned []
Running 295 sub problems to find dead transitions.
[2024-05-29 19:17:13] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
[2024-05-29 19:17:13] [INFO ] Invariant cache hit.
[2024-05-29 19:17:13] [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-05-29 19:17:14] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:17:15] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:17:16] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:17:16] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:17:16] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:17:16] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 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-05-29 19:17:19] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:17:19] [INFO ] Deduced a trap composed of 23 places in 61 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 13289 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 30011 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 43929ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 43932ms
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 44275 ms. Remains : 66/561 places, 312/1128 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 14237 steps with 1478 reset in 105 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-00 finished in 44659 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 3 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 0 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 0 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 69 ms. Remains 61 /561 variables (removed 500) and now considering 179/1128 (removed 949) transitions.
[2024-05-29 19:17:57] [INFO ] Flow matrix only has 173 transitions (discarded 6 similar events)
// Phase 1: matrix 173 rows 61 cols
[2024-05-29 19:17:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 19:17:57] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 19:17:57] [INFO ] Flow matrix only has 173 transitions (discarded 6 similar events)
[2024-05-29 19:17:57] [INFO ] Invariant cache hit.
[2024-05-29 19:17:57] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 19:17:57] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-29 19:17:57] [INFO ] Redundant transitions in 1 ms returned []
Running 162 sub problems to find dead transitions.
[2024-05-29 19:17:57] [INFO ] Flow matrix only has 173 transitions (discarded 6 similar events)
[2024-05-29 19:17:57] [INFO ] Invariant cache hit.
[2024-05-29 19:17:57] [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-05-29 19:17:58] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:18:00] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 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-05-29 19:18:01] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 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 7523 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 11506 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 19138ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 19140ms
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 19355 ms. Remains : 61/561 places, 179/1128 transitions.
Stuttering acceptance computed with spot in 159 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 9 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-02 finished in 19539 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 36 ms. Remains 551 /561 variables (removed 10) and now considering 1118/1128 (removed 10) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2024-05-29 19:18:17] [INFO ] Computed 6 invariants in 16 ms
[2024-05-29 19:18:17] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-29 19:18:17] [INFO ] Invariant cache hit.
[2024-05-29 19:18:17] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2024-05-29 19:18:17] [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-05-29 19:18:39] [INFO ] Deduced a trap composed of 164 places in 276 ms of which 3 ms to minimize.
[2024-05-29 19:18:39] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 2 ms to minimize.
[2024-05-29 19:18:40] [INFO ] Deduced a trap composed of 165 places in 230 ms of which 3 ms to minimize.
[2024-05-29 19:18:41] [INFO ] Deduced a trap composed of 167 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:18:42] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 3 ms to minimize.
[2024-05-29 19:18:42] [INFO ] Deduced a trap composed of 163 places in 229 ms of which 3 ms to minimize.
[2024-05-29 19:18:42] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 2 ms to minimize.
[2024-05-29 19:18:43] [INFO ] Deduced a trap composed of 166 places in 234 ms of which 2 ms to minimize.
[2024-05-29 19:18:44] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 3 ms to minimize.
[2024-05-29 19:18:44] [INFO ] Deduced a trap composed of 163 places in 223 ms of which 3 ms to minimize.
[2024-05-29 19:18:44] [INFO ] Deduced a trap composed of 165 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:18:45] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 2 ms to minimize.
[2024-05-29 19:18:45] [INFO ] Deduced a trap composed of 167 places in 249 ms of which 3 ms to minimize.
[2024-05-29 19:18:45] [INFO ] Deduced a trap composed of 221 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:18:46] [INFO ] Deduced a trap composed of 169 places in 233 ms of which 3 ms to minimize.
[2024-05-29 19:18:47] [INFO ] Deduced a trap composed of 218 places in 243 ms of which 2 ms to minimize.
[2024-05-29 19:18:48] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 2 ms to minimize.
[2024-05-29 19:18:48] [INFO ] Deduced a trap composed of 168 places in 274 ms of which 3 ms to minimize.
[2024-05-29 19:18:49] [INFO ] Deduced a trap composed of 224 places in 271 ms of which 3 ms to minimize.
[2024-05-29 19:18:49] [INFO ] Deduced a trap composed of 221 places in 260 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 30021 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-05-29 19:19:02] [INFO ] Deduced a trap composed of 168 places in 228 ms of which 3 ms to minimize.
[2024-05-29 19:19:02] [INFO ] Deduced a trap composed of 169 places in 246 ms of which 3 ms to minimize.
[2024-05-29 19:19:03] [INFO ] Deduced a trap composed of 163 places in 258 ms of which 2 ms to minimize.
[2024-05-29 19:19:04] [INFO ] Deduced a trap composed of 168 places in 266 ms of which 3 ms to minimize.
[2024-05-29 19:19:04] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:19:04] [INFO ] Deduced a trap composed of 167 places in 229 ms of which 3 ms to minimize.
[2024-05-29 19:19:05] [INFO ] Deduced a trap composed of 167 places in 239 ms of which 2 ms to minimize.
[2024-05-29 19:19:05] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 3 ms to minimize.
[2024-05-29 19:19:06] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 2 ms to minimize.
[2024-05-29 19:19:06] [INFO ] Deduced a trap composed of 167 places in 208 ms of which 2 ms to minimize.
[2024-05-29 19:19:07] [INFO ] Deduced a trap composed of 167 places in 220 ms of which 3 ms to minimize.
[2024-05-29 19:19:08] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:19:08] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 3 ms to minimize.
[2024-05-29 19:19:08] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 3 ms to minimize.
[2024-05-29 19:19:09] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 2 ms to minimize.
[2024-05-29 19:19:09] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 2 ms to minimize.
[2024-05-29 19:19:10] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2024-05-29 19:19:11] [INFO ] Deduced a trap composed of 163 places in 268 ms of which 3 ms to minimize.
[2024-05-29 19:19:11] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 3 ms to minimize.
[2024-05-29 19:19:11] [INFO ] Deduced a trap composed of 164 places in 252 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-05-29 19:19:12] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 2 ms to minimize.
[2024-05-29 19:19:17] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 2 ms to minimize.
[2024-05-29 19:19:18] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2024-05-29 19:19:18] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1669 variables, and 50 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/551 constraints, PredecessorRefiner: 0/1117 constraints, Known Traps: 44/44 constraints]
After SMT, in 62188ms problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 62200ms
Starting structural reductions in LTL mode, iteration 1 : 551/561 places, 1118/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62898 ms. Remains : 551/561 places, 1118/1128 transitions.
Stuttering acceptance computed with spot in 201 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 63125 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 40 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-29 19:19:20] [INFO ] Computed 6 invariants in 14 ms
[2024-05-29 19:19:20] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-29 19:19:20] [INFO ] Invariant cache hit.
[2024-05-29 19:19:20] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:19:20] [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-05-29 19:19:42] [INFO ] Deduced a trap composed of 164 places in 271 ms of which 3 ms to minimize.
[2024-05-29 19:19:43] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 2 ms to minimize.
[2024-05-29 19:19:43] [INFO ] Deduced a trap composed of 165 places in 201 ms of which 3 ms to minimize.
[2024-05-29 19:19:45] [INFO ] Deduced a trap composed of 163 places in 251 ms of which 3 ms to minimize.
[2024-05-29 19:19:45] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2024-05-29 19:19:45] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 2 ms to minimize.
[2024-05-29 19:19:45] [INFO ] Deduced a trap composed of 163 places in 199 ms of which 2 ms to minimize.
[2024-05-29 19:19:46] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 3 ms to minimize.
[2024-05-29 19:19:46] [INFO ] Deduced a trap composed of 165 places in 216 ms of which 3 ms to minimize.
[2024-05-29 19:19:46] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 2 ms to minimize.
[2024-05-29 19:19:46] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 3 ms to minimize.
[2024-05-29 19:19:47] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 2 ms to minimize.
[2024-05-29 19:19:47] [INFO ] Deduced a trap composed of 163 places in 198 ms of which 2 ms to minimize.
[2024-05-29 19:19:48] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 2 ms to minimize.
[2024-05-29 19:19:48] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 4 ms to minimize.
[2024-05-29 19:19:49] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 3 ms to minimize.
[2024-05-29 19:19:49] [INFO ] Deduced a trap composed of 163 places in 199 ms of which 2 ms to minimize.
[2024-05-29 19:19:49] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 2 ms to minimize.
[2024-05-29 19:19:51] [INFO ] Deduced a trap composed of 167 places in 218 ms of which 3 ms to minimize.
[2024-05-29 19:19:51] [INFO ] Deduced a trap composed of 164 places in 188 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 timeout
0.0)
(s206 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 30024 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-05-29 19:20:04] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 2 ms to minimize.
[2024-05-29 19:20:07] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 2 ms to minimize.
[2024-05-29 19:20:07] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 2 ms to minimize.
[2024-05-29 19:20:07] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 2 ms to minimize.
[2024-05-29 19:20:09] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
[2024-05-29 19:20:09] [INFO ] Deduced a trap composed of 167 places in 251 ms of which 3 ms to minimize.
[2024-05-29 19:20:10] [INFO ] Deduced a trap composed of 167 places in 256 ms of which 3 ms to minimize.
[2024-05-29 19:20:11] [INFO ] Deduced a trap composed of 166 places in 258 ms of which 3 ms to minimize.
[2024-05-29 19:20:11] [INFO ] Deduced a trap composed of 167 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:20:12] [INFO ] Deduced a trap composed of 166 places in 270 ms of which 2 ms to minimize.
[2024-05-29 19:20:12] [INFO ] Deduced a trap composed of 167 places in 271 ms of which 3 ms to minimize.
[2024-05-29 19:20:12] [INFO ] Deduced a trap composed of 166 places in 282 ms of which 3 ms to minimize.
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 3 ms to minimize.
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 167 places in 291 ms of which 3 ms to minimize.
[2024-05-29 19:20:13] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 3 ms to minimize.
[2024-05-29 19:20:14] [INFO ] Deduced a trap composed of 203 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:20:14] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:20:14] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 3 ms to minimize.
[2024-05-29 19:20:14] [INFO ] Deduced a trap composed of 166 places in 241 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 30022 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 61974ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61984ms
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62717 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 142 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 3848 steps with 43 reset in 14 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-04 finished in 62898 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 40 ms. Remains 550 /561 variables (removed 11) and now considering 1117/1128 (removed 11) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2024-05-29 19:20:23] [INFO ] Computed 6 invariants in 15 ms
[2024-05-29 19:20:23] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-29 19:20:23] [INFO ] Invariant cache hit.
[2024-05-29 19:20:23] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-05-29 19:20:23] [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-05-29 19:20:46] [INFO ] Deduced a trap composed of 164 places in 292 ms of which 3 ms to minimize.
[2024-05-29 19:20:46] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 3 ms to minimize.
[2024-05-29 19:20:46] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 2 ms to minimize.
[2024-05-29 19:20:47] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 2 ms to minimize.
[2024-05-29 19:20:48] [INFO ] Deduced a trap composed of 165 places in 234 ms of which 6 ms to minimize.
[2024-05-29 19:20:48] [INFO ] Deduced a trap composed of 165 places in 225 ms of which 2 ms to minimize.
[2024-05-29 19:20:49] [INFO ] Deduced a trap composed of 162 places in 259 ms of which 3 ms to minimize.
[2024-05-29 19:20:49] [INFO ] Deduced a trap composed of 163 places in 285 ms of which 3 ms to minimize.
[2024-05-29 19:20:49] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:20:50] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 2 ms to minimize.
[2024-05-29 19:20:50] [INFO ] Deduced a trap composed of 163 places in 227 ms of which 2 ms to minimize.
[2024-05-29 19:20:51] [INFO ] Deduced a trap composed of 217 places in 239 ms of which 3 ms to minimize.
[2024-05-29 19:20:52] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 2 ms to minimize.
[2024-05-29 19:20:52] [INFO ] Deduced a trap composed of 163 places in 196 ms of which 2 ms to minimize.
[2024-05-29 19:20:52] [INFO ] Deduced a trap composed of 166 places in 264 ms of which 3 ms to minimize.
[2024-05-29 19:20:54] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 3 ms to minimize.
[2024-05-29 19:20:54] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1667 variables, and 23 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-29 19:21:12] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 2 ms to minimize.
[2024-05-29 19:21:13] [INFO ] Deduced a trap composed of 219 places in 238 ms of which 3 ms to minimize.
[2024-05-29 19:21:13] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 2 ms to minimize.
[2024-05-29 19:21:13] [INFO ] Deduced a trap composed of 167 places in 208 ms of which 3 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 166 places in 296 ms of which 4 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 165 places in 283 ms of which 3 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 167 places in 272 ms of which 3 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 218 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 165 places in 229 ms of which 3 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 220 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 3 ms to minimize.
[2024-05-29 19:21:16] [INFO ] Deduced a trap composed of 167 places in 220 ms of which 3 ms to minimize.
[2024-05-29 19:21:16] [INFO ] Deduced a trap composed of 167 places in 261 ms of which 3 ms to minimize.
[2024-05-29 19:21:24] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2024-05-29 19:21:24] [INFO ] Deduced a trap composed of 165 places in 264 ms of which 2 ms to minimize.
[2024-05-29 19:21:24] [INFO ] Deduced a trap composed of 164 places in 249 ms of which 3 ms to minimize.
[2024-05-29 19:21:25] [INFO ] Deduced a trap composed of 165 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:21:25] [INFO ] Deduced a trap composed of 167 places in 248 ms of which 3 ms to minimize.
[2024-05-29 19:21:25] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 3 ms to minimize.
[2024-05-29 19:21:25] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 3 ms to minimize.
SMT process timed out in 62261ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 62275ms
Starting structural reductions in LTL mode, iteration 1 : 550/561 places, 1117/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62981 ms. Remains : 550/561 places, 1117/1128 transitions.
Stuttering acceptance computed with spot in 178 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 75 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 63185 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 42 ms. Remains 551 /561 variables (removed 10) and now considering 1118/1128 (removed 10) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2024-05-29 19:21:26] [INFO ] Computed 6 invariants in 13 ms
[2024-05-29 19:21:26] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-29 19:21:26] [INFO ] Invariant cache hit.
[2024-05-29 19:21:26] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2024-05-29 19:21:26] [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-05-29 19:21:48] [INFO ] Deduced a trap composed of 162 places in 300 ms of which 4 ms to minimize.
[2024-05-29 19:21:49] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 2 ms to minimize.
[2024-05-29 19:21:49] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 2 ms to minimize.
[2024-05-29 19:21:49] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2024-05-29 19:21:50] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 3 ms to minimize.
[2024-05-29 19:21:51] [INFO ] Deduced a trap composed of 166 places in 282 ms of which 3 ms to minimize.
[2024-05-29 19:21:51] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 2 ms to minimize.
[2024-05-29 19:21:51] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 3 ms to minimize.
[2024-05-29 19:21:52] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 3 ms to minimize.
[2024-05-29 19:21:53] [INFO ] Deduced a trap composed of 165 places in 201 ms of which 3 ms to minimize.
[2024-05-29 19:21:54] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 3 ms to minimize.
[2024-05-29 19:21:54] [INFO ] Deduced a trap composed of 165 places in 228 ms of which 2 ms to minimize.
[2024-05-29 19:21:54] [INFO ] Deduced a trap composed of 167 places in 216 ms of which 2 ms to minimize.
[2024-05-29 19:21:55] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 2 ms to minimize.
[2024-05-29 19:21:56] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 2 ms to minimize.
[2024-05-29 19:21:56] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 2 ms to minimize.
[2024-05-29 19:21:57] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 2 ms to minimize.
[2024-05-29 19:21:58] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 2 ms to minimize.
[2024-05-29 19:21:58] [INFO ] Deduced a trap composed of 165 places in 228 ms of which 3 ms to minimize.
SMT process timed out in 32018ms, After SMT, problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 32029ms
Starting structural reductions in LTL mode, iteration 1 : 551/561 places, 1118/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32780 ms. Remains : 551/561 places, 1118/1128 transitions.
Stuttering acceptance computed with spot in 139 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 1119 reset in 200 ms.
Product exploration explored 100000 steps with 1117 reset in 272 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 129 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 155 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 (449 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (59 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (63 resets) in 26 ms. (1481 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (76 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (77 resets) in 326 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
[2024-05-29 19:22:00] [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 468 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-05-29 19:22:00] [INFO ] Deduced a trap composed of 166 places in 269 ms of which 3 ms to minimize.
[2024-05-29 19:22:01] [INFO ] Deduced a trap composed of 167 places in 222 ms of which 2 ms to minimize.
[2024-05-29 19:22:01] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 2 ms to minimize.
[2024-05-29 19:22:01] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 3 ms to minimize.
[2024-05-29 19:22:01] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 3 ms to minimize.
[2024-05-29 19:22:02] [INFO ] Deduced a trap composed of 193 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:22:02] [INFO ] Deduced a trap composed of 167 places in 239 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 2590 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 3074ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 120 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 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 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 0 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 60 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 60 ms. Remains : 37/551 places, 134/1118 transitions.
RANDOM walk for 4622 steps (346 resets) in 34 ms. (132 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 171 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 37458 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 45 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-29 19:22:03] [INFO ] Computed 6 invariants in 18 ms
[2024-05-29 19:22:03] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-29 19:22:03] [INFO ] Invariant cache hit.
[2024-05-29 19:22:04] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:22:04] [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-05-29 19:22:26] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 3 ms to minimize.
[2024-05-29 19:22:26] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 3 ms to minimize.
[2024-05-29 19:22:27] [INFO ] Deduced a trap composed of 165 places in 230 ms of which 2 ms to minimize.
[2024-05-29 19:22:29] [INFO ] Deduced a trap composed of 163 places in 280 ms of which 3 ms to minimize.
[2024-05-29 19:22:29] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 3 ms to minimize.
[2024-05-29 19:22:29] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 3 ms to minimize.
[2024-05-29 19:22:29] [INFO ] Deduced a trap composed of 163 places in 203 ms of which 2 ms to minimize.
[2024-05-29 19:22:30] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2024-05-29 19:22:30] [INFO ] Deduced a trap composed of 165 places in 218 ms of which 2 ms to minimize.
[2024-05-29 19:22:30] [INFO ] Deduced a trap composed of 165 places in 225 ms of which 3 ms to minimize.
[2024-05-29 19:22:30] [INFO ] Deduced a trap composed of 226 places in 219 ms of which 2 ms to minimize.
[2024-05-29 19:22:31] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 3 ms to minimize.
[2024-05-29 19:22:31] [INFO ] Deduced a trap composed of 163 places in 192 ms of which 2 ms to minimize.
[2024-05-29 19:22:32] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 3 ms to minimize.
[2024-05-29 19:22:32] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2024-05-29 19:22:33] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 3 ms to minimize.
[2024-05-29 19:22:33] [INFO ] Deduced a trap composed of 163 places in 216 ms of which 2 ms to minimize.
[2024-05-29 19:22:33] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 2 ms to minimize.
[2024-05-29 19:22:35] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 2 ms to minimize.
[2024-05-29 19:22:35] [INFO ] Deduced a trap composed of 164 places in 184 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: (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 30024 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-05-29 19:22:48] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 2 ms to minimize.
[2024-05-29 19:22:51] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 3 ms to minimize.
[2024-05-29 19:22:51] [INFO ] Deduced a trap composed of 165 places in 200 ms of which 2 ms to minimize.
[2024-05-29 19:22:52] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 2 ms to minimize.
[2024-05-29 19:22:53] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 2 ms to minimize.
[2024-05-29 19:22:54] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
[2024-05-29 19:22:55] [INFO ] Deduced a trap composed of 167 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:22:55] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 ms to minimize.
[2024-05-29 19:22:56] [INFO ] Deduced a trap composed of 167 places in 232 ms of which 3 ms to minimize.
[2024-05-29 19:22:56] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 3 ms to minimize.
[2024-05-29 19:22:56] [INFO ] Deduced a trap composed of 167 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:22:57] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:22:57] [INFO ] Deduced a trap composed of 164 places in 298 ms of which 3 ms to minimize.
[2024-05-29 19:22:57] [INFO ] Deduced a trap composed of 167 places in 299 ms of which 4 ms to minimize.
[2024-05-29 19:22:58] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 7 ms to minimize.
[2024-05-29 19:22:58] [INFO ] Deduced a trap composed of 203 places in 246 ms of which 5 ms to minimize.
[2024-05-29 19:22:58] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 3 ms to minimize.
[2024-05-29 19:22:59] [INFO ] Deduced a trap composed of 167 places in 218 ms of which 2 ms to minimize.
[2024-05-29 19:22:59] [INFO ] Deduced a trap composed of 166 places in 217 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 30020 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 62655ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62667ms
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63407 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 172 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 166 ms.
Product exploration explored 100000 steps with 33333 reset in 171 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 18 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 63970 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 3 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 0 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 1 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 1 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 79 ms. Remains 66 /561 variables (removed 495) and now considering 393/1128 (removed 735) transitions.
[2024-05-29 19:23:07] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
// Phase 1: matrix 387 rows 66 cols
[2024-05-29 19:23:07] [INFO ] Computed 2 invariants in 10 ms
[2024-05-29 19:23:07] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 19:23:07] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-29 19:23:07] [INFO ] Invariant cache hit.
[2024-05-29 19:23:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 19:23:07] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-29 19:23:07] [INFO ] Redundant transitions in 7 ms returned []
Running 376 sub problems to find dead transitions.
[2024-05-29 19:23:07] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-29 19:23:07] [INFO ] Invariant cache hit.
[2024-05-29 19:23:07] [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-05-29 19:23:10] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:23:10] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2024-05-29 19:23:10] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:23:10] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:23:10] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:23:10] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2024-05-29 19:23:10] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:23:11] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-29 19:23:11] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2024-05-29 19:23:11] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-29 19:23:12] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2024-05-29 19:23:12] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2024-05-29 19:23:13] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 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-05-29 19:23:16] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:23:17] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:23:18] [INFO ] Deduced a trap composed of 22 places in 82 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 22826 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 30017 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 53994ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 53998ms
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 54331 ms. Remains : 66/561 places, 393/1128 transitions.
Stuttering acceptance computed with spot in 137 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 9713 reset in 223 ms.
Product exploration explored 100000 steps with 900 reset in 100 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 262 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 122 ms :[p0, (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (3876 resets) in 905 ms. (44 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (368 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (414 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
[2024-05-29 19:24:03] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-29 19:24:03] [INFO ] Invariant cache hit.
[2024-05-29 19:24:03] [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 161 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 312 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 488ms 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 7 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 379 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 80 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 14 ms. Remains 66 /66 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2024-05-29 19:24:04] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-29 19:24:04] [INFO ] Invariant cache hit.
[2024-05-29 19:24:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 19:24:04] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-29 19:24:04] [INFO ] Invariant cache hit.
[2024-05-29 19:24:04] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 19:24:04] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-29 19:24:04] [INFO ] Redundant transitions in 5 ms returned []
Running 376 sub problems to find dead transitions.
[2024-05-29 19:24:04] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-29 19:24:04] [INFO ] Invariant cache hit.
[2024-05-29 19:24:04] [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-05-29 19:24:06] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-05-29 19:24:06] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:24:07] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2024-05-29 19:24:07] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2024-05-29 19:24:07] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2024-05-29 19:24:07] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:24:07] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-05-29 19:24:07] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2024-05-29 19:24:08] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:24:08] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-29 19:24:09] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2024-05-29 19:24:09] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:24:09] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 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-05-29 19:24:13] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:24:13] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:24:14] [INFO ] Deduced a trap composed of 22 places in 89 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 23192 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 30015 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 54370ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 54374ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54644 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 73 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]
RANDOM walk for 40000 steps (3929 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (411 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 569747 steps, run visited all 1 properties in 1039 ms. (steps per millisecond=548 )
Probabilistic random walk after 569747 steps, saw 120855 distinct states, run finished after 1044 ms. (steps per millisecond=545 ) 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 92 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 87 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
Product exploration explored 100000 steps with 3651 reset in 111 ms.
Product exploration explored 100000 steps with 786 reset in 57 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 9 ms. Remains 65 /66 variables (removed 1) and now considering 392/393 (removed 1) transitions.
[2024-05-29 19:25:00] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
// Phase 1: matrix 386 rows 65 cols
[2024-05-29 19:25:00] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 19:25:00] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 19:25:00] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
[2024-05-29 19:25:00] [INFO ] Invariant cache hit.
[2024-05-29 19:25:00] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 19:25:00] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-29 19:25:00] [INFO ] Redundant transitions in 3 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-29 19:25:00] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
[2024-05-29 19:25:00] [INFO ] Invariant cache hit.
[2024-05-29 19:25:00] [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-05-29 19:25:03] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2024-05-29 19:25:03] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:25:03] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:25:03] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2024-05-29 19:25:03] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:25:03] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-29 19:25:03] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:25:03] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 1 ms to minimize.
[2024-05-29 19:25:03] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2024-05-29 19:25:04] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2024-05-29 19:25:04] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:25:05] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:25:05] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2024-05-29 19:25:05] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:25:05] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:25:05] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-29 19:25:06] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:25:06] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 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-05-29 19:25:10] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 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 22249 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 30023 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 53382ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 53387ms
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 53651 ms. Remains : 65/66 places, 392/393 transitions.
Treatment of property StigmergyElection-PT-05b-LTLFireability-09 finished in 166725 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 39 ms. Remains 550 /561 variables (removed 11) and now considering 1117/1128 (removed 11) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2024-05-29 19:25:54] [INFO ] Computed 6 invariants in 13 ms
[2024-05-29 19:25:54] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-29 19:25:54] [INFO ] Invariant cache hit.
[2024-05-29 19:25:54] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-05-29 19:25:54] [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-05-29 19:26:16] [INFO ] Deduced a trap composed of 162 places in 278 ms of which 3 ms to minimize.
[2024-05-29 19:26:17] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 2 ms to minimize.
[2024-05-29 19:26:17] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 2 ms to minimize.
[2024-05-29 19:26:18] [INFO ] Deduced a trap composed of 164 places in 270 ms of which 3 ms to minimize.
[2024-05-29 19:26:19] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 2 ms to minimize.
[2024-05-29 19:26:20] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 2 ms to minimize.
[2024-05-29 19:26:21] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 2 ms to minimize.
[2024-05-29 19:26:22] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 2 ms to minimize.
[2024-05-29 19:26:24] [INFO ] Deduced a trap composed of 163 places in 215 ms of which 2 ms to minimize.
[2024-05-29 19:26:24] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 2 ms to minimize.
[2024-05-29 19:26:24] [INFO ] Deduced a trap composed of 165 places in 228 ms of which 3 ms to minimize.
[2024-05-29 19:26:25] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
[2024-05-29 19:26:25] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 2 ms to minimize.
[2024-05-29 19:26:25] [INFO ] Deduced a trap composed of 167 places in 211 ms of which 3 ms to minimize.
[2024-05-29 19:26:25] [INFO ] Deduced a trap composed of 165 places in 265 ms of which 3 ms to minimize.
[2024-05-29 19:26:26] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 3 ms to minimize.
[2024-05-29 19:26:26] [INFO ] Deduced a trap composed of 218 places in 241 ms of which 2 ms to minimize.
[2024-05-29 19:26:26] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 2 ms to minimize.
[2024-05-29 19:26:27] [INFO ] Deduced a trap composed of 165 places in 272 ms of which 3 ms to minimize.
[2024-05-29 19:26:27] [INFO ] Deduced a trap composed of 165 places in 277 ms of which 3 ms to minimize.
SMT process timed out in 32396ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 32408ms
Starting structural reductions in LTL mode, iteration 1 : 550/561 places, 1117/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33052 ms. Remains : 550/561 places, 1117/1128 transitions.
Stuttering acceptance computed with spot in 174 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 3 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 33257 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 40 ms. Remains 550 /561 variables (removed 11) and now considering 1117/1128 (removed 11) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2024-05-29 19:26:27] [INFO ] Computed 6 invariants in 16 ms
[2024-05-29 19:26:27] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-29 19:26:27] [INFO ] Invariant cache hit.
[2024-05-29 19:26:28] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-05-29 19:26:28] [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-05-29 19:26:49] [INFO ] Deduced a trap composed of 165 places in 270 ms of which 3 ms to minimize.
[2024-05-29 19:26:50] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 3 ms to minimize.
[2024-05-29 19:26:51] [INFO ] Deduced a trap composed of 163 places in 250 ms of which 3 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 2 ms to minimize.
[2024-05-29 19:26:52] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 2 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 2 ms to minimize.
[2024-05-29 19:26:53] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 3 ms to minimize.
[2024-05-29 19:26:54] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 ms to minimize.
[2024-05-29 19:26:54] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 2 ms to minimize.
[2024-05-29 19:26:55] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 2 ms to minimize.
[2024-05-29 19:26:57] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 2 ms to minimize.
[2024-05-29 19:26:57] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 2 ms to minimize.
[2024-05-29 19:26:58] [INFO ] Deduced a trap composed of 163 places in 231 ms of which 3 ms to minimize.
[2024-05-29 19:26:58] [INFO ] Deduced a trap composed of 167 places in 206 ms of which 2 ms to minimize.
[2024-05-29 19:26:58] [INFO ] Deduced a trap composed of 168 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:26:58] [INFO ] Deduced a trap composed of 164 places in 258 ms of which 3 ms to minimize.
[2024-05-29 19:26:59] [INFO ] Deduced a trap composed of 167 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:26:59] [INFO ] Deduced a trap composed of 166 places in 274 ms of which 3 ms to minimize.
[2024-05-29 19:26:59] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 3 ms to minimize.
[2024-05-29 19:27:00] [INFO ] Deduced a trap composed of 164 places in 268 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1667 variables, and 26 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-29 19:27:11] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 2 ms to minimize.
[2024-05-29 19:27:14] [INFO ] Deduced a trap composed of 219 places in 216 ms of which 3 ms to minimize.
[2024-05-29 19:27:14] [INFO ] Deduced a trap composed of 163 places in 187 ms of which 3 ms to minimize.
[2024-05-29 19:27:15] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 3 ms to minimize.
[2024-05-29 19:27:16] [INFO ] Deduced a trap composed of 165 places in 211 ms of which 3 ms to minimize.
[2024-05-29 19:27:16] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 2 ms to minimize.
[2024-05-29 19:27:18] [INFO ] Deduced a trap composed of 221 places in 246 ms of which 3 ms to minimize.
[2024-05-29 19:27:18] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 3 ms to minimize.
[2024-05-29 19:27:18] [INFO ] Deduced a trap composed of 221 places in 249 ms of which 2 ms to minimize.
[2024-05-29 19:27:19] [INFO ] Deduced a trap composed of 165 places in 228 ms of which 3 ms to minimize.
[2024-05-29 19:27:19] [INFO ] Deduced a trap composed of 167 places in 229 ms of which 3 ms to minimize.
[2024-05-29 19:27:19] [INFO ] Deduced a trap composed of 163 places in 222 ms of which 3 ms to minimize.
[2024-05-29 19:27:19] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
[2024-05-29 19:27:28] [INFO ] Deduced a trap composed of 218 places in 259 ms of which 3 ms to minimize.
[2024-05-29 19:27:28] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-29 19:27:29] [INFO ] Deduced a trap composed of 170 places in 233 ms of which 3 ms to minimize.
[2024-05-29 19:27:30] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1667 variables, and 43 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 37/37 constraints]
After SMT, in 61927ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 61940ms
Starting structural reductions in LTL mode, iteration 1 : 550/561 places, 1117/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62615 ms. Remains : 550/561 places, 1117/1128 transitions.
Stuttering acceptance computed with spot in 157 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 181 ms.
Product exploration explored 100000 steps with 50000 reset in 183 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 13 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 63175 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 31 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-29 19:27:30] [INFO ] Computed 6 invariants in 11 ms
[2024-05-29 19:27:30] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-29 19:27:30] [INFO ] Invariant cache hit.
[2024-05-29 19:27:31] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:27:31] [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-05-29 19:27:53] [INFO ] Deduced a trap composed of 164 places in 275 ms of which 3 ms to minimize.
[2024-05-29 19:27:53] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2024-05-29 19:27:53] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 2 ms to minimize.
[2024-05-29 19:27:55] [INFO ] Deduced a trap composed of 163 places in 248 ms of which 2 ms to minimize.
[2024-05-29 19:27:55] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2024-05-29 19:27:55] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2024-05-29 19:27:56] [INFO ] Deduced a trap composed of 163 places in 201 ms of which 2 ms to minimize.
[2024-05-29 19:27:56] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 2 ms to minimize.
[2024-05-29 19:27:56] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 2 ms to minimize.
[2024-05-29 19:27:57] [INFO ] Deduced a trap composed of 165 places in 218 ms of which 3 ms to minimize.
[2024-05-29 19:27:57] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 3 ms to minimize.
[2024-05-29 19:27:57] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 2 ms to minimize.
[2024-05-29 19:27:57] [INFO ] Deduced a trap composed of 163 places in 200 ms of which 3 ms to minimize.
[2024-05-29 19:27:58] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 2 ms to minimize.
[2024-05-29 19:27:59] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2024-05-29 19:27:59] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 3 ms to minimize.
[2024-05-29 19:27:59] [INFO ] Deduced a trap composed of 163 places in 208 ms of which 2 ms to minimize.
[2024-05-29 19:28:00] [INFO ] Deduced a trap composed of 165 places in 238 ms of which 3 ms to minimize.
[2024-05-29 19:28:01] [INFO ] Deduced a trap composed of 167 places in 216 ms of which 3 ms to minimize.
[2024-05-29 19:28:02] [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
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 30019 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-05-29 19:28:14] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 2 ms to minimize.
[2024-05-29 19:28:18] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 2 ms to minimize.
[2024-05-29 19:28:18] [INFO ] Deduced a trap composed of 165 places in 199 ms of which 2 ms to minimize.
[2024-05-29 19:28:18] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 2 ms to minimize.
[2024-05-29 19:28:20] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
[2024-05-29 19:28:20] [INFO ] Deduced a trap composed of 167 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:28:21] [INFO ] Deduced a trap composed of 167 places in 235 ms of which 2 ms to minimize.
[2024-05-29 19:28:22] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 3 ms to minimize.
[2024-05-29 19:28:22] [INFO ] Deduced a trap composed of 167 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:28:22] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:28:23] [INFO ] Deduced a trap composed of 167 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:28:23] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 3 ms to minimize.
[2024-05-29 19:28:23] [INFO ] Deduced a trap composed of 164 places in 274 ms of which 4 ms to minimize.
[2024-05-29 19:28:24] [INFO ] Deduced a trap composed of 167 places in 263 ms of which 3 ms to minimize.
[2024-05-29 19:28:24] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 2 ms to minimize.
[2024-05-29 19:28:24] [INFO ] Deduced a trap composed of 203 places in 248 ms of which 3 ms to minimize.
[2024-05-29 19:28:25] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
[2024-05-29 19:28:25] [INFO ] Deduced a trap composed of 167 places in 221 ms of which 3 ms to minimize.
[2024-05-29 19:28:25] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 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 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 62262ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62275ms
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62875 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 344 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 1125 reset in 118 ms.
Product exploration explored 100000 steps with 1118 reset in 125 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 102 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 59 ms :[(AND p2 (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (443 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (78 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (77 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (79 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 492603 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 3
Probabilistic random walk after 492603 steps, saw 86520 distinct states, run finished after 3004 ms. (steps per millisecond=163 ) properties seen :0
[2024-05-29 19:28:37] [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 678 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 1183 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 1878ms 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 15 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 193 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 68 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 57 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 0 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 56 ms. Remains 78 /549 variables (removed 471) and now considering 481/1116 (removed 635) transitions.
[2024-05-29 19:28:39] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
// Phase 1: matrix 475 rows 78 cols
[2024-05-29 19:28:39] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 19:28:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 19:28:39] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2024-05-29 19:28:39] [INFO ] Invariant cache hit.
[2024-05-29 19:28:39] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 19:28:40] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-29 19:28:40] [INFO ] Redundant transitions in 3 ms returned []
Running 464 sub problems to find dead transitions.
[2024-05-29 19:28:40] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2024-05-29 19:28:40] [INFO ] Invariant cache hit.
[2024-05-29 19:28:40] [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-05-29 19:28:43] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:28:43] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2024-05-29 19:28:43] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-05-29 19:28:43] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2024-05-29 19:28:43] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2024-05-29 19:28:43] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-05-29 19:28:44] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:28:44] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:28:44] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-05-29 19:28:44] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:28:44] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2024-05-29 19:28:44] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:28:44] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:28:44] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:28:44] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2024-05-29 19:28:45] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:28:45] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:28:46] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:28:46] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 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-05-29 19:28:52] [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 30012 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 61460ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 61465ms
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 61751 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 71 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 66 ms :[(AND p2 (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (3819 resets) in 374 ms. (106 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (365 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (372 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2024-05-29 19:29:41] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2024-05-29 19:29:41] [INFO ] Invariant cache hit.
[2024-05-29 19:29:41] [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 577 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 858ms 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 3 ms. (steps per millisecond=4 )
Parikh walk visited 2 properties in 3 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 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 63 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 72 ms :[(AND p2 (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 9571 reset in 194 ms.
Stuttering criterion allowed to conclude after 30712 steps with 2914 reset in 70 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-12 finished in 132633 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 30 ms. Remains 552 /561 variables (removed 9) and now considering 1119/1128 (removed 9) transitions.
// Phase 1: matrix 1119 rows 552 cols
[2024-05-29 19:29:43] [INFO ] Computed 6 invariants in 14 ms
[2024-05-29 19:29:43] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-29 19:29:43] [INFO ] Invariant cache hit.
[2024-05-29 19:29:44] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 1118 sub problems to find dead transitions.
[2024-05-29 19:29:44] [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-05-29 19:30:05] [INFO ] Deduced a trap composed of 165 places in 274 ms of which 3 ms to minimize.
[2024-05-29 19:30:05] [INFO ] Deduced a trap composed of 165 places in 203 ms of which 3 ms to minimize.
[2024-05-29 19:30:07] [INFO ] Deduced a trap composed of 163 places in 276 ms of which 3 ms to minimize.
[2024-05-29 19:30:08] [INFO ] Deduced a trap composed of 165 places in 234 ms of which 2 ms to minimize.
[2024-05-29 19:30:08] [INFO ] Deduced a trap composed of 163 places in 198 ms of which 2 ms to minimize.
[2024-05-29 19:30:09] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 3 ms to minimize.
[2024-05-29 19:30:10] [INFO ] Deduced a trap composed of 163 places in 196 ms of which 2 ms to minimize.
[2024-05-29 19:30:10] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 3 ms to minimize.
[2024-05-29 19:30:12] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 2 ms to minimize.
[2024-05-29 19:30:13] [INFO ] Deduced a trap composed of 163 places in 242 ms of which 2 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 3 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 165 places in 244 ms of which 2 ms to minimize.
[2024-05-29 19:30:14] [INFO ] Deduced a trap composed of 166 places in 265 ms of which 2 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 3 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 164 places in 278 ms of which 3 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 217 places in 261 ms of which 2 ms to minimize.
[2024-05-29 19:30:15] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 2 ms to minimize.
[2024-05-29 19:30:16] [INFO ] Deduced a trap composed of 165 places in 300 ms of which 3 ms to minimize.
SMT process timed out in 32135ms, After SMT, problems are : Problem set: 0 solved, 1118 unsolved
Search for dead transitions found 0 dead transitions in 32143ms
Starting structural reductions in LTL mode, iteration 1 : 552/561 places, 1119/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32822 ms. Remains : 552/561 places, 1119/1128 transitions.
Stuttering acceptance computed with spot in 264 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 26 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-13 finished in 33111 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 38 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-29 19:30:16] [INFO ] Computed 6 invariants in 15 ms
[2024-05-29 19:30:16] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 19:30:16] [INFO ] Invariant cache hit.
[2024-05-29 19:30:17] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:30:17] [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-05-29 19:30:38] [INFO ] Deduced a trap composed of 164 places in 304 ms of which 3 ms to minimize.
[2024-05-29 19:30:39] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 2 ms to minimize.
[2024-05-29 19:30:39] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 2 ms to minimize.
[2024-05-29 19:30:41] [INFO ] Deduced a trap composed of 163 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:30:41] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 2 ms to minimize.
[2024-05-29 19:30:41] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 2 ms to minimize.
[2024-05-29 19:30:41] [INFO ] Deduced a trap composed of 163 places in 204 ms of which 2 ms to minimize.
[2024-05-29 19:30:42] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 3 ms to minimize.
[2024-05-29 19:30:42] [INFO ] Deduced a trap composed of 165 places in 223 ms of which 2 ms to minimize.
[2024-05-29 19:30:42] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 3 ms to minimize.
[2024-05-29 19:30:42] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 3 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 2 ms to minimize.
[2024-05-29 19:30:43] [INFO ] Deduced a trap composed of 163 places in 199 ms of which 2 ms to minimize.
[2024-05-29 19:30:44] [INFO ] Deduced a trap composed of 165 places in 224 ms of which 2 ms to minimize.
[2024-05-29 19:30:44] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
[2024-05-29 19:30:45] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 3 ms to minimize.
[2024-05-29 19:30:45] [INFO ] Deduced a trap composed of 163 places in 198 ms of which 3 ms to minimize.
[2024-05-29 19:30:46] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 3 ms to minimize.
[2024-05-29 19:30:47] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 2 ms to minimize.
[2024-05-29 19:30:48] [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
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 30026 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-05-29 19:31:00] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 2 ms to minimize.
[2024-05-29 19:31:03] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 3 ms to minimize.
[2024-05-29 19:31:04] [INFO ] Deduced a trap composed of 165 places in 224 ms of which 2 ms to minimize.
[2024-05-29 19:31:04] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 2 ms to minimize.
[2024-05-29 19:31:06] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 2 ms to minimize.
[2024-05-29 19:31:06] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
[2024-05-29 19:31:07] [INFO ] Deduced a trap composed of 167 places in 261 ms of which 3 ms to minimize.
[2024-05-29 19:31:08] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2024-05-29 19:31:09] [INFO ] Deduced a trap composed of 167 places in 231 ms of which 3 ms to minimize.
[2024-05-29 19:31:09] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 3 ms to minimize.
[2024-05-29 19:31:09] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 3 ms to minimize.
[2024-05-29 19:31:09] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:31:10] [INFO ] Deduced a trap composed of 164 places in 286 ms of which 3 ms to minimize.
[2024-05-29 19:31:10] [INFO ] Deduced a trap composed of 167 places in 272 ms of which 3 ms to minimize.
[2024-05-29 19:31:10] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 3 ms to minimize.
[2024-05-29 19:31:11] [INFO ] Deduced a trap composed of 203 places in 249 ms of which 3 ms to minimize.
[2024-05-29 19:31:11] [INFO ] Deduced a trap composed of 166 places in 270 ms of which 3 ms to minimize.
[2024-05-29 19:31:11] [INFO ] Deduced a trap composed of 167 places in 246 ms of which 2 ms to minimize.
[2024-05-29 19:31:12] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 62000ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62011ms
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62729 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 396 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 33291 reset in 200 ms.
Product exploration explored 100000 steps with 33372 reset in 210 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 96 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 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))]
Reduction of identical properties reduced properties to check from 10 to 6
RANDOM walk for 40000 steps (449 resets) in 267 ms. (149 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (77 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (55 resets) in 38 ms. (1025 steps per ms) remains 1/5 properties
[2024-05-29 19:31:20] [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 433 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 507 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 950ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 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 3 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.2 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 1 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 67 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 67 ms. Remains : 17/549 places, 145/1116 transitions.
RANDOM walk for 70 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
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 381 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 364 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 353 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-05-29 19:31:22] [INFO ] Invariant cache hit.
[2024-05-29 19:31:23] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-29 19:31:23] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2024-05-29 19:31:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:31:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-29 19:31:24] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2024-05-29 19:31:24] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 80 ms.
[2024-05-29 19:31:25] [INFO ] Added : 79 causal constraints over 16 iterations in 941 ms. Result :sat
Could not prove EG (NOT p2)
[2024-05-29 19:31:25] [INFO ] Invariant cache hit.
[2024-05-29 19:31:25] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-29 19:31:26] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2024-05-29 19:31:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:31:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-29 19:31:26] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-05-29 19:31:26] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 61 ms.
[2024-05-29 19:31:27] [INFO ] Added : 92 causal constraints over 19 iterations in 975 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 14 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-29 19:31:27] [INFO ] Invariant cache hit.
[2024-05-29 19:31:28] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-29 19:31:28] [INFO ] Invariant cache hit.
[2024-05-29 19:31:28] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:31:28] [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-05-29 19:31:50] [INFO ] Deduced a trap composed of 164 places in 284 ms of which 3 ms to minimize.
[2024-05-29 19:31:51] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2024-05-29 19:31:51] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 2 ms to minimize.
[2024-05-29 19:31:53] [INFO ] Deduced a trap composed of 163 places in 262 ms of which 4 ms to minimize.
[2024-05-29 19:31:53] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 3 ms to minimize.
[2024-05-29 19:31:53] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 3 ms to minimize.
[2024-05-29 19:31:53] [INFO ] Deduced a trap composed of 163 places in 223 ms of which 2 ms to minimize.
[2024-05-29 19:31:54] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2024-05-29 19:31:54] [INFO ] Deduced a trap composed of 165 places in 232 ms of which 3 ms to minimize.
[2024-05-29 19:31:54] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 3 ms to minimize.
[2024-05-29 19:31:55] [INFO ] Deduced a trap composed of 226 places in 231 ms of which 3 ms to minimize.
[2024-05-29 19:31:55] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 3 ms to minimize.
[2024-05-29 19:31:55] [INFO ] Deduced a trap composed of 163 places in 213 ms of which 2 ms to minimize.
[2024-05-29 19:31:56] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 2 ms to minimize.
[2024-05-29 19:31:56] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 3 ms to minimize.
[2024-05-29 19:31:57] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 3 ms to minimize.
[2024-05-29 19:31:57] [INFO ] Deduced a trap composed of 163 places in 199 ms of which 2 ms to minimize.
[2024-05-29 19:31:58] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 2 ms to minimize.
[2024-05-29 19:31:59] [INFO ] Deduced a trap composed of 167 places in 222 ms of which 3 ms to minimize.
[2024-05-29 19:31:59] [INFO ] Deduced a trap composed of 164 places in 190 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 30024 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-05-29 19:32:11] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 2 ms to minimize.
[2024-05-29 19:32:14] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 3 ms to minimize.
[2024-05-29 19:32:14] [INFO ] Deduced a trap composed of 165 places in 204 ms of which 2 ms to minimize.
[2024-05-29 19:32:15] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 2 ms to minimize.
[2024-05-29 19:32:16] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 2 ms to minimize.
[2024-05-29 19:32:17] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 3 ms to minimize.
[2024-05-29 19:32:18] [INFO ] Deduced a trap composed of 167 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:32:19] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2024-05-29 19:32:19] [INFO ] Deduced a trap composed of 167 places in 229 ms of which 2 ms to minimize.
[2024-05-29 19:32:19] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 2 ms to minimize.
[2024-05-29 19:32:19] [INFO ] Deduced a trap composed of 167 places in 238 ms of which 3 ms to minimize.
[2024-05-29 19:32:20] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 2 ms to minimize.
[2024-05-29 19:32:20] [INFO ] Deduced a trap composed of 164 places in 276 ms of which 3 ms to minimize.
[2024-05-29 19:32:20] [INFO ] Deduced a trap composed of 167 places in 262 ms of which 3 ms to minimize.
[2024-05-29 19:32:21] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 2 ms to minimize.
[2024-05-29 19:32:21] [INFO ] Deduced a trap composed of 203 places in 238 ms of which 3 ms to minimize.
[2024-05-29 19:32:21] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 2 ms to minimize.
[2024-05-29 19:32:22] [INFO ] Deduced a trap composed of 167 places in 222 ms of which 3 ms to minimize.
[2024-05-29 19:32:22] [INFO ] Deduced a trap composed of 166 places in 213 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 62011ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62032ms
Finished structural reductions in LTL mode , in 1 iterations and 62694 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 118 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 307 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 288 ms. (138 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (76 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (56 resets) in 20 ms. (1904 steps per ms) remains 1/5 properties
[2024-05-29 19:32:31] [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 397 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 515 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 921ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 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 50 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 50 ms. Remains : 17/549 places, 145/1116 transitions.
RANDOM walk for 157 steps (0 resets) in 6 ms. (22 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 351 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 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))]
Stuttering acceptance computed with spot in 316 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-05-29 19:32:33] [INFO ] Invariant cache hit.
[2024-05-29 19:32:33] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-29 19:32:33] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-05-29 19:32:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:32:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-29 19:32:34] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2024-05-29 19:32:34] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 68 ms.
[2024-05-29 19:32:35] [INFO ] Added : 79 causal constraints over 16 iterations in 862 ms. Result :sat
Could not prove EG (NOT p2)
[2024-05-29 19:32:35] [INFO ] Invariant cache hit.
[2024-05-29 19:32:35] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-29 19:32:36] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2024-05-29 19:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:32:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-29 19:32:37] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2024-05-29 19:32:37] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 68 ms.
[2024-05-29 19:32:38] [INFO ] Added : 92 causal constraints over 19 iterations in 964 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 328 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 33404 reset in 233 ms.
Product exploration explored 100000 steps with 33418 reset in 179 ms.
Applying partial POR strategy [false, false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 319 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 0 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 1 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 1 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 1 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 80 ms. Remains 122 /549 variables (removed 427) and now considering 385/1116 (removed 731) transitions.
[2024-05-29 19:32:39] [INFO ] Redundant transitions in 1 ms returned []
Running 377 sub problems to find dead transitions.
[2024-05-29 19:32:39] [INFO ] Flow matrix only has 379 transitions (discarded 6 similar events)
// Phase 1: matrix 379 rows 122 cols
[2024-05-29 19:32:39] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 19:32:39] [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-05-29 19:32:41] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:32:41] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:32:41] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:32:42] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:32:42] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:32:42] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:32:42] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:32:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:32:42] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:32:42] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:32:42] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:32:42] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:32:43] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:32:43] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:32:43] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:32:43] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:32:44] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:32:44] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:32:44] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:32:44] [INFO ] Deduced a trap composed of 23 places in 77 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-05-29 19:32:45] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/23 constraints. Problems are: Problem set: 8 solved, 369 unsolved
[2024-05-29 19:32:46] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 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-05-29 19:32:51] [INFO ] Deduced a trap composed of 26 places in 81 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-05-29 19:32:53] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:32:53] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:32:53] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:32:53] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:32:53] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:32:53] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:32:53] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:32:53] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:32:54] [INFO ] Deduced a trap composed of 22 places in 74 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-05-29 19:33:10] [INFO ] Deduced a trap composed of 26 places in 79 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-05-29 19:33:11] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 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 30016 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 60644ms problems are : Problem set: 75 solved, 302 unsolved
Search for dead transitions found 75 dead transitions in 60648ms
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.1 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 0 ms
Applied a total of 2 rules in 11 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 60754 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 9 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-29 19:33:40] [INFO ] Computed 6 invariants in 10 ms
[2024-05-29 19:33:40] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-29 19:33:40] [INFO ] Invariant cache hit.
[2024-05-29 19:33:40] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2024-05-29 19:33:40] [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-05-29 19:34:02] [INFO ] Deduced a trap composed of 164 places in 279 ms of which 4 ms to minimize.
[2024-05-29 19:34:02] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 3 ms to minimize.
[2024-05-29 19:34:03] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 2 ms to minimize.
[2024-05-29 19:34:04] [INFO ] Deduced a trap composed of 163 places in 261 ms of which 3 ms to minimize.
[2024-05-29 19:34:04] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 3 ms to minimize.
[2024-05-29 19:34:05] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 3 ms to minimize.
[2024-05-29 19:34:05] [INFO ] Deduced a trap composed of 163 places in 212 ms of which 3 ms to minimize.
[2024-05-29 19:34:05] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 3 ms to minimize.
[2024-05-29 19:34:06] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 2 ms to minimize.
[2024-05-29 19:34:06] [INFO ] Deduced a trap composed of 165 places in 248 ms of which 2 ms to minimize.
[2024-05-29 19:34:06] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 2 ms to minimize.
[2024-05-29 19:34:06] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 3 ms to minimize.
[2024-05-29 19:34:07] [INFO ] Deduced a trap composed of 163 places in 213 ms of which 2 ms to minimize.
[2024-05-29 19:34:07] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 2 ms to minimize.
[2024-05-29 19:34:08] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2024-05-29 19:34:09] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 3 ms to minimize.
[2024-05-29 19:34:09] [INFO ] Deduced a trap composed of 163 places in 207 ms of which 2 ms to minimize.
[2024-05-29 19:34:09] [INFO ] Deduced a trap composed of 165 places in 218 ms of which 2 ms to minimize.
[2024-05-29 19:34:11] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 3 ms to minimize.
[2024-05-29 19:34:11] [INFO ] Deduced a trap composed of 164 places in 206 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 30017 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-05-29 19:34:24] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
[2024-05-29 19:34:27] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 2 ms to minimize.
[2024-05-29 19:34:28] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 2 ms to minimize.
[2024-05-29 19:34:28] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 2 ms to minimize.
[2024-05-29 19:34:30] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 2 ms to minimize.
[2024-05-29 19:34:30] [INFO ] Deduced a trap composed of 167 places in 232 ms of which 2 ms to minimize.
[2024-05-29 19:34:31] [INFO ] Deduced a trap composed of 167 places in 247 ms of which 2 ms to minimize.
[2024-05-29 19:34:32] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 2 ms to minimize.
[2024-05-29 19:34:32] [INFO ] Deduced a trap composed of 167 places in 218 ms of which 2 ms to minimize.
[2024-05-29 19:34:33] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 3 ms to minimize.
[2024-05-29 19:34:33] [INFO ] Deduced a trap composed of 167 places in 250 ms of which 2 ms to minimize.
[2024-05-29 19:34:33] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 3 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 3 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 3 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2024-05-29 19:34:34] [INFO ] Deduced a trap composed of 203 places in 237 ms of which 3 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 167 places in 215 ms of which 2 ms to minimize.
[2024-05-29 19:34:35] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 62029ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62041ms
Finished structural reductions in LTL mode , in 1 iterations and 62756 ms. Remains : 549/549 places, 1116/1116 transitions.
Treatment of property StigmergyElection-PT-05b-LTLFireability-15 finished in 266408 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(F((!p0||X(X(p1))))) U (X(X(p3))&&p2)))'
[2024-05-29 19:34:43] [INFO ] Flatten gal took : 60 ms
[2024-05-29 19:34:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 19:34:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 561 places, 1128 transitions and 6465 arcs took 11 ms.
Total runtime 1127961 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-05b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 561
TRANSITIONS: 1128
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.006s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3635
MODEL NAME: /home/mcc/execution/411/model
561 places, 1128 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyElection-PT-05b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05b-LTLFireability-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717011711260

--------------------
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
MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r399-tall-171690530100308"
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 ;