Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690532100348.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyElection-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532100348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 5.3M 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-08a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717247938131

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:18:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:18:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:18:59] [INFO ] Load time of PNML (sax parser for PT used): 432 ms
[2024-06-01 13:18:59] [INFO ] Transformed 114 places.
[2024-06-01 13:18:59] [INFO ] Transformed 6882 transitions.
[2024-06-01 13:18:59] [INFO ] Found NUPN structural information;
[2024-06-01 13:18:59] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 606 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyElection-PT-08a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 664/664 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 99 transition count 641
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 99 transition count 641
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 91 transition count 625
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 91 transition count 625
Applied a total of 46 rules in 121 ms. Remains 91 /114 variables (removed 23) and now considering 625/664 (removed 39) transitions.
[2024-06-01 13:19:00] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-06-01 13:19:00] [INFO ] Computed 2 invariants in 23 ms
[2024-06-01 13:19:00] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 13:19:00] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-06-01 13:19:00] [INFO ] Invariant cache hit.
[2024-06-01 13:19:00] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-06-01 13:19:01] [INFO ] Implicit Places using invariants and state equation in 623 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 845 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/114 places, 625/664 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 18 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-06-01 13:19:01] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-06-01 13:19:01] [INFO ] Computed 1 invariants in 6 ms
[2024-06-01 13:19:01] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 13:19:01] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:19:01] [INFO ] Invariant cache hit.
[2024-06-01 13:19:01] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:19:01] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/114 places, 601/664 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1288 ms. Remains : 66/114 places, 601/664 transitions.
Support contains 8 out of 66 places after structural reductions.
[2024-06-01 13:19:01] [INFO ] Flatten gal took : 105 ms
[2024-06-01 13:19:01] [INFO ] Flatten gal took : 69 ms
[2024-06-01 13:19:02] [INFO ] Input system was already deterministic with 601 transitions.
Reduction of identical properties reduced properties to check from 6 to 2
RANDOM walk for 68 steps (0 resets) in 15 ms. (4 steps per ms) remains 0/2 properties
Computed a total of 1 stabilizing places and 1 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' '!(F(G((X((p1||F(G(p1))))||p0))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-06-01 13:19:02] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:19:02] [INFO ] Invariant cache hit.
[2024-06-01 13:19:02] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 13:19:02] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:19:02] [INFO ] Invariant cache hit.
[2024-06-01 13:19:02] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:19:02] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 13:19:02] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:19:02] [INFO ] Invariant cache hit.
[2024-06-01 13:19:02] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:19:11] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 10 ms to minimize.
[2024-06-01 13:19:11] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:19:12] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 1 ms to minimize.
[2024-06-01 13:19:12] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-06-01 13:19:12] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2024-06-01 13:19:12] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-06-01 13:19:12] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:19:12] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-06-01 13:19:12] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:19:12] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2024-06-01 13:19:13] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-06-01 13:19:13] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:19:13] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:19:13] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:19:13] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:19:13] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-06-01 13:19:13] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:19:13] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:19:13] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:19:13] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 4 ms to minimize.
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:19:14] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:19:15] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:19:15] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-06-01 13:19:15] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:19:16] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 4 ms to minimize.
[2024-06-01 13:19:16] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:19:16] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-06-01 13:19:16] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-06-01 13:19:16] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-06-01 13:19:16] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:19:18] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:19:18] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:19:18] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:19:19] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:19:19] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:19:19] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:19:19] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:19:22] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:19:22] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:19:22] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:19:22] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:19:22] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:19:22] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:19:22] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-06-01 13:19:22] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:19:22] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:19:23] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:19:24] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:19:35] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:19:35] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 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 Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:19:41] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:19:41] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:19:41] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:19:41] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:19:41] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:19:47] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66767ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66797ms
Finished structural reductions in LTL mode , in 1 iterations and 67080 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 338 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 3 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-00 finished in 67697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 327 place count 33 transition count 305
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 1 with 16 rules applied. Total rules applied 343 place count 25 transition count 297
Applied a total of 343 rules in 134 ms. Remains 25 /66 variables (removed 41) and now considering 297/601 (removed 304) transitions.
[2024-06-01 13:20:10] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-06-01 13:20:10] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 13:20:10] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 13:20:10] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:20:10] [INFO ] Invariant cache hit.
[2024-06-01 13:20:10] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:20:10] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-06-01 13:20:10] [INFO ] Redundant transitions in 27 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:20:10] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:20:10] [INFO ] Invariant cache hit.
[2024-06-01 13:20:10] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:20:15] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:20:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:20:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:20:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17279 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48809ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48827ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/66 places, 297/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49201 ms. Remains : 25/66 places, 297/601 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-01
Stuttering criterion allowed to conclude after 2754 steps with 305 reset in 26 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-01 finished in 49315 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((X(X(F(p0)))||G(p1))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-06-01 13:20:59] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-06-01 13:20:59] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 13:20:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 13:20:59] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:20:59] [INFO ] Invariant cache hit.
[2024-06-01 13:20:59] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:20:59] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 13:20:59] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:20:59] [INFO ] Invariant cache hit.
[2024-06-01 13:20:59] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:21:08] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-06-01 13:21:08] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-06-01 13:21:08] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-06-01 13:21:08] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-06-01 13:21:08] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-06-01 13:21:08] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-06-01 13:21:08] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-06-01 13:21:09] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-06-01 13:21:09] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-06-01 13:21:09] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2024-06-01 13:21:09] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-06-01 13:21:09] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-06-01 13:21:09] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-06-01 13:21:09] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-06-01 13:21:09] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:21:09] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-06-01 13:21:09] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:21:11] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:21:11] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:21:11] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-06-01 13:21:11] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:21:12] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:21:12] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:21:12] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:21:12] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:21:12] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:21:12] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:21:13] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-06-01 13:21:13] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-06-01 13:21:14] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:21:16] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:21:16] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:21:16] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:21:16] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:21:17] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:21:18] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-06-01 13:21:18] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:21:18] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:21:18] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:21:19] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:21:19] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:21:31] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:21:31] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:21:37] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:21:37] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:21:37] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:21:38] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:21:38] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:21:39] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:21:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:21:43] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66382ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66390ms
Finished structural reductions in LTL mode , in 1 iterations and 66645 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-02
Product exploration explored 100000 steps with 5555 reset in 674 ms.
Product exploration explored 100000 steps with 5555 reset in 661 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (18 resets) in 2217 ms. (18 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 405 ms. (98 steps per ms) remains 1/1 properties
[2024-06-01 13:22:08] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:22:08] [INFO ] Invariant cache hit.
[2024-06-01 13:22:08] [INFO ] State equation strengthened by 517 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 591/657 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 516/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/658 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/658 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 584 constraints, problems are : Problem set: 0 solved, 1 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 517/517 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 66/658 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/66 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 562ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 10 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08a-LTLFireability-02 finished in 69641 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(F(p1))))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 327 place count 33 transition count 305
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 1 with 16 rules applied. Total rules applied 343 place count 25 transition count 297
Applied a total of 343 rules in 85 ms. Remains 25 /66 variables (removed 41) and now considering 297/601 (removed 304) transitions.
[2024-06-01 13:22:09] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-06-01 13:22:09] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:22:09] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 13:22:09] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:22:09] [INFO ] Invariant cache hit.
[2024-06-01 13:22:09] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:22:09] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-06-01 13:22:09] [INFO ] Redundant transitions in 9 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:22:09] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:22:09] [INFO ] Invariant cache hit.
[2024-06-01 13:22:09] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:22:11] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:22:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:22:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:22:11] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:22:11] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:22:11] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:22:11] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:22:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:22:11] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:22:11] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:22:12] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:22:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:22:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:22:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:22:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:22:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49310ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49314ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/66 places, 297/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49550 ms. Remains : 25/66 places, 297/601 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-03
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-03 finished in 49686 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(!p0)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-06-01 13:22:58] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-06-01 13:22:58] [INFO ] Computed 1 invariants in 4 ms
[2024-06-01 13:22:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 13:22:58] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:22:58] [INFO ] Invariant cache hit.
[2024-06-01 13:22:58] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:22:58] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 13:22:58] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:22:58] [INFO ] Invariant cache hit.
[2024-06-01 13:22:58] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:23:07] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-06-01 13:23:07] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2024-06-01 13:23:07] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-06-01 13:23:08] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-06-01 13:23:08] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-06-01 13:23:08] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:23:08] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-06-01 13:23:08] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-06-01 13:23:08] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-06-01 13:23:08] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2024-06-01 13:23:08] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:23:09] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-06-01 13:23:10] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:23:12] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:23:12] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:23:12] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:23:12] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-06-01 13:23:12] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-06-01 13:23:12] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:23:13] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:23:13] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:23:13] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:23:15] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:23:16] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:23:16] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:23:18] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:23:18] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:23:18] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:23:19] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:23:19] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:23:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:23:31] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:23:36] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:23:36] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:23:39] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:23:43] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66437ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66444ms
Finished structural reductions in LTL mode , in 1 iterations and 66649 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, p0, (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-04
Product exploration explored 100000 steps with 9969 reset in 615 ms.
Product exploration explored 100000 steps with 9956 reset in 617 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 68 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:24:07] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:24:07] [INFO ] Invariant cache hit.
[2024-06-01 13:24:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:24:07] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-01 13:24:07] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:24:07] [INFO ] [Real]Added 517 Read/Feed constraints in 44 ms returned sat
[2024-06-01 13:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:24:08] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-06-01 13:24:08] [INFO ] [Nat]Added 517 Read/Feed constraints in 50 ms returned sat
[2024-06-01 13:24:08] [INFO ] Computed and/alt/rep : 56/64/56 causal constraints (skipped 535 transitions) in 79 ms.
[2024-06-01 13:24:08] [INFO ] Added : 29 causal constraints over 6 iterations in 349 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 327 place count 33 transition count 305
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 1 with 16 rules applied. Total rules applied 343 place count 25 transition count 297
Applied a total of 343 rules in 84 ms. Remains 25 /66 variables (removed 41) and now considering 297/601 (removed 304) transitions.
[2024-06-01 13:24:08] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-06-01 13:24:08] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:24:08] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 13:24:08] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:24:08] [INFO ] Invariant cache hit.
[2024-06-01 13:24:08] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:24:08] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-06-01 13:24:08] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:24:08] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:24:08] [INFO ] Invariant cache hit.
[2024-06-01 13:24:08] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17832 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49388ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49392ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/66 places, 297/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49615 ms. Remains : 25/66 places, 297/601 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:24:58] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:24:58] [INFO ] Invariant cache hit.
[2024-06-01 13:24:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-01 13:24:58] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:24:58] [INFO ] [Real]Added 271 Read/Feed constraints in 27 ms returned sat
[2024-06-01 13:24:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:24:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 13:24:58] [INFO ] [Nat]Added 271 Read/Feed constraints in 34 ms returned sat
[2024-06-01 13:24:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 21 ms.
[2024-06-01 13:24:58] [INFO ] Added : 0 causal constraints over 0 iterations in 47 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 692 ms.
Product exploration explored 100000 steps with 11111 reset in 820 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 20 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 13:25:00] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:25:00] [INFO ] Invariant cache hit.
[2024-06-01 13:25:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 13:25:00] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:25:00] [INFO ] Invariant cache hit.
[2024-06-01 13:25:00] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:25:00] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-06-01 13:25:00] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:25:00] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:25:00] [INFO ] Invariant cache hit.
[2024-06-01 13:25:00] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49019ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49022ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49179 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyElection-PT-08a-LTLFireability-04 finished in 171153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-06-01 13:25:49] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-06-01 13:25:49] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 13:25:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 13:25:49] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:25:49] [INFO ] Invariant cache hit.
[2024-06-01 13:25:50] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:25:50] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 13:25:50] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:25:50] [INFO ] Invariant cache hit.
[2024-06-01 13:25:50] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:26:04] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-06-01 13:26:04] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:26:04] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:26:05] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-06-01 13:26:05] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:26:07] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:26:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 5 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:26:21] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:26:21] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:26:34] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66337ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66344ms
Finished structural reductions in LTL mode , in 1 iterations and 66539 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-06
Product exploration explored 100000 steps with 5555 reset in 679 ms.
Product exploration explored 100000 steps with 5555 reset in 687 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 68 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:26:58] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:26:58] [INFO ] Invariant cache hit.
[2024-06-01 13:26:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:26:58] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-06-01 13:26:58] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:26:58] [INFO ] [Real]Added 517 Read/Feed constraints in 52 ms returned sat
[2024-06-01 13:26:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:26:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:26:59] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 13:26:59] [INFO ] [Nat]Added 517 Read/Feed constraints in 57 ms returned sat
[2024-06-01 13:26:59] [INFO ] Computed and/alt/rep : 56/64/56 causal constraints (skipped 535 transitions) in 53 ms.
[2024-06-01 13:26:59] [INFO ] Added : 29 causal constraints over 6 iterations in 329 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 327 place count 33 transition count 305
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 1 with 16 rules applied. Total rules applied 343 place count 25 transition count 297
Applied a total of 343 rules in 60 ms. Remains 25 /66 variables (removed 41) and now considering 297/601 (removed 304) transitions.
[2024-06-01 13:26:59] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-06-01 13:26:59] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 13:26:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 13:26:59] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:26:59] [INFO ] Invariant cache hit.
[2024-06-01 13:26:59] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:26:59] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-06-01 13:26:59] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:26:59] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:26:59] [INFO ] Invariant cache hit.
[2024-06-01 13:26:59] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:27:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:27:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:27:04] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:27:04] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:27:04] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:27:04] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:27:05] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:27:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 18099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49803ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49807ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/66 places, 297/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49997 ms. Remains : 25/66 places, 297/601 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:27:49] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:27:49] [INFO ] Invariant cache hit.
[2024-06-01 13:27:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:27:50] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 13:27:50] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:27:50] [INFO ] [Real]Added 271 Read/Feed constraints in 27 ms returned sat
[2024-06-01 13:27:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:27:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:27:50] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-01 13:27:50] [INFO ] [Nat]Added 271 Read/Feed constraints in 36 ms returned sat
[2024-06-01 13:27:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 21 ms.
[2024-06-01 13:27:50] [INFO ] Added : 0 causal constraints over 0 iterations in 44 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 676 ms.
Product exploration explored 100000 steps with 11111 reset in 687 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 15 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 13:27:51] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:27:51] [INFO ] Invariant cache hit.
[2024-06-01 13:27:51] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 13:27:51] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:27:51] [INFO ] Invariant cache hit.
[2024-06-01 13:27:51] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:27:51] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-06-01 13:27:51] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:27:51] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:27:51] [INFO ] Invariant cache hit.
[2024-06-01 13:27:51] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:27:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:27:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:27:53] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:27:53] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:27:54] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:27:56] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:27:56] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:27:56] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:27:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17598 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48969ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48972ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49116 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyElection-PT-08a-LTLFireability-06 finished in 171147 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(((F(G(p0))||G(!p0)) U ((F(G(p0))||G(!p0))&&p1)))))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-06-01 13:28:41] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-06-01 13:28:41] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 13:28:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 13:28:41] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:28:41] [INFO ] Invariant cache hit.
[2024-06-01 13:28:41] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:28:41] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 13:28:41] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:28:41] [INFO ] Invariant cache hit.
[2024-06-01 13:28:41] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:28:49] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-06-01 13:28:49] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2024-06-01 13:28:49] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-06-01 13:28:49] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:28:51] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-06-01 13:28:52] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:28:54] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:28:54] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:28:54] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:28:54] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:28:54] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:28:54] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:28:55] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:28:55] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:28:55] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:28:56] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:28:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:28:58] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:28:58] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:28:58] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:28:59] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:29:00] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:29:01] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:29:12] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:29:12] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:29:18] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:29:19] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:29:19] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:29:19] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:29:19] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:29:21] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66083ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66094ms
Finished structural reductions in LTL mode , in 1 iterations and 66399 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-07
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-07 finished in 66659 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((X(p1)&&p0))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-06-01 13:29:47] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:29:47] [INFO ] Invariant cache hit.
[2024-06-01 13:29:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 13:29:47] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:29:47] [INFO ] Invariant cache hit.
[2024-06-01 13:29:47] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:29:47] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 13:29:47] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:29:47] [INFO ] Invariant cache hit.
[2024-06-01 13:29:47] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:29:55] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2024-06-01 13:29:56] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2024-06-01 13:29:56] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:29:56] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-06-01 13:29:56] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-06-01 13:29:56] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:29:56] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2024-06-01 13:29:56] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:30:00] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:30:00] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:30:00] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:30:00] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:30:01] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-06-01 13:30:01] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:30:02] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-06-01 13:30:02] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-06-01 13:30:02] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:30:03] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:30:03] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:30:03] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:30:19] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:30:20] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 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 Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:30:25] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:30:25] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:30:25] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:30:25] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:30:27] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:30:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:30:32] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66017ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66023ms
Finished structural reductions in LTL mode , in 1 iterations and 66232 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-08
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-08 finished in 66361 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((G(p1)||p0))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-06-01 13:30:54] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:30:54] [INFO ] Invariant cache hit.
[2024-06-01 13:30:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 13:30:54] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:30:54] [INFO ] Invariant cache hit.
[2024-06-01 13:30:54] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:30:54] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 13:30:54] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:30:54] [INFO ] Invariant cache hit.
[2024-06-01 13:30:54] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 0 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-06-01 13:31:06] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-06-01 13:31:06] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-06-01 13:31:06] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:31:06] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:31:06] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:31:06] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-06-01 13:31:06] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:31:07] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:31:07] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:31:07] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-06-01 13:31:07] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:31:08] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:31:08] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:31:09] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-06-01 13:31:09] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-06-01 13:31:09] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:31:10] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-06-01 13:31:10] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:31:10] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:31:12] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:31:12] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:31:15] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:31:15] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:31:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:31:32] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:31:32] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:31:32] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:31:32] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:31:34] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:31:35] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:31:39] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30324 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66837ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66844ms
Finished structural reductions in LTL mode , in 1 iterations and 67039 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT 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 9 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08a-LTLFireability-09 finished in 67349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-06-01 13:32:01] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:32:01] [INFO ] Invariant cache hit.
[2024-06-01 13:32:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 13:32:01] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:32:01] [INFO ] Invariant cache hit.
[2024-06-01 13:32:01] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:32:01] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 13:32:01] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:32:01] [INFO ] Invariant cache hit.
[2024-06-01 13:32:01] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2024-06-01 13:32:10] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:32:11] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:32:12] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-06-01 13:32:13] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:32:14] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:32:15] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:32:15] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:32:15] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:32:20] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:32:20] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:32:20] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:32:20] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:32:33] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:32:39] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:32:41] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:32:41] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66203ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66209ms
Finished structural reductions in LTL mode , in 1 iterations and 66403 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Product exploration explored 100000 steps with 33333 reset in 132 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08a-LTLFireability-11 finished in 66786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-06-01 13:33:08] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:33:08] [INFO ] Invariant cache hit.
[2024-06-01 13:33:08] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 13:33:08] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:33:08] [INFO ] Invariant cache hit.
[2024-06-01 13:33:08] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:33:08] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 13:33:08] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:33:08] [INFO ] Invariant cache hit.
[2024-06-01 13:33:08] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:33:17] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:33:22] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:33:22] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:33:22] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:33:25] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:33:25] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:33:25] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:33:25] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:33:27] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:33:27] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:33:27] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-06-01 13:33:27] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:33:27] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:33:27] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:33:28] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:33:28] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:33:40] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:33:40] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:33:45] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:33:47] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:33:48] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:33:52] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66050ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66055ms
Finished structural reductions in LTL mode , in 1 iterations and 66256 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-13 finished in 66349 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))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 327 place count 33 transition count 305
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 1 with 16 rules applied. Total rules applied 343 place count 25 transition count 297
Applied a total of 343 rules in 62 ms. Remains 25 /66 variables (removed 41) and now considering 297/601 (removed 304) transitions.
[2024-06-01 13:34:14] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-06-01 13:34:14] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:34:14] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 13:34:14] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:34:14] [INFO ] Invariant cache hit.
[2024-06-01 13:34:14] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:34:14] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-06-01 13:34:14] [INFO ] Redundant transitions in 9 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:34:14] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:34:14] [INFO ] Invariant cache hit.
[2024-06-01 13:34:14] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17352 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48915ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48918ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/66 places, 297/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49100 ms. Remains : 25/66 places, 297/601 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-14
Product exploration explored 100000 steps with 11111 reset in 691 ms.
Product exploration explored 100000 steps with 11111 reset in 701 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-06-01 13:35:05] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:35:05] [INFO ] Invariant cache hit.
[2024-06-01 13:35:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:35:05] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 13:35:05] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:35:05] [INFO ] [Real]Added 271 Read/Feed constraints in 27 ms returned sat
[2024-06-01 13:35:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:35:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:35:05] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 13:35:05] [INFO ] [Nat]Added 271 Read/Feed constraints in 41 ms returned sat
[2024-06-01 13:35:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 23 ms.
[2024-06-01 13:35:05] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 18 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 13:35:05] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:35:05] [INFO ] Invariant cache hit.
[2024-06-01 13:35:05] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 13:35:05] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:35:05] [INFO ] Invariant cache hit.
[2024-06-01 13:35:05] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:35:05] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-06-01 13:35:06] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:35:06] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:35:06] [INFO ] Invariant cache hit.
[2024-06-01 13:35:06] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:35:09] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:35:10] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:35:10] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:35:10] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:35:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:35:10] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:35:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:35:11] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:35:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48912ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48915ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49064 ms. Remains : 25/25 places, 297/297 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-06-01 13:35:55] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:35:55] [INFO ] Invariant cache hit.
[2024-06-01 13:35:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:35:55] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 13:35:55] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:35:55] [INFO ] [Real]Added 271 Read/Feed constraints in 26 ms returned sat
[2024-06-01 13:35:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:35:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:35:55] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 13:35:55] [INFO ] [Nat]Added 271 Read/Feed constraints in 34 ms returned sat
[2024-06-01 13:35:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 20 ms.
[2024-06-01 13:35:55] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 685 ms.
Product exploration explored 100000 steps with 11111 reset in 686 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 15 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 13:35:57] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:35:57] [INFO ] Invariant cache hit.
[2024-06-01 13:35:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 13:35:57] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:35:57] [INFO ] Invariant cache hit.
[2024-06-01 13:35:57] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:35:57] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-06-01 13:35:57] [INFO ] Redundant transitions in 11 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:35:57] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:35:57] [INFO ] Invariant cache hit.
[2024-06-01 13:35:57] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:35:59] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:36:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:36:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:36:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:36:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:36:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17389 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48869ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48873ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49014 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyElection-PT-08a-LTLFireability-14 finished in 151647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-06-01 13:36:46] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-06-01 13:36:46] [INFO ] Computed 1 invariants in 4 ms
[2024-06-01 13:36:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 13:36:46] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:36:46] [INFO ] Invariant cache hit.
[2024-06-01 13:36:46] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 13:36:46] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 13:36:46] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-06-01 13:36:46] [INFO ] Invariant cache hit.
[2024-06-01 13:36:46] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:36:55] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2024-06-01 13:36:55] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-06-01 13:36:59] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:36:59] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:36:59] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2024-06-01 13:36:59] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-06-01 13:36:59] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-06-01 13:37:00] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:37:00] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-06-01 13:37:00] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-06-01 13:37:00] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-06-01 13:37:01] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-06-01 13:37:01] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:37:02] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:37:02] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-06-01 13:37:02] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:37:03] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:37:03] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:37:04] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:37:08] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:37:08] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:37:19] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:37:19] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:37:24] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:37:25] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:37:25] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:37:25] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:37:25] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:37:26] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 13:37:31] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 67155ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 67160ms
Finished structural reductions in LTL mode , in 1 iterations and 67374 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, p0, p0]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-15 finished in 67485 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(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : StigmergyElection-PT-08a-LTLFireability-06
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Applied a total of 319 rules in 21 ms. Remains 33 /66 variables (removed 33) and now considering 313/601 (removed 288) transitions.
[2024-06-01 13:37:53] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
// Phase 1: matrix 304 rows 33 cols
[2024-06-01 13:37:53] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:37:54] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 13:37:54] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-06-01 13:37:54] [INFO ] Invariant cache hit.
[2024-06-01 13:37:54] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:37:54] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-01 13:37:54] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-06-01 13:37:54] [INFO ] Invariant cache hit.
[2024-06-01 13:37:54] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 303/336 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 270/338 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 13:38:03] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 13:38:06] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (OVERLAPS) 0/337 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 341 constraints, problems are : Problem set: 0 solved, 305 unsolved in 17289 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 303/336 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 270/352 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 305/657 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 1/337 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 658 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 48/48 constraints]
After SMT, in 48710ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 48714ms
Starting structural reductions in LI_LTL mode, iteration 1 : 33/66 places, 313/601 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 48845 ms. Remains : 33/66 places, 313/601 transitions.
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-06
Product exploration explored 100000 steps with 11111 reset in 667 ms.
Product exploration explored 100000 steps with 11111 reset in 684 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:38:44] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-06-01 13:38:44] [INFO ] Invariant cache hit.
[2024-06-01 13:38:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:38:44] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-01 13:38:44] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:38:44] [INFO ] [Real]Added 271 Read/Feed constraints in 23 ms returned sat
[2024-06-01 13:38:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:38:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:38:45] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 13:38:45] [INFO ] [Nat]Added 271 Read/Feed constraints in 25 ms returned sat
[2024-06-01 13:38:45] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 288 transitions) in 21 ms.
[2024-06-01 13:38:45] [INFO ] Added : 0 causal constraints over 0 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 313/313 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 305
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 0 with 16 rules applied. Total rules applied 24 place count 25 transition count 297
Applied a total of 24 rules in 35 ms. Remains 25 /33 variables (removed 8) and now considering 297/313 (removed 16) transitions.
[2024-06-01 13:38:45] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-06-01 13:38:45] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 13:38:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 13:38:45] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:38:45] [INFO ] Invariant cache hit.
[2024-06-01 13:38:45] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:38:45] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-06-01 13:38:45] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:38:45] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:38:45] [INFO ] Invariant cache hit.
[2024-06-01 13:38:45] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:38:47] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:38:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17788 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49357ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 297/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49526 ms. Remains : 25/33 places, 297/313 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:39:35] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:39:35] [INFO ] Invariant cache hit.
[2024-06-01 13:39:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:39:35] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 13:39:35] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:39:35] [INFO ] [Real]Added 271 Read/Feed constraints in 30 ms returned sat
[2024-06-01 13:39:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:39:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:39:35] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 13:39:35] [INFO ] [Nat]Added 271 Read/Feed constraints in 34 ms returned sat
[2024-06-01 13:39:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 23 ms.
[2024-06-01 13:39:35] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 687 ms.
Product exploration explored 100000 steps with 11111 reset in 704 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 16 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 13:39:36] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:39:36] [INFO ] Invariant cache hit.
[2024-06-01 13:39:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 13:39:36] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:39:36] [INFO ] Invariant cache hit.
[2024-06-01 13:39:37] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 13:39:37] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-06-01 13:39:37] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 13:39:37] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 13:39:37] [INFO ] Invariant cache hit.
[2024-06-01 13:39:37] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 13:39:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:39:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48951ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48954ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49106 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyElection-PT-08a-LTLFireability-06 finished in 152264 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))'
[2024-06-01 13:40:26] [INFO ] Flatten gal took : 55 ms
[2024-06-01 13:40:26] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 13:40:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 601 transitions and 8475 arcs took 14 ms.
Total runtime 1286931 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-08a-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-08a-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-08a-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717249227252

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyElection-PT-08a-LTLFireability-04
ltl formula formula --ltl=/tmp/5804/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 66 places, 601 transitions and 8475 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5804/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5804/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5804/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5804/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 68 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 67, there are 653 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6562
pnml2lts-mc( 0/ 4): unique states count: 6562
pnml2lts-mc( 0/ 4): unique transitions count: 198296
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 193002
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6674
pnml2lts-mc( 0/ 4): - cum. max stack depth: 68
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6674 states 203430 transitions, fanout: 30.481
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.080 sec minimum, 0.095 sec on average)
pnml2lts-mc( 0/ 4): States per second: 66740, Transitions per second: 2034300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 8.3 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 613 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-08a-LTLFireability-06
ltl formula formula --ltl=/tmp/5804/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 66 places, 601 transitions and 8475 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5804/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5804/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5804/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5804/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 68 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 67, there are 618 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6562
pnml2lts-mc( 0/ 4): unique states count: 6562
pnml2lts-mc( 0/ 4): unique transitions count: 198289
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 192143
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6620
pnml2lts-mc( 0/ 4): - cum. max stack depth: 71
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6620 states 200674 transitions, fanout: 30.313
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 82750, Transitions per second: 2508425
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 8.2 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 613 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-08a-LTLFireability-14
ltl formula formula --ltl=/tmp/5804/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 66 places, 601 transitions and 8475 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5804/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5804/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5804/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5804/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 68 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 67, there are 617 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6562
pnml2lts-mc( 0/ 4): unique states count: 6562
pnml2lts-mc( 0/ 4): unique transitions count: 198296
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 192265
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6635
pnml2lts-mc( 0/ 4): - cum. max stack depth: 71
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6635 states 201506 transitions, fanout: 30.370
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 94786, Transitions per second: 2878657
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 8.2 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 613 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;