Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.3M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717012816204

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 20:00:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 20:00:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:00:17] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2024-05-29 20:00:17] [INFO ] Transformed 114 places.
[2024-05-29 20:00:18] [INFO ] Transformed 6882 transitions.
[2024-05-29 20:00:18] [INFO ] Found NUPN structural information;
[2024-05-29 20:00:18] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 652 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyElection-PT-08a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 664/664 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 99 transition count 641
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 99 transition count 641
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 91 transition count 625
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 91 transition count 625
Applied a total of 46 rules in 41 ms. Remains 91 /114 variables (removed 23) and now considering 625/664 (removed 39) transitions.
[2024-05-29 20:00:18] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
// Phase 1: matrix 616 rows 91 cols
[2024-05-29 20:00:18] [INFO ] Computed 2 invariants in 22 ms
[2024-05-29 20:00:18] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-29 20:00:18] [INFO ] Flow matrix only has 616 transitions (discarded 9 similar events)
[2024-05-29 20:00:18] [INFO ] Invariant cache hit.
[2024-05-29 20:00:18] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 20:00:19] [INFO ] Implicit Places using invariants and state equation in 607 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 852 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/114 places, 625/664 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 74 transition count 609
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 74 transition count 609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 66 transition count 601
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 66 transition count 601
Applied a total of 48 rules in 13 ms. Remains 66 /90 variables (removed 24) and now considering 601/625 (removed 24) transitions.
[2024-05-29 20:00:19] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 20:00:19] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 20:00:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 20:00:19] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:00:19] [INFO ] Invariant cache hit.
[2024-05-29 20:00:19] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:00:19] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/114 places, 601/664 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1206 ms. Remains : 66/114 places, 601/664 transitions.
Support contains 8 out of 66 places after structural reductions.
[2024-05-29 20:00:19] [INFO ] Flatten gal took : 102 ms
[2024-05-29 20:00:19] [INFO ] Flatten gal took : 67 ms
[2024-05-29 20:00:20] [INFO ] Input system was already deterministic with 601 transitions.
Reduction of identical properties reduced properties to check from 6 to 2
RANDOM walk for 68 steps (0 resets) in 20 ms. (3 steps per ms) remains 0/2 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p1||F(G(p1))))||p0))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-05-29 20:00:20] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:00:20] [INFO ] Invariant cache hit.
[2024-05-29 20:00:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 20:00:20] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:00:20] [INFO ] Invariant cache hit.
[2024-05-29 20:00:20] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:00:20] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 20:00:20] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:00:20] [INFO ] Invariant cache hit.
[2024-05-29 20:00:20] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:00:29] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 8 ms to minimize.
[2024-05-29 20:00:29] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 2 ms to minimize.
[2024-05-29 20:00:29] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:00:33] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:00:34] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
[2024-05-29 20:00:34] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:00:34] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:00:34] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:00:34] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-29 20:00:34] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:00:35] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:00:36] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:00:36] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:00:37] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:00:37] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:00:37] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:00:37] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:00:37] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:00:37] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:00:37] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:00:38] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:00:38] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:00:38] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:00:38] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:00:38] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-29 20:00:38] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:00:38] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 3 ms to minimize.
[2024-05-29 20:00:39] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:00:39] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:00:39] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:00:39] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:00:39] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:00:39] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:00:40] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:00:40] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:00:40] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:00:40] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:00:40] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:00:40] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:00:40] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:00:40] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:00:40] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:00:41] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:00:41] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:00:53] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:00:53] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:00:58] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:00:58] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:00:59] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:00:59] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:00:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:01:00] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:01:01] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:01:05] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66772ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66792ms
Finished structural reductions in LTL mode , in 1 iterations and 67019 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-00
Product exploration explored 100000 steps with 1 reset in 286 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 63 in 4 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-00 finished in 67630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 327 place count 33 transition count 305
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 343 place count 25 transition count 297
Applied a total of 343 rules in 130 ms. Remains 25 /66 variables (removed 41) and now considering 297/601 (removed 304) transitions.
[2024-05-29 20:01:28] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-05-29 20:01:28] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 20:01:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 20:01:28] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:01:28] [INFO ] Invariant cache hit.
[2024-05-29 20:01:28] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:01:28] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-29 20:01:28] [INFO ] Redundant transitions in 20 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:01:28] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:01:28] [INFO ] Invariant cache hit.
[2024-05-29 20:01:28] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:01:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:01:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:01:30] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:01:30] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:01:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:01:30] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:01:30] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:01:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:01:30] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:01:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 4 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:01:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:01:33] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:01:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:01:33] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 20:01:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17238 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49056ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49060ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/66 places, 297/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49403 ms. Remains : 25/66 places, 297/601 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-01
Stuttering criterion allowed to conclude after 2421 steps with 268 reset in 66 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-01 finished in 49577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F(p0)))||G(p1))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-05-29 20:02:17] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 20:02:17] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:02:17] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 20:02:17] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:02:17] [INFO ] Invariant cache hit.
[2024-05-29 20:02:17] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:02:17] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 20:02:17] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:02:17] [INFO ] Invariant cache hit.
[2024-05-29 20:02:17] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:02:26] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2024-05-29 20:02:26] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:02:26] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:02:26] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-29 20:02:27] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:02:27] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:02:27] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:02:27] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:02:27] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:02:27] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:02:27] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-29 20:02:27] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:02:27] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:02:28] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:02:29] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:02:29] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:02:29] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:02:29] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:02:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:02:29] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:02:29] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:02:29] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:02:30] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:02:30] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:02:31] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:02:31] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:02:31] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:02:31] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:02:32] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:02:32] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:02:32] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:02:33] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:02:33] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:02:34] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:02:35] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:02:35] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:02:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:02:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:02:36] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:02:38] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:02:38] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:02:50] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:02:50] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:02:55] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:02:55] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:02:55] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:02:56] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:02:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:02:57] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:02:58] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:03:02] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66516ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66522ms
Finished structural reductions in LTL mode , in 1 iterations and 66734 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-02
Product exploration explored 100000 steps with 5555 reset in 656 ms.
Product exploration explored 100000 steps with 5555 reset in 660 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (21 resets) in 2368 ms. (16 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (15 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
[2024-05-29 20:03:26] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:03:26] [INFO ] Invariant cache hit.
[2024-05-29 20:03:26] [INFO ] State equation strengthened by 517 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 591/657 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 516/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/658 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/658 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 584 constraints, problems are : Problem set: 0 solved, 1 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 517/517 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 66/658 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/66 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 630ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 10 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08a-LTLFireability-02 finished in 69713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&G(F(p1))))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 327 place count 33 transition count 305
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 343 place count 25 transition count 297
Applied a total of 343 rules in 90 ms. Remains 25 /66 variables (removed 41) and now considering 297/601 (removed 304) transitions.
[2024-05-29 20:03:27] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-05-29 20:03:27] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 20:03:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 20:03:27] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:03:27] [INFO ] Invariant cache hit.
[2024-05-29 20:03:27] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:03:27] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-29 20:03:27] [INFO ] Redundant transitions in 8 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:03:27] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:03:27] [INFO ] Invariant cache hit.
[2024-05-29 20:03:27] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:03:29] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:03:30] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:03:31] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:03:32] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:03:32] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:03:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:03:32] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 18038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49540ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49543ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/66 places, 297/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49788 ms. Remains : 25/66 places, 297/601 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-03
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-03 finished in 49941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(!p0)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-05-29 20:04:17] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 20:04:17] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 20:04:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 20:04:17] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:04:17] [INFO ] Invariant cache hit.
[2024-05-29 20:04:17] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:04:17] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 20:04:17] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:04:17] [INFO ] Invariant cache hit.
[2024-05-29 20:04:17] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:04:26] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:04:26] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2024-05-29 20:04:26] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:04:26] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:04:26] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:04:27] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:04:27] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 20:04:27] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 20:04:27] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-29 20:04:27] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:04:27] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:04:27] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:04:27] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:04:28] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:04:29] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:04:29] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:04:29] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:04:29] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:04:29] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:04:29] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:04:29] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:04:29] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:04:29] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 2 ms to minimize.
[2024-05-29 20:04:30] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:04:31] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:04:31] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:04:31] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:04:31] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:04:31] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:04:31] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:04:32] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:04:32] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:04:32] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:04:34] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:04:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:04:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:04:36] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:04:37] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:04:37] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:04:37] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:04:37] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:04:38] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:04:38] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:04:50] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:04:50] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:04:55] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:04:56] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:04:56] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:04:56] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:04:56] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:04:57] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:04:58] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:05:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66968ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66976ms
Finished structural reductions in LTL mode , in 1 iterations and 67200 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, p0, (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-04
Product exploration explored 100000 steps with 9952 reset in 632 ms.
Product exploration explored 100000 steps with 9838 reset in 643 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 68 steps (0 resets) in 7 ms. (8 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 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-29 20:05:26] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:05:26] [INFO ] Invariant cache hit.
[2024-05-29 20:05:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 20:05:26] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-29 20:05:26] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:05:26] [INFO ] [Real]Added 517 Read/Feed constraints in 49 ms returned sat
[2024-05-29 20:05:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:05:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 20:05:27] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-29 20:05:27] [INFO ] [Nat]Added 517 Read/Feed constraints in 51 ms returned sat
[2024-05-29 20:05:27] [INFO ] Computed and/alt/rep : 56/64/56 causal constraints (skipped 535 transitions) in 82 ms.
[2024-05-29 20:05:27] [INFO ] Added : 29 causal constraints over 6 iterations in 386 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 327 place count 33 transition count 305
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 343 place count 25 transition count 297
Applied a total of 343 rules in 60 ms. Remains 25 /66 variables (removed 41) and now considering 297/601 (removed 304) transitions.
[2024-05-29 20:05:27] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-05-29 20:05:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 20:05:27] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 20:05:27] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:05:27] [INFO ] Invariant cache hit.
[2024-05-29 20:05:27] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:05:27] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-29 20:05:27] [INFO ] Redundant transitions in 9 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:05:27] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:05:27] [INFO ] Invariant cache hit.
[2024-05-29 20:05:27] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:05:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:05:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:05:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:05:29] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:05:29] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:05:29] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:05:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:05:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:05:32] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:05:32] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:05:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:05:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17322 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48755ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48758ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/66 places, 297/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49066 ms. Remains : 25/66 places, 297/601 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 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 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-29 20:06:16] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:06:16] [INFO ] Invariant cache hit.
[2024-05-29 20:06:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 20:06:17] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-29 20:06:17] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:06:17] [INFO ] [Real]Added 271 Read/Feed constraints in 27 ms returned sat
[2024-05-29 20:06:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:06:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 20:06:17] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-29 20:06:17] [INFO ] [Nat]Added 271 Read/Feed constraints in 34 ms returned sat
[2024-05-29 20:06:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 26 ms.
[2024-05-29 20:06:17] [INFO ] Added : 0 causal constraints over 0 iterations in 53 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 707 ms.
Product exploration explored 100000 steps with 11111 reset in 716 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 16 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-29 20:06:18] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:06:18] [INFO ] Invariant cache hit.
[2024-05-29 20:06:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 20:06:18] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:06:18] [INFO ] Invariant cache hit.
[2024-05-29 20:06:18] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:06:19] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-29 20:06:19] [INFO ] Redundant transitions in 7 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:06:19] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:06:19] [INFO ] Invariant cache hit.
[2024-05-29 20:06:19] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:06:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:06:23] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:06:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:06:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:06:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:06:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:06:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:06:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48553ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48558ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48721 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyElection-PT-08a-LTLFireability-04 finished in 170568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-05-29 20:07:07] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 20:07:07] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:07:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 20:07:07] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:07:07] [INFO ] Invariant cache hit.
[2024-05-29 20:07:07] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:07:07] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 20:07:07] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:07:07] [INFO ] Invariant cache hit.
[2024-05-29 20:07:07] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-29 20:07:16] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:07:17] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:07:18] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:07:19] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:07:19] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:07:19] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:07:20] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:07:20] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:07:20] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:07:20] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:07:20] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:07:20] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:07:21] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:07:22] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:07:22] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:07:23] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:07:23] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:07:23] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:07:23] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:07:23] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:07:23] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:07:23] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:07:23] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:07:23] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:07:23] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:07:24] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:07:24] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:07:24] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:07:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:07:25] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:07:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:07:25] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:07:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:07:25] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:07:25] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:07:25] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:07:25] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:07:25] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:07:26] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:07:26] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 5 ms to minimize.
[2024-05-29 20:07:26] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:07:26] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:07:26] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:07:26] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:07:27] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:07:27] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:07:39] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:07:39] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:07:45] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:07:45] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:07:45] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 20:07:45] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:07:46] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:07:47] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:07:48] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:07:52] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66049ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66058ms
Finished structural reductions in LTL mode , in 1 iterations and 66263 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-06
Product exploration explored 100000 steps with 5555 reset in 685 ms.
Product exploration explored 100000 steps with 5555 reset in 694 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 68 steps (0 resets) in 7 ms. (8 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 119 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-05-29 20:08:15] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:08:15] [INFO ] Invariant cache hit.
[2024-05-29 20:08:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 20:08:16] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-29 20:08:16] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:08:16] [INFO ] [Real]Added 517 Read/Feed constraints in 47 ms returned sat
[2024-05-29 20:08:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:08:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 20:08:16] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-29 20:08:16] [INFO ] [Nat]Added 517 Read/Feed constraints in 51 ms returned sat
[2024-05-29 20:08:16] [INFO ] Computed and/alt/rep : 56/64/56 causal constraints (skipped 535 transitions) in 42 ms.
[2024-05-29 20:08:17] [INFO ] Added : 29 causal constraints over 6 iterations in 324 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 327 place count 33 transition count 305
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 343 place count 25 transition count 297
Applied a total of 343 rules in 57 ms. Remains 25 /66 variables (removed 41) and now considering 297/601 (removed 304) transitions.
[2024-05-29 20:08:17] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-05-29 20:08:17] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:08:17] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 20:08:17] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:08:17] [INFO ] Invariant cache hit.
[2024-05-29 20:08:17] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:08:17] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-29 20:08:17] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:08:17] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:08:17] [INFO ] Invariant cache hit.
[2024-05-29 20:08:17] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:08:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:08:20] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:08:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:08:21] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:08:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:08:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:08:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:08:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:08:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:08:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 18252 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49635ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49639ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/66 places, 297/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49838 ms. Remains : 25/66 places, 297/601 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 6 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 114 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-05-29 20:09:07] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:09:07] [INFO ] Invariant cache hit.
[2024-05-29 20:09:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 20:09:07] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-29 20:09:07] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:09:07] [INFO ] [Real]Added 271 Read/Feed constraints in 32 ms returned sat
[2024-05-29 20:09:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:09:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 20:09:07] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-29 20:09:07] [INFO ] [Nat]Added 271 Read/Feed constraints in 34 ms returned sat
[2024-05-29 20:09:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 21 ms.
[2024-05-29 20:09:07] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 720 ms.
Product exploration explored 100000 steps with 11111 reset in 711 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 15 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-29 20:09:09] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:09:09] [INFO ] Invariant cache hit.
[2024-05-29 20:09:09] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 20:09:09] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:09:09] [INFO ] Invariant cache hit.
[2024-05-29 20:09:09] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:09:09] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-29 20:09:09] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:09:09] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:09:09] [INFO ] Invariant cache hit.
[2024-05-29 20:09:09] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:09:11] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:09:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:09:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:09:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:09:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:09:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:09:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17519 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49081ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49084ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49216 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyElection-PT-08a-LTLFireability-06 finished in 170988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(((F(G(p0))||G(!p0)) U ((F(G(p0))||G(!p0))&&p1)))))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-05-29 20:09:58] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 20:09:58] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:09:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 20:09:58] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:09:58] [INFO ] Invariant cache hit.
[2024-05-29 20:09:58] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:09:58] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 20:09:58] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:09:58] [INFO ] Invariant cache hit.
[2024-05-29 20:09:58] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:10:06] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:10:07] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:10:07] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:10:07] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 20:10:07] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-29 20:10:07] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 20:10:07] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:10:07] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:10:07] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:10:08] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:10:09] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:10:10] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:10:10] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:10:11] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:10:11] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:10:11] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:10:11] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:10:11] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:10:11] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:10:12] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:10:13] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:10:13] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:10:14] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:10:14] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:10:14] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:10:14] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:10:14] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:10:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:10:14] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:10:14] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:10:14] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:10:15] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:10:15] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:10:15] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:10:15] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:10:15] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:10:16] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:10:17] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:10:17] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:10:17] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:10:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:10:17] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:10:18] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:10:18] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:10:30] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:10:30] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:10:36] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 20:10:36] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:10:36] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:10:36] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:10:36] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:10:38] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:10:39] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:10:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66011ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66018ms
Finished structural reductions in LTL mode , in 1 iterations and 66212 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-07
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-07 finished in 66467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p1)&&p0))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-05-29 20:11:05] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:11:05] [INFO ] Invariant cache hit.
[2024-05-29 20:11:05] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 20:11:05] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:11:05] [INFO ] Invariant cache hit.
[2024-05-29 20:11:05] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:11:05] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 20:11:05] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:11:05] [INFO ] Invariant cache hit.
[2024-05-29 20:11:05] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:11:14] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:11:14] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2024-05-29 20:11:14] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:11:14] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 20:11:15] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 20:11:15] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:11:15] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:11:15] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-29 20:11:15] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:11:15] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:11:15] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:11:15] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-29 20:11:16] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:11:16] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:11:16] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:11:16] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:11:16] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 20:11:16] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:11:16] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:11:16] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:11:16] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:11:16] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:11:17] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:11:19] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:11:19] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:11:19] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:11:19] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:11:19] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:11:19] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:11:20] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:11:20] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:11:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:11:22] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:11:24] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:11:25] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:11:25] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:11:26] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:11:26] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:11:38] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:11:38] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:11:43] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:11:43] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:11:44] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:11:44] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:11:44] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:11:45] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:11:46] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:11:50] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66888ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66895ms
Finished structural reductions in LTL mode , in 1 iterations and 67097 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-08
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-08 finished in 67245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-05-29 20:12:12] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:12:12] [INFO ] Invariant cache hit.
[2024-05-29 20:12:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 20:12:12] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:12:12] [INFO ] Invariant cache hit.
[2024-05-29 20:12:12] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:12:12] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 20:12:12] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:12:12] [INFO ] Invariant cache hit.
[2024-05-29 20:12:12] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:12:20] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:12:20] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:12:20] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 20:12:20] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:12:21] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:12:21] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:12:21] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 20:12:21] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:12:21] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 20:12:21] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:12:21] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:12:21] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:12:21] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:12:22] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:12:23] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:12:23] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:12:23] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:12:23] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:12:23] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:12:23] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:12:23] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-29 20:12:23] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:12:24] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:12:24] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:12:25] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:12:25] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:12:25] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:12:25] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:12:26] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:12:26] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:12:26] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:12:27] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:12:27] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:12:28] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:12:29] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:12:29] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:12:30] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:12:32] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:12:32] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:12:44] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:12:44] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:12:49] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:12:50] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:12:50] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:12:50] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:12:50] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:12:52] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:12:52] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 65825ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 65831ms
Finished structural reductions in LTL mode , in 1 iterations and 66031 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08a-LTLFireability-09 finished in 66398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-05-29 20:13:18] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:13:18] [INFO ] Invariant cache hit.
[2024-05-29 20:13:18] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 20:13:18] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:13:18] [INFO ] Invariant cache hit.
[2024-05-29 20:13:19] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:13:19] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 20:13:19] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:13:19] [INFO ] Invariant cache hit.
[2024-05-29 20:13:19] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 3 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:13:33] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:13:33] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:13:33] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:13:34] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:13:34] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:13:34] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:13:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:13:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:13:34] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:13:35] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:13:35] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:13:35] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:13:35] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:13:35] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:13:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:13:35] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:13:35] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:13:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:13:38] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:13:51] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:13:51] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:13:56] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:13:56] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:13:56] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:13:57] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:13:57] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:13:58] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:13:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:14:03] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66007ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66014ms
Finished structural reductions in LTL mode , in 1 iterations and 66218 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 133 ms :[p0, p0, p0]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 112 ms.
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08a-LTLFireability-11 finished in 66615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-05-29 20:14:25] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:14:25] [INFO ] Invariant cache hit.
[2024-05-29 20:14:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 20:14:25] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:14:25] [INFO ] Invariant cache hit.
[2024-05-29 20:14:25] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:14:25] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 20:14:25] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:14:25] [INFO ] Invariant cache hit.
[2024-05-29 20:14:25] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:14:34] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2024-05-29 20:14:34] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2024-05-29 20:14:35] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:14:35] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 20:14:35] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:14:35] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 20:14:35] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-29 20:14:35] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:14:35] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:14:35] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2024-05-29 20:14:35] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:14:36] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:14:36] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:14:36] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:14:36] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:14:36] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:14:36] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:14:36] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:14:36] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:14:36] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:14:36] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:14:37] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:14:38] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:14:38] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:14:39] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:14:39] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:14:39] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:14:39] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:14:39] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:14:39] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:14:40] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:14:41] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:14:41] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:14:42] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:14:42] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:14:42] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:14:42] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:14:42] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:14:43] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:14:43] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:14:43] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:14:43] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:14:43] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:14:43] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:14:43] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:14:43] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:14:43] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:14:44] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:14:44] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:14:44] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:14:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:14:44] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:14:44] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:14:45] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:14:45] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
[2024-05-29 20:14:45] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:14:45] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:14:45] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:14:45] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:14:45] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:14:45] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:14:45] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:14:46] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:14:46] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:14:59] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:14:59] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:15:04] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:15:04] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:15:04] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:15:04] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:15:04] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:15:06] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:15:06] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:15:11] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 600/1267 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 66860ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 66867ms
Finished structural reductions in LTL mode , in 1 iterations and 67077 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-13 finished in 67193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 327 place count 33 transition count 305
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 343 place count 25 transition count 297
Applied a total of 343 rules in 55 ms. Remains 25 /66 variables (removed 41) and now considering 297/601 (removed 304) transitions.
[2024-05-29 20:15:32] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-05-29 20:15:32] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 20:15:32] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 20:15:32] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:15:32] [INFO ] Invariant cache hit.
[2024-05-29 20:15:32] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:15:32] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-29 20:15:32] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:15:32] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:15:32] [INFO ] Invariant cache hit.
[2024-05-29 20:15:32] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:15:38] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:15:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17995 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49399ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49403ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/66 places, 297/601 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49593 ms. Remains : 25/66 places, 297/601 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-14
Product exploration explored 100000 steps with 11111 reset in 707 ms.
Product exploration explored 100000 steps with 11111 reset in 717 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 93 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 48 ms :[(NOT p0)]
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-05-29 20:16:24] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:16:24] [INFO ] Invariant cache hit.
[2024-05-29 20:16:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 20:16:24] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-29 20:16:24] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:16:24] [INFO ] [Real]Added 271 Read/Feed constraints in 29 ms returned sat
[2024-05-29 20:16:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:16:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 20:16:24] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-29 20:16:24] [INFO ] [Nat]Added 271 Read/Feed constraints in 37 ms returned sat
[2024-05-29 20:16:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 21 ms.
[2024-05-29 20:16:24] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 17 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-29 20:16:24] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:16:24] [INFO ] Invariant cache hit.
[2024-05-29 20:16:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 20:16:24] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:16:24] [INFO ] Invariant cache hit.
[2024-05-29 20:16:24] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:16:24] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-29 20:16:24] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:16:24] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:16:24] [INFO ] Invariant cache hit.
[2024-05-29 20:16:24] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:16:26] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:16:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:16:28] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:16:29] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:16:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:16:29] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:16:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17324 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48712ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48715ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48862 ms. Remains : 25/25 places, 297/297 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 32 steps (0 resets) in 6 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 118 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)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-29 20:17:13] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:17:13] [INFO ] Invariant cache hit.
[2024-05-29 20:17:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 20:17:13] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-29 20:17:13] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:17:14] [INFO ] [Real]Added 271 Read/Feed constraints in 26 ms returned sat
[2024-05-29 20:17:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:17:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 20:17:14] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-29 20:17:14] [INFO ] [Nat]Added 271 Read/Feed constraints in 34 ms returned sat
[2024-05-29 20:17:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 21 ms.
[2024-05-29 20:17:14] [INFO ] Added : 0 causal constraints over 0 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 708 ms.
Product exploration explored 100000 steps with 11111 reset in 713 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 27 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-29 20:17:15] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:17:15] [INFO ] Invariant cache hit.
[2024-05-29 20:17:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 20:17:15] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:17:15] [INFO ] Invariant cache hit.
[2024-05-29 20:17:15] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:17:15] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-29 20:17:15] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:17:15] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:17:15] [INFO ] Invariant cache hit.
[2024-05-29 20:17:15] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:17:21] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:17:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17875 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49568ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49572ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49731 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyElection-PT-08a-LTLFireability-14 finished in 152851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2024-05-29 20:18:05] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
// Phase 1: matrix 592 rows 66 cols
[2024-05-29 20:18:05] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:18:05] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 20:18:05] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:18:05] [INFO ] Invariant cache hit.
[2024-05-29 20:18:05] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:18:05] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 20:18:05] [INFO ] Flow matrix only has 592 transitions (discarded 9 similar events)
[2024-05-29 20:18:05] [INFO ] Invariant cache hit.
[2024-05-29 20:18:05] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:18:13] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-05-29 20:18:13] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:18:13] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:18:13] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:18:14] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:18:14] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:18:14] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:18:14] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:18:14] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-29 20:18:14] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:18:14] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:18:14] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:18:15] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:18:16] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:18:16] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:18:16] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:18:16] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:18:16] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:18:16] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:18:16] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:18:16] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:18:16] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:18:16] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:18:17] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:18:18] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:18:19] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:18:19] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:18:19] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:18:21] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:18:22] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:18:23] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:18:24] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:18:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:18:24] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:18:25] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:18:25] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (OVERLAPS) 591/657 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 516/657 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/658 variables, and 659 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:18:43] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:18:43] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:18:43] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:18:43] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:18:43] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:18:45] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:18:45] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 20:18:49] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (OVERLAPS) 591/657 variables, 66/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 1267 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 84/84 constraints]
After SMT, in 65916ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 65922ms
Finished structural reductions in LTL mode , in 1 iterations and 66126 ms. Remains : 66/66 places, 601/601 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, p0, p0]
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLFireability-15 finished in 66252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : StigmergyElection-PT-08a-LTLFireability-06
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 66/66 places, 601/601 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 65 transition count 584
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 49 transition count 584
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 33 transition count 568
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 319 place count 33 transition count 313
Applied a total of 319 rules in 28 ms. Remains 33 /66 variables (removed 33) and now considering 313/601 (removed 288) transitions.
[2024-05-29 20:19:12] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
// Phase 1: matrix 304 rows 33 cols
[2024-05-29 20:19:12] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 20:19:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 20:19:12] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-05-29 20:19:12] [INFO ] Invariant cache hit.
[2024-05-29 20:19:12] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:19:12] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-05-29 20:19:12] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-05-29 20:19:12] [INFO ] Invariant cache hit.
[2024-05-29 20:19:12] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:19:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-29 20:19:15] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:19:16] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 303/336 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 270/338 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-29 20:19:21] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-29 20:19:24] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (OVERLAPS) 0/337 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 341 constraints, problems are : Problem set: 0 solved, 305 unsolved in 17550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:19:32] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 303/336 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 270/352 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 305/657 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 1/337 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 658 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 48/48 constraints]
After SMT, in 49345ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 49348ms
Starting structural reductions in LI_LTL mode, iteration 1 : 33/66 places, 313/601 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 49522 ms. Remains : 33/66 places, 313/601 transitions.
Running random walk in product with property : StigmergyElection-PT-08a-LTLFireability-06
Product exploration explored 100000 steps with 11111 reset in 701 ms.
Product exploration explored 100000 steps with 11111 reset in 722 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 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 82 ms :[(NOT p0), (NOT p0)]
[2024-05-29 20:20:03] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-05-29 20:20:03] [INFO ] Invariant cache hit.
[2024-05-29 20:20:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 20:20:03] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-29 20:20:03] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:20:03] [INFO ] [Real]Added 271 Read/Feed constraints in 24 ms returned sat
[2024-05-29 20:20:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:20:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 20:20:04] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-29 20:20:04] [INFO ] [Nat]Added 271 Read/Feed constraints in 24 ms returned sat
[2024-05-29 20:20:04] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 288 transitions) in 20 ms.
[2024-05-29 20:20:04] [INFO ] Added : 0 causal constraints over 0 iterations in 47 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 313/313 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 305
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 25 transition count 297
Applied a total of 24 rules in 32 ms. Remains 25 /33 variables (removed 8) and now considering 297/313 (removed 16) transitions.
[2024-05-29 20:20:04] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-05-29 20:20:04] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:20:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 20:20:04] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:20:04] [INFO ] Invariant cache hit.
[2024-05-29 20:20:04] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:20:04] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-29 20:20:04] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:20:04] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:20:04] [INFO ] Invariant cache hit.
[2024-05-29 20:20:04] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:20:06] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:20:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:20:08] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:20:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:20:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 20:20:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:20:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:20:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:20:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:20:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17506 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48974ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48977ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 297/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49142 ms. Remains : 25/33 places, 297/313 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 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 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
[2024-05-29 20:20:53] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:20:53] [INFO ] Invariant cache hit.
[2024-05-29 20:20:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 20:20:53] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-29 20:20:53] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:20:53] [INFO ] [Real]Added 271 Read/Feed constraints in 27 ms returned sat
[2024-05-29 20:20:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:20:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 20:20:54] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-29 20:20:54] [INFO ] [Nat]Added 271 Read/Feed constraints in 34 ms returned sat
[2024-05-29 20:20:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 20 ms.
[2024-05-29 20:20:54] [INFO ] Added : 0 causal constraints over 0 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 717 ms.
Product exploration explored 100000 steps with 11111 reset in 728 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 17 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-29 20:20:55] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:20:55] [INFO ] Invariant cache hit.
[2024-05-29 20:20:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 20:20:55] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:20:55] [INFO ] Invariant cache hit.
[2024-05-29 20:20:55] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-29 20:20:55] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-29 20:20:55] [INFO ] Redundant transitions in 3 ms returned []
Running 289 sub problems to find dead transitions.
[2024-05-29 20:20:55] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-05-29 20:20:55] [INFO ] Invariant cache hit.
[2024-05-29 20:20:55] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:20:58] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:21:00] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:21:00] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:21:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 20:21:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:21:00] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:21:00] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-29 20:21:01] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:21:01] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48608ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48612ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48762 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyElection-PT-08a-LTLFireability-06 finished in 152612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-29 20:21:44] [INFO ] Flatten gal took : 61 ms
[2024-05-29 20:21:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-29 20:21:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 601 transitions and 8475 arcs took 15 ms.
Total runtime 1287413 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-08a

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 5791
MODEL NAME: /home/mcc/execution/411/model
66 places, 601 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyElection-PT-08a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-08a-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-08a-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717014108294

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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