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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 11 18:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 145K Apr 11 18:55 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 565K 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-06a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717246717209

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-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:58:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:58:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:58:38] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-06-01 12:58:38] [INFO ] Transformed 86 places.
[2024-06-01 12:58:38] [INFO ] Transformed 1042 transitions.
[2024-06-01 12:58:38] [INFO ] Found NUPN structural information;
[2024-06-01 12:58:38] [INFO ] Parsed PT model containing 86 places and 1042 transitions and 11192 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyElection-PT-06a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 242/242 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 75 transition count 225
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 75 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 70 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 70 transition count 215
Applied a total of 32 rules in 33 ms. Remains 70 /86 variables (removed 16) and now considering 215/242 (removed 27) transitions.
[2024-06-01 12:58:38] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
// Phase 1: matrix 208 rows 70 cols
[2024-06-01 12:58:38] [INFO ] Computed 2 invariants in 16 ms
[2024-06-01 12:58:39] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 12:58:39] [INFO ] Flow matrix only has 208 transitions (discarded 7 similar events)
[2024-06-01 12:58:39] [INFO ] Invariant cache hit.
[2024-06-01 12:58:39] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-06-01 12:58:39] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 413 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/86 places, 215/242 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 59 transition count 205
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 59 transition count 205
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 53 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 53 transition count 199
Applied a total of 32 rules in 7 ms. Remains 53 /69 variables (removed 16) and now considering 199/215 (removed 16) transitions.
[2024-06-01 12:58:39] [INFO ] Flow matrix only has 192 transitions (discarded 7 similar events)
// Phase 1: matrix 192 rows 53 cols
[2024-06-01 12:58:39] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 12:58:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 12:58:39] [INFO ] Flow matrix only has 192 transitions (discarded 7 similar events)
[2024-06-01 12:58:39] [INFO ] Invariant cache hit.
[2024-06-01 12:58:39] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 12:58:39] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 53/86 places, 199/242 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 593 ms. Remains : 53/86 places, 199/242 transitions.
Support contains 8 out of 53 places after structural reductions.
[2024-06-01 12:58:39] [INFO ] Flatten gal took : 40 ms
[2024-06-01 12:58:39] [INFO ] Flatten gal took : 18 ms
[2024-06-01 12:58:39] [INFO ] Input system was already deterministic with 199 transitions.
Reduction of identical properties reduced properties to check from 8 to 5
RANDOM walk for 282 steps (2 resets) in 35 ms. (7 steps per ms) remains 0/5 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((F(p0)&&(X(p0)||p1))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 5 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-06-01 12:58:39] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-06-01 12:58:39] [INFO ] Computed 1 invariants in 4 ms
[2024-06-01 12:58:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 12:58:40] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 12:58:40] [INFO ] Invariant cache hit.
[2024-06-01 12:58:40] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 12:58:40] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-01 12:58:40] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 12:58:40] [INFO ] Invariant cache hit.
[2024-06-01 12:58:40] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 21 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 14 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:58:41] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 2 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:58:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:58:43] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:58:43] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:58:43] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:58:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:58:43] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:58:43] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:58:43] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:58:44] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 10475 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 28672ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 28692ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28810 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-00
Product exploration explored 100000 steps with 7142 reset in 416 ms.
Product exploration explored 100000 steps with 7142 reset in 248 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 p0) p1), (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 89 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 52 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (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 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:59:10] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 12:59:10] [INFO ] Invariant cache hit.
[2024-06-01 12:59:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:59:10] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 12:59:10] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 12:59:10] [INFO ] [Real]Added 131 Read/Feed constraints in 10 ms returned sat
[2024-06-01 12:59:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:59:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 12:59:10] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-01 12:59:10] [INFO ] [Nat]Added 131 Read/Feed constraints in 13 ms returned sat
[2024-06-01 12:59:10] [INFO ] Computed and/alt/rep : 42/48/42 causal constraints (skipped 145 transitions) in 20 ms.
[2024-06-01 12:59:10] [INFO ] Added : 20 causal constraints over 4 iterations in 91 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 49 transition count 182
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 37 transition count 182
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 25 transition count 170
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 111 place count 25 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 117 place count 25 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 129 place count 19 transition count 95
Applied a total of 129 rules in 59 ms. Remains 19 /50 variables (removed 31) and now considering 95/195 (removed 100) transitions.
[2024-06-01 12:59:10] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 12:59:10] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:59:10] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 12:59:10] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 12:59:10] [INFO ] Invariant cache hit.
[2024-06-01 12:59:10] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 12:59:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 12:59:10] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 12:59:10] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 12:59:10] [INFO ] Invariant cache hit.
[2024-06-01 12:59:10] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:59:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:59:10] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 12:59:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:59:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 7 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 3 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:11] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:12] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:59:12] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 4 ms to minimize.
[2024-06-01 12:59:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:13] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:59:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7286ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7287ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/50 places, 95/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7409 ms. Remains : 19/50 places, 95/195 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 81 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 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 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 183 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:59:18] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 12:59:18] [INFO ] Invariant cache hit.
[2024-06-01 12:59:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 12:59:18] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 12:59:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 12:59:18] [INFO ] [Real]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 12:59:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:59:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 12:59:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 12:59:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 12:59:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 9 ms.
[2024-06-01 12:59:18] [INFO ] Added : 0 causal constraints over 0 iterations in 16 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 14285 reset in 201 ms.
Product exploration explored 100000 steps with 14285 reset in 296 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 7 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 12:59:19] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 12:59:19] [INFO ] Invariant cache hit.
[2024-06-01 12:59:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 12:59:19] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 12:59:19] [INFO ] Invariant cache hit.
[2024-06-01 12:59:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 12:59:19] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 12:59:19] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 12:59:19] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 12:59:19] [INFO ] Invariant cache hit.
[2024-06-01 12:59:19] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:59:19] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:21] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:59:21] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:59:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:21] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:59:23] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:59:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:59:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7493ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7494ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7571 ms. Remains : 19/19 places, 95/95 transitions.
Treatment of property StigmergyElection-PT-06a-LTLFireability-00 finished in 46834 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(G(p0))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 3 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-06-01 12:59:26] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-06-01 12:59:26] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:59:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 12:59:26] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 12:59:26] [INFO ] Invariant cache hit.
[2024-06-01 12:59:26] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 12:59:26] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-01 12:59:26] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 12:59:26] [INFO ] Invariant cache hit.
[2024-06-01 12:59:26] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:59:27] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:59:28] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:29] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:59:30] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:59:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:59:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:59:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:59:30] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:59:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:59:30] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:59:30] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 12:59:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9748 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 18067 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 28283ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 28285ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28389 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-01 finished in 28610 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 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 50 transition count 184
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 38 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 36 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 36 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 36 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 36 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 35 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 25 transition count 167
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 117 place count 25 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 25 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 135 place count 19 transition count 95
Applied a total of 135 rules in 27 ms. Remains 19 /53 variables (removed 34) and now considering 95/199 (removed 104) transitions.
[2024-06-01 12:59:55] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 12:59:55] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:59:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 12:59:55] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 12:59:55] [INFO ] Invariant cache hit.
[2024-06-01 12:59:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 12:59:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-01 12:59:55] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 12:59:55] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 12:59:55] [INFO ] Invariant cache hit.
[2024-06-01 12:59:55] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:55] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:59:55] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:59:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:59:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:59:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:59:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:59:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:59:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:56] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:57] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:59:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:59:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:57] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:58] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:59:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:59:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:59:58] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:59:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:59:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:59:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 12:59:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:59:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:59:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7302ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7303ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/53 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7417 ms. Remains : 19/53 places, 95/199 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-02
Product exploration explored 100000 steps with 14285 reset in 191 ms.
Product exploration explored 100000 steps with 14285 reset in 204 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 72 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 41 ms :[(NOT p0)]
RANDOM walk for 24 steps (0 resets) in 11 ms. (2 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 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 13:00:03] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:00:03] [INFO ] Invariant cache hit.
[2024-06-01 13:00:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:00:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 13:00:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:00:03] [INFO ] [Real]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:00:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:00:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:00:03] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 13:00:03] [INFO ] [Nat]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:00:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 6 ms.
[2024-06-01 13:00:03] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 13:00:03] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:00:03] [INFO ] Invariant cache hit.
[2024-06-01 13:00:03] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 13:00:03] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:00:03] [INFO ] Invariant cache hit.
[2024-06-01 13:00:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:00:03] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 13:00:03] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 13:00:03] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:00:03] [INFO ] Invariant cache hit.
[2024-06-01 13:00:03] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:00:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:05] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:00:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:00:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:00:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4250 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7532ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7533ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7605 ms. Remains : 19/19 places, 95/95 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 69 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 24 steps (0 resets) in 4 ms. (4 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 89 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-06-01 13:00:11] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:00:11] [INFO ] Invariant cache hit.
[2024-06-01 13:00:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:00:11] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 13:00:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:00:11] [INFO ] [Real]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:00:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:00:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:00:11] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 13:00:11] [INFO ] [Nat]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:00:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 6 ms.
[2024-06-01 13:00:11] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 199 ms.
Product exploration explored 100000 steps with 14285 reset in 204 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 13:00:12] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:00:12] [INFO ] Invariant cache hit.
[2024-06-01 13:00:12] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 13:00:12] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:00:12] [INFO ] Invariant cache hit.
[2024-06-01 13:00:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:00:12] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-01 13:00:12] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 13:00:12] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:00:12] [INFO ] Invariant cache hit.
[2024-06-01 13:00:12] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:00:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:13] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:13] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:00:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:14] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:00:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:00:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:00:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:00:16] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:00:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:00:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7435ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7437ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7506 ms. Remains : 19/19 places, 95/95 transitions.
Treatment of property StigmergyElection-PT-06a-LTLFireability-02 finished in 24358 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(G(p1))||p0)))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 3 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-06-01 13:00:19] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-06-01 13:00:19] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:00:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 13:00:19] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 13:00:19] [INFO ] Invariant cache hit.
[2024-06-01 13:00:19] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 13:00:19] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-01 13:00:19] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 13:00:19] [INFO ] Invariant cache hit.
[2024-06-01 13:00:19] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:00:20] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:00:20] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:00:20] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:00:20] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:00:20] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:00:20] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:00:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:00:22] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:00:22] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:00:22] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:00:22] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:00:22] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:22] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:00:22] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:00:22] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:00:23] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:00:23] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:00:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:00:23] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:00:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:00:23] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:00:23] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9937 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 18393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 28702ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 28704ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28788 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 88 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 p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-06a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-06a-LTLFireability-04 finished in 29094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 52 transition count 191
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 45 transition count 191
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 45 transition count 185
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 39 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 38 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 38 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 38 transition count 182
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 27 transition count 171
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 81 place count 27 transition count 141
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 93 place count 21 transition count 135
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 99 place count 21 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 93 transitions
Redundant transition composition rules discarded 93 transitions
Iterating global reduction 5 with 93 rules applied. Total rules applied 192 place count 21 transition count 36
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 204 place count 15 transition count 30
Applied a total of 204 rules in 23 ms. Remains 15 /53 variables (removed 38) and now considering 30/199 (removed 169) transitions.
[2024-06-01 13:00:48] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 15 cols
[2024-06-01 13:00:48] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:00:48] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 13:00:48] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-06-01 13:00:48] [INFO ] Invariant cache hit.
[2024-06-01 13:00:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 13:00:48] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 13:00:48] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 13:00:48] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-06-01 13:00:48] [INFO ] Invariant cache hit.
[2024-06-01 13:00:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 23/38 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 46 constraints, problems are : Problem set: 0 solved, 15 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 23/38 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 61 constraints, problems are : Problem set: 0 solved, 15 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
After SMT, in 940ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 940ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/53 places, 30/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1035 ms. Remains : 15/53 places, 30/199 transitions.
Stuttering acceptance computed with spot in 46 ms :[false]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 114 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 264 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[false]
RANDOM walk for 144 steps (15 resets) in 10 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[false]
Stuttering acceptance computed with spot in 48 ms :[false]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 30/30 transitions.
Applied a total of 0 rules in 4 ms. Remains 15 /15 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 13:00:50] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-06-01 13:00:50] [INFO ] Invariant cache hit.
[2024-06-01 13:00:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 13:00:50] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-06-01 13:00:50] [INFO ] Invariant cache hit.
[2024-06-01 13:00:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 13:00:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 13:00:50] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 13:00:50] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-06-01 13:00:50] [INFO ] Invariant cache hit.
[2024-06-01 13:00:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:00:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:00:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:00:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:00:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:00:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:00:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2024-06-01 13:00:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 23/38 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 46 constraints, problems are : Problem set: 0 solved, 15 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 23/38 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 61 constraints, problems are : Problem set: 0 solved, 15 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
After SMT, in 1042ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1042ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1106 ms. Remains : 15/15 places, 30/30 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[false]
RANDOM walk for 80 steps (6 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[false]
Stuttering acceptance computed with spot in 25 ms :[false]
Stuttering acceptance computed with spot in 39 ms :[false]
Product exploration explored 100000 steps with 0 reset in 38 ms.
Product exploration explored 100000 steps with 0 reset in 162 ms.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 13:00:52] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-06-01 13:00:52] [INFO ] Invariant cache hit.
[2024-06-01 13:00:52] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 13:00:52] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-06-01 13:00:52] [INFO ] Invariant cache hit.
[2024-06-01 13:00:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 13:00:52] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-01 13:00:52] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 13:00:52] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-06-01 13:00:52] [INFO ] Invariant cache hit.
[2024-06-01 13:00:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:00:52] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:00:53] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:00:53] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:00:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:00:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:00:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:00:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 23/38 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 13:00:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 46 constraints, problems are : Problem set: 0 solved, 15 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 23/38 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 61 constraints, problems are : Problem set: 0 solved, 15 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 29/29 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 940ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1002 ms. Remains : 15/15 places, 30/30 transitions.
Treatment of property StigmergyElection-PT-06a-LTLFireability-05 finished in 4632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p0)))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 7 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-06-01 13:00:53] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-06-01 13:00:53] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:00:53] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 13:00:53] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 13:00:53] [INFO ] Invariant cache hit.
[2024-06-01 13:00:53] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 13:00:53] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-01 13:00:53] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 13:00:53] [INFO ] Invariant cache hit.
[2024-06-01 13:00:53] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:00:56] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:00:57] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:00:57] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:00:57] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9748 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17686 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 27800ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 27802ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27903 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-06
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-06 finished in 28067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 50 transition count 184
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 38 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 36 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 36 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 36 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 36 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 35 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 25 transition count 167
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 117 place count 25 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 25 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 135 place count 19 transition count 95
Applied a total of 135 rules in 32 ms. Remains 19 /53 variables (removed 34) and now considering 95/199 (removed 104) transitions.
[2024-06-01 13:01:21] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 13:01:21] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:01:21] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 13:01:21] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:01:21] [INFO ] Invariant cache hit.
[2024-06-01 13:01:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:01:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 13:01:21] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 13:01:21] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:01:21] [INFO ] Invariant cache hit.
[2024-06-01 13:01:21] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:21] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-06-01 13:01:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:01:21] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:01:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:23] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:01:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:01:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7427ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7428ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/53 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7519 ms. Remains : 19/53 places, 95/199 transitions.
Stuttering acceptance computed with spot in 47 ms :[p0]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-07 finished in 7584 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(G(p0))))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 5 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-06-01 13:01:29] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-06-01 13:01:29] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 13:01:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 13:01:29] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 13:01:29] [INFO ] Invariant cache hit.
[2024-06-01 13:01:29] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 13:01:29] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-01 13:01:29] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 13:01:29] [INFO ] Invariant cache hit.
[2024-06-01 13:01:29] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:01:30] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:01:31] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:01:32] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:01:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:01:32] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:01:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:01:32] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:01:32] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:01:32] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:01:32] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:01:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:01:33] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9882 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 18548 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 28794ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 28799ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28888 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-09 finished in 29020 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)&&F(!p0)))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 50 transition count 184
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 38 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 36 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 36 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 36 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 36 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 35 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 25 transition count 167
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 117 place count 25 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 25 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 135 place count 19 transition count 95
Applied a total of 135 rules in 17 ms. Remains 19 /53 variables (removed 34) and now considering 95/199 (removed 104) transitions.
[2024-06-01 13:01:58] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 13:01:58] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:01:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 13:01:58] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:01:58] [INFO ] Invariant cache hit.
[2024-06-01 13:01:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:01:58] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-01 13:01:58] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 13:01:58] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:01:58] [INFO ] Invariant cache hit.
[2024-06-01 13:01:58] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:01:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:01:59] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:00] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:02:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:02:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:00] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:01] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:02:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:02:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:02:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:02:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:02:01] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:01] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:02:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:02:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:02:02] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:02:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:02:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:02] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:02:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:02:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7543ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7544ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/53 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7627 ms. Remains : 19/53 places, 95/199 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, p0, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-11
Product exploration explored 100000 steps with 14285 reset in 301 ms.
Product exploration explored 100000 steps with 14285 reset in 248 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 70 ms. Reduced automaton from 3 states, 4 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 24 steps (0 resets) in 4 ms. (4 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 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:02:06] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:02:06] [INFO ] Invariant cache hit.
[2024-06-01 13:02:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:02:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 13:02:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:02:06] [INFO ] [Real]Added 75 Read/Feed constraints in 8 ms returned sat
[2024-06-01 13:02:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:02:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:02:06] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 13:02:06] [INFO ] [Nat]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:02:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 6 ms.
[2024-06-01 13:02:06] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 13:02:06] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:02:06] [INFO ] Invariant cache hit.
[2024-06-01 13:02:06] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 13:02:06] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:02:06] [INFO ] Invariant cache hit.
[2024-06-01 13:02:07] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:02:07] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-06-01 13:02:07] [INFO ] Redundant transitions in 0 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 13:02:07] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:02:07] [INFO ] Invariant cache hit.
[2024-06-01 13:02:07] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:02:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:08] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:08] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:02:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:02:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:02:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:02:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:02:11] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4074 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7384ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7385ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7457 ms. Remains : 19/19 places, 95/95 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 81 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 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 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 80 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:02:14] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:02:14] [INFO ] Invariant cache hit.
[2024-06-01 13:02:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:02:14] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 13:02:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:02:14] [INFO ] [Real]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:02:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:02:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:02:14] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 13:02:14] [INFO ] [Nat]Added 75 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:02:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 6 ms.
[2024-06-01 13:02:14] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 212 ms.
Product exploration explored 100000 steps with 14285 reset in 221 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 13:02:15] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:02:15] [INFO ] Invariant cache hit.
[2024-06-01 13:02:15] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 13:02:15] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:02:15] [INFO ] Invariant cache hit.
[2024-06-01 13:02:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:02:15] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 13:02:15] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 13:02:15] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:02:15] [INFO ] Invariant cache hit.
[2024-06-01 13:02:15] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:02:15] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:02:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:02:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:02:16] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:02:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:02:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:02:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:02:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:16] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:16] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:17] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:02:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:17] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:02:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2967 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:18] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:02:18] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:02:18] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:02:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:02:18] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:02:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:02:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:02:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:02:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:02:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:02:19] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:02:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:02:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:02:19] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4242 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7320ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7321ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7386 ms. Remains : 19/19 places, 95/95 transitions.
Treatment of property StigmergyElection-PT-06a-LTLFireability-11 finished in 24718 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||((G(p2)&&p1) U p3))))'
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 197
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 2 place count 51 transition count 185
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 26 place count 39 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 38 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 38 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 38 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 29 place count 38 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 37 transition count 182
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 27 transition count 172
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 81 place count 27 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 27 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 99 place count 21 transition count 130
Applied a total of 99 rules in 21 ms. Remains 21 /53 variables (removed 32) and now considering 130/199 (removed 69) transitions.
[2024-06-01 13:02:22] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
// Phase 1: matrix 123 rows 21 cols
[2024-06-01 13:02:22] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:02:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 13:02:22] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-06-01 13:02:22] [INFO ] Invariant cache hit.
[2024-06-01 13:02:22] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 13:02:22] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-06-01 13:02:22] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2024-06-01 13:02:22] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-06-01 13:02:22] [INFO ] Invariant cache hit.
[2024-06-01 13:02:22] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:02:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:02:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 122/143 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 105/148 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:02:25] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:02:25] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 151 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 122/143 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 105/150 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 124/274 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 275 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
After SMT, in 9625ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 9627ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/53 places, 130/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9725 ms. Remains : 21/53 places, 130/199 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p3))]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-12
Product exploration explored 100000 steps with 14285 reset in 286 ms.
Product exploration explored 100000 steps with 14285 reset in 295 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 : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 47 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p3))]
[2024-06-01 13:02:33] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-06-01 13:02:33] [INFO ] Invariant cache hit.
[2024-06-01 13:02:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:02:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:02:33] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 13:02:33] [INFO ] [Real]Added 106 Read/Feed constraints in 8 ms returned sat
[2024-06-01 13:02:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:02:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:02:33] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:02:33] [INFO ] [Nat]Added 106 Read/Feed constraints in 10 ms returned sat
[2024-06-01 13:02:33] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 115 transitions) in 7 ms.
[2024-06-01 13:02:33] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 7 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-06-01 13:02:33] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-06-01 13:02:33] [INFO ] Invariant cache hit.
[2024-06-01 13:02:33] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 13:02:33] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-06-01 13:02:33] [INFO ] Invariant cache hit.
[2024-06-01 13:02:33] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 13:02:33] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-01 13:02:33] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2024-06-01 13:02:33] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-06-01 13:02:33] [INFO ] Invariant cache hit.
[2024-06-01 13:02:33] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:02:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:02:35] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 122/143 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 105/148 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:02:36] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:02:36] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 151 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 122/143 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 105/150 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 124/274 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 275 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
After SMT, in 9870ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 9872ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9957 ms. Remains : 21/21 places, 130/130 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 : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 58 steps (0 resets) in 7 ms. (7 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p3))]
[2024-06-01 13:02:44] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-06-01 13:02:44] [INFO ] Invariant cache hit.
[2024-06-01 13:02:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:02:44] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:02:44] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 13:02:44] [INFO ] [Real]Added 106 Read/Feed constraints in 8 ms returned sat
[2024-06-01 13:02:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:02:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:02:44] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 13:02:44] [INFO ] [Nat]Added 106 Read/Feed constraints in 8 ms returned sat
[2024-06-01 13:02:44] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 115 transitions) in 8 ms.
[2024-06-01 13:02:44] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 14285 reset in 292 ms.
Product exploration explored 100000 steps with 14285 reset in 294 ms.
Support contains 7 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-06-01 13:02:45] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-06-01 13:02:45] [INFO ] Invariant cache hit.
[2024-06-01 13:02:45] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 13:02:45] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-06-01 13:02:45] [INFO ] Invariant cache hit.
[2024-06-01 13:02:45] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-01 13:02:45] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 13:02:45] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2024-06-01 13:02:45] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
[2024-06-01 13:02:45] [INFO ] Invariant cache hit.
[2024-06-01 13:02:45] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:02:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:02:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:02:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:02:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:02:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:02:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:02:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 122/143 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 105/148 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:02:47] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 151 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 122/143 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 105/150 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 124/274 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 275 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 23/23 constraints]
After SMT, in 9994ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 9995ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10079 ms. Remains : 21/21 places, 130/130 transitions.
Treatment of property StigmergyElection-PT-06a-LTLFireability-12 finished in 32248 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 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 50 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 50 transition count 195
Applied a total of 6 rules in 4 ms. Remains 50 /53 variables (removed 3) and now considering 195/199 (removed 4) transitions.
[2024-06-01 13:02:55] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
// Phase 1: matrix 188 rows 50 cols
[2024-06-01 13:02:55] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:02:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 13:02:55] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 13:02:55] [INFO ] Invariant cache hit.
[2024-06-01 13:02:55] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-06-01 13:02:55] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-01 13:02:55] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2024-06-01 13:02:55] [INFO ] Invariant cache hit.
[2024-06-01 13:02:55] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:02:56] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:02:57] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 13:02:59] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 229 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9587 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 187/237 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 130/228 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 194/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 423 constraints, problems are : Problem set: 0 solved, 194 unsolved in 17571 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 47/47 constraints]
After SMT, in 27481ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 27483ms
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27574 ms. Remains : 50/53 places, 195/199 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-13 finished in 27677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 50 transition count 184
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 38 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 36 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 36 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 36 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 36 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 35 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 25 transition count 167
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 117 place count 25 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 25 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 135 place count 19 transition count 95
Applied a total of 135 rules in 16 ms. Remains 19 /53 variables (removed 34) and now considering 95/199 (removed 104) transitions.
[2024-06-01 13:03:22] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 13:03:22] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:03:22] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 13:03:22] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:03:22] [INFO ] Invariant cache hit.
[2024-06-01 13:03:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:03:22] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-01 13:03:22] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 13:03:22] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:03:22] [INFO ] Invariant cache hit.
[2024-06-01 13:03:22] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:03:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:24] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:03:24] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:25] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:03:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:03:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7314ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7315ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/53 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7403 ms. Remains : 19/53 places, 95/199 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-15
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-06a-LTLFireability-15 finished in 7487 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((F(p0)&&(X(p0)||p1))))'
Found a Shortening insensitive property : StigmergyElection-PT-06a-LTLFireability-00
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 53 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 53/53 places, 199/199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 196
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 4 place count 50 transition count 184
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 38 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 36 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 36 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 36 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 36 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 35 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 25 transition count 167
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 117 place count 25 transition count 107
Applied a total of 117 rules in 15 ms. Remains 25 /53 variables (removed 28) and now considering 107/199 (removed 92) transitions.
[2024-06-01 13:03:30] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
// Phase 1: matrix 100 rows 25 cols
[2024-06-01 13:03:30] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:03:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 13:03:30] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
[2024-06-01 13:03:30] [INFO ] Invariant cache hit.
[2024-06-01 13:03:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:03:30] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-01 13:03:30] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
[2024-06-01 13:03:30] [INFO ] Invariant cache hit.
[2024-06-01 13:03:30] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 13:03:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:03:30] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:03:30] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 99/124 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 74/114 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 13:03:31] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 116 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 13:03:33] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:03:33] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:03:33] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:03:33] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:03:33] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:03:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:03:33] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:03:33] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:03:33] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 99/124 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 74/124 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 101/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/125 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 226 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3643 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 24/24 constraints]
After SMT, in 6124ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 6126ms
Starting structural reductions in LI_LTL mode, iteration 1 : 25/53 places, 107/199 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6203 ms. Remains : 25/53 places, 107/199 transitions.
Running random walk in product with property : StigmergyElection-PT-06a-LTLFireability-00
Product exploration explored 100000 steps with 14285 reset in 240 ms.
Product exploration explored 100000 steps with 14285 reset in 200 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 : [(AND (NOT p0) p1), (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 82 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 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 74 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:03:37] [INFO ] Flow matrix only has 100 transitions (discarded 7 similar events)
[2024-06-01 13:03:37] [INFO ] Invariant cache hit.
[2024-06-01 13:03:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:03:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:03:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:03:37] [INFO ] [Real]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:03:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:03:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:03:37] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 13:03:37] [INFO ] [Nat]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:03:37] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 88 transitions) in 7 ms.
[2024-06-01 13:03:37] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 107/107 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 25 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 18 place count 19 transition count 95
Applied a total of 18 rules in 6 ms. Remains 19 /25 variables (removed 6) and now considering 95/107 (removed 12) transitions.
[2024-06-01 13:03:37] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
// Phase 1: matrix 88 rows 19 cols
[2024-06-01 13:03:37] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:03:37] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 13:03:37] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:03:37] [INFO ] Invariant cache hit.
[2024-06-01 13:03:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:03:37] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 13:03:37] [INFO ] Redundant transitions in 0 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 13:03:37] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:03:37] [INFO ] Invariant cache hit.
[2024-06-01 13:03:37] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:03:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:03:40] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3217 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7460ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7461ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/25 places, 95/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7534 ms. Remains : 19/25 places, 95/107 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 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 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 109 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2024-06-01 13:03:45] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:03:45] [INFO ] Invariant cache hit.
[2024-06-01 13:03:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:03:45] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:03:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:03:45] [INFO ] [Real]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:03:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:03:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:03:45] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 13:03:45] [INFO ] [Nat]Added 75 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:03:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 82 transitions) in 5 ms.
[2024-06-01 13:03:45] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 197 ms.
Product exploration explored 100000 steps with 14285 reset in 202 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-01 13:03:46] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:03:46] [INFO ] Invariant cache hit.
[2024-06-01 13:03:46] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 13:03:46] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:03:46] [INFO ] Invariant cache hit.
[2024-06-01 13:03:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-01 13:03:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 13:03:46] [INFO ] Redundant transitions in 0 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 13:03:46] [INFO ] Flow matrix only has 88 transitions (discarded 7 similar events)
[2024-06-01 13:03:46] [INFO ] Invariant cache hit.
[2024-06-01 13:03:46] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:03:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:03:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:03:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:03:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:03:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:03:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/106 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 74/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:03:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3427 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 6/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 87/106 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 89/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 1/107 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 224 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 40/40 constraints]
After SMT, in 7818ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7819ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7894 ms. Remains : 19/19 places, 95/95 transitions.
Treatment of property StigmergyElection-PT-06a-LTLFireability-00 finished in 24128 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!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' '!((F(p0)&&F(!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' '!(F((p0||((G(p2)&&p1) U p3))))'
[2024-06-01 13:03:54] [INFO ] Flatten gal took : 17 ms
[2024-06-01 13:03:54] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 13:03:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 199 transitions and 1733 arcs took 5 ms.
Total runtime 316457 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-06a-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-06a-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-06a-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-06a-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-06a-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717247035390

--------------------
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-06a-LTLFireability-00
ltl formula formula --ltl=/tmp/4453/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 53 places, 199 transitions and 1733 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.040 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4453/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4453/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4453/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4453/ltl_0_
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 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 54, there are 287 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: 730
pnml2lts-mc( 0/ 4): unique states count: 730
pnml2lts-mc( 0/ 4): unique transitions count: 12642
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12175
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 776
pnml2lts-mc( 0/ 4): - cum. max stack depth: 51
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 776 states 13776 transitions, fanout: 17.753
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 77600, Transitions per second: 1377600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 10.6 B/state, compr.: 4.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 199 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-06a-LTLFireability-02
ltl formula formula --ltl=/tmp/4453/ltl_1_
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 53 places, 199 transitions and 1733 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.020 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4453/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4453/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4453/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4453/ltl_1_
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 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 54, there are 211 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: 730
pnml2lts-mc( 0/ 4): unique states count: 730
pnml2lts-mc( 0/ 4): unique transitions count: 12642
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12146
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 784
pnml2lts-mc( 0/ 4): - cum. max stack depth: 53
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 784 states 14012 transitions, fanout: 17.872
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 10.6 B/state, compr.: 4.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 199 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-06a-LTLFireability-05
ltl formula formula --ltl=/tmp/4453/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 53 places, 199 transitions and 1733 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.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4453/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4453/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4453/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4453/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 54 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 54, there are 208 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): Accepting cycle FOUND at depth ~22!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 74
pnml2lts-mc( 0/ 4): unique transitions count: 400
pnml2lts-mc( 0/ 4): - self-loop count: 15
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 16
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 77
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 830 transitions, fanout: 9.881
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 15.9 B/state, compr.: 7.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 199 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-06a-LTLFireability-11
ltl formula formula --ltl=/tmp/4453/ltl_3_
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 53 places, 199 transitions and 1733 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.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4453/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4453/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4453/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4453/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 54, there are 225 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: 730
pnml2lts-mc( 0/ 4): unique states count: 730
pnml2lts-mc( 0/ 4): unique transitions count: 12642
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12187
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 773
pnml2lts-mc( 0/ 4): - cum. max stack depth: 54
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 773 states 13731 transitions, fanout: 17.763
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 10.6 B/state, compr.: 4.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 199 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-06a-LTLFireability-12
ltl formula formula --ltl=/tmp/4453/ltl_4_
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 53 places, 199 transitions and 1733 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.040 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4453/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4453/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4453/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4453/ltl_4_
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 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 54, there are 223 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: 730
pnml2lts-mc( 0/ 4): unique states count: 730
pnml2lts-mc( 0/ 4): unique transitions count: 12642
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12196
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 784
pnml2lts-mc( 0/ 4): - cum. max stack depth: 53
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 784 states 13880 transitions, fanout: 17.704
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 78400, Transitions per second: 1388000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 10.6 B/state, compr.: 4.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 199 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-06a"
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-06a, 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-171690532100316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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