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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 14K Apr 11 19:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 19:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 1.8M 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-07a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717011820160

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-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:43:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:43:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:43:41] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-05-29 19:43:41] [INFO ] Transformed 100 places.
[2024-05-29 19:43:41] [INFO ] Transformed 2618 transitions.
[2024-05-29 19:43:41] [INFO ] Found NUPN structural information;
[2024-05-29 19:43:41] [INFO ] Parsed PT model containing 100 places and 2618 transitions and 34799 arcs in 343 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 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyElection-PT-07a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 389/389 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 89 transition count 373
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 89 transition count 373
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 84 transition count 363
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 84 transition count 363
Applied a total of 32 rules in 30 ms. Remains 84 /100 variables (removed 16) and now considering 363/389 (removed 26) transitions.
[2024-05-29 19:43:41] [INFO ] Flow matrix only has 353 transitions (discarded 10 similar events)
// Phase 1: matrix 353 rows 84 cols
[2024-05-29 19:43:41] [INFO ] Computed 2 invariants in 19 ms
[2024-05-29 19:43:42] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-29 19:43:42] [INFO ] Flow matrix only has 353 transitions (discarded 10 similar events)
[2024-05-29 19:43:42] [INFO ] Invariant cache hit.
[2024-05-29 19:43:42] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:43:42] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-05-29 19:43:42] [INFO ] Flow matrix only has 353 transitions (discarded 10 similar events)
[2024-05-29 19:43:42] [INFO ] Invariant cache hit.
[2024-05-29 19:43:42] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:43:45] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 8 ms to minimize.
[2024-05-29 19:43:45] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:43:45] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:43:45] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:43:46] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 4 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:43:48] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 6 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:43:50] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:43:51] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:43:52] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:43:52] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:43:52] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:43:52] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:43:52] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:43:52] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:43:53] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:43:53] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:43:53] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:43:54] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:43:54] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:43:54] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:43:54] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:43:55] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:43:55] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:43:55] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:43:56] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 11 (OVERLAPS) 352/436 variables, 84/183 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 287/470 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:44:03] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:44:03] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:44:04] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 15 (OVERLAPS) 1/437 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/437 variables, and 474 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-05-29 19:44:18] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 352/436 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 287/474 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 362/836 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 362 unsolved
SMT process timed out in 61814ms, After SMT, problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 61832ms
Starting structural reductions in LTL mode, iteration 1 : 84/100 places, 363/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62364 ms. Remains : 84/100 places, 363/389 transitions.
Support contains 14 out of 84 places after structural reductions.
[2024-05-29 19:44:44] [INFO ] Flatten gal took : 72 ms
[2024-05-29 19:44:44] [INFO ] Flatten gal took : 45 ms
[2024-05-29 19:44:44] [INFO ] Input system was already deterministic with 363 transitions.
Reduction of identical properties reduced properties to check from 11 to 8
RANDOM walk for 40000 steps (48 resets) in 3040 ms. (13 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (15 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
[2024-05-29 19:44:45] [INFO ] Flow matrix only has 353 transitions (discarded 10 similar events)
[2024-05-29 19:44:45] [INFO ] Invariant cache hit.
[2024-05-29 19:44:45] [INFO ] State equation strengthened by 288 read => feed constraints.
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 7/437 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/84 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyElection-PT-07a-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyElection-PT-07a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 15 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(p0)))'
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 348
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 348
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 68 transition count 337
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 57 transition count 337
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 65 place count 43 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 79 place count 43 transition count 321
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 110 place count 43 transition count 290
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 110 place count 43 transition count 285
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 120 place count 38 transition count 285
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 36 transition count 281
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 36 transition count 281
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 220 place count 36 transition count 185
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 234 place count 29 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 241 place count 29 transition count 171
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 255 place count 22 transition count 164
Applied a total of 255 rules in 82 ms. Remains 22 /84 variables (removed 62) and now considering 164/363 (removed 199) transitions.
[2024-05-29 19:44:45] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
// Phase 1: matrix 156 rows 22 cols
[2024-05-29 19:44:45] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:44:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 19:44:45] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:44:45] [INFO ] Invariant cache hit.
[2024-05-29 19:44:45] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:44:45] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-29 19:44:46] [INFO ] Redundant transitions in 7 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 19:44:46] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:44:46] [INFO ] Invariant cache hit.
[2024-05-29 19:44:46] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:44:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:44:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:44:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:44:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:44:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:44:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:44:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:44:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:44:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:44:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:44:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:44:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5633 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:44:52] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:44:52] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:44:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12401 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 18550ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 18552ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/84 places, 164/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18737 ms. Remains : 22/84 places, 164/363 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-00
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-07a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLFireability-00 finished in 18968 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 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 348
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 348
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 68 transition count 337
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 57 transition count 337
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 65 place count 43 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 79 place count 43 transition count 321
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 110 place count 43 transition count 290
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 110 place count 43 transition count 285
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 120 place count 38 transition count 285
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 36 transition count 281
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 36 transition count 281
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 220 place count 36 transition count 185
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 234 place count 29 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 241 place count 29 transition count 171
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 255 place count 22 transition count 164
Applied a total of 255 rules in 40 ms. Remains 22 /84 variables (removed 62) and now considering 164/363 (removed 199) transitions.
[2024-05-29 19:45:04] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:45:04] [INFO ] Invariant cache hit.
[2024-05-29 19:45:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 19:45:04] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:45:04] [INFO ] Invariant cache hit.
[2024-05-29 19:45:04] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:45:04] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-29 19:45:04] [INFO ] Redundant transitions in 5 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 19:45:04] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:45:04] [INFO ] Invariant cache hit.
[2024-05-29 19:45:04] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:45:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:45:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:45:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 7416 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:45:13] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:45:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:45:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12503 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 20323ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 20326ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/84 places, 164/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20461 ms. Remains : 22/84 places, 164/363 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-01
Stuttering criterion allowed to conclude after 148 steps with 17 reset in 10 ms.
FORMULA StigmergyElection-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLFireability-01 finished in 20566 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 9 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 84 transition count 354
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 75 transition count 354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 73 transition count 350
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 350
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 71 transition count 346
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 71 transition count 346
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 70 transition count 345
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 70 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 70 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 53 place count 58 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 53 transition count 327
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 53 transition count 327
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 53 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 132 place count 53 transition count 258
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 146 place count 46 transition count 251
Applied a total of 146 rules in 56 ms. Remains 46 /84 variables (removed 38) and now considering 251/363 (removed 112) transitions.
[2024-05-29 19:45:25] [INFO ] Flow matrix only has 243 transitions (discarded 8 similar events)
// Phase 1: matrix 243 rows 46 cols
[2024-05-29 19:45:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 19:45:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 19:45:25] [INFO ] Flow matrix only has 243 transitions (discarded 8 similar events)
[2024-05-29 19:45:25] [INFO ] Invariant cache hit.
[2024-05-29 19:45:25] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-05-29 19:45:25] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-29 19:45:25] [INFO ] Redundant transitions in 19 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-29 19:45:25] [INFO ] Flow matrix only has 243 transitions (discarded 8 similar events)
[2024-05-29 19:45:25] [INFO ] Invariant cache hit.
[2024-05-29 19:45:25] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:45:27] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 3 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:45:28] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:45:29] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:45:30] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:45:30] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:45:30] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:45:30] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:45:30] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:45:30] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:45:30] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:45:30] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:45:30] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:45:31] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:45:31] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:45:31] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:45:31] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:45:31] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:45:31] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 242/288 variables, 46/105 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 225/330 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (OVERLAPS) 1/289 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (OVERLAPS) 0/289 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 331 constraints, problems are : Problem set: 0 solved, 250 unsolved in 16766 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:45:44] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 242/288 variables, 46/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 225/331 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 250/581 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 1/289 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 582 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 58/58 constraints]
After SMT, in 47707ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 47710ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/84 places, 251/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47975 ms. Remains : 46/84 places, 251/363 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-04
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-07a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLFireability-04 finished in 48149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 82 transition count 359
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 359
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 80 transition count 355
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 12 ms. Remains 80 /84 variables (removed 4) and now considering 355/363 (removed 8) transitions.
[2024-05-29 19:46:13] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:46:13] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 19:46:13] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 19:46:13] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:46:13] [INFO ] Invariant cache hit.
[2024-05-29 19:46:13] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:46:13] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 275 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/363 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 11 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:46:13] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:46:13] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:46:13] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 19:46:13] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:46:13] [INFO ] Invariant cache hit.
[2024-05-29 19:46:13] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:46:13] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/363 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 418 ms. Remains : 58/84 places, 334/363 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-07a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLFireability-05 finished in 540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 348
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 348
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 68 transition count 337
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 57 transition count 337
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 65 place count 43 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 79 place count 43 transition count 321
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 110 place count 43 transition count 290
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 110 place count 43 transition count 285
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 120 place count 38 transition count 285
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 36 transition count 281
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 36 transition count 281
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 220 place count 36 transition count 185
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 234 place count 29 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 241 place count 29 transition count 171
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 255 place count 22 transition count 164
Applied a total of 255 rules in 58 ms. Remains 22 /84 variables (removed 62) and now considering 164/363 (removed 199) transitions.
[2024-05-29 19:46:14] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
// Phase 1: matrix 156 rows 22 cols
[2024-05-29 19:46:14] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 19:46:14] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 19:46:14] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:46:14] [INFO ] Invariant cache hit.
[2024-05-29 19:46:14] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:46:14] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-29 19:46:14] [INFO ] Redundant transitions in 3 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 19:46:14] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:46:14] [INFO ] Invariant cache hit.
[2024-05-29 19:46:14] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:46:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:46:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:46:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:46:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:46:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5237 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:46:20] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:46:20] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:46:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12005 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 17719ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 17721ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/84 places, 164/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17875 ms. Remains : 22/84 places, 164/363 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-06
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-07a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLFireability-06 finished in 17932 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' '!(((p0||X(p1)) U p2))'
Support contains 9 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 83 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 83 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 82 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 82 transition count 359
Applied a total of 4 rules in 8 ms. Remains 82 /84 variables (removed 2) and now considering 359/363 (removed 4) transitions.
[2024-05-29 19:46:31] [INFO ] Flow matrix only has 350 transitions (discarded 9 similar events)
// Phase 1: matrix 350 rows 82 cols
[2024-05-29 19:46:31] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 19:46:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 19:46:32] [INFO ] Flow matrix only has 350 transitions (discarded 9 similar events)
[2024-05-29 19:46:32] [INFO ] Invariant cache hit.
[2024-05-29 19:46:32] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:46:32] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 274 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 359/363 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 347
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 62 transition count 340
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 62 transition count 340
Applied a total of 38 rules in 4 ms. Remains 62 /81 variables (removed 19) and now considering 340/359 (removed 19) transitions.
[2024-05-29 19:46:32] [INFO ] Flow matrix only has 331 transitions (discarded 9 similar events)
// Phase 1: matrix 331 rows 62 cols
[2024-05-29 19:46:32] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:46:32] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 19:46:32] [INFO ] Flow matrix only has 331 transitions (discarded 9 similar events)
[2024-05-29 19:46:32] [INFO ] Invariant cache hit.
[2024-05-29 19:46:32] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:46:32] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 62/84 places, 340/363 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 437 ms. Remains : 62/84 places, 340/363 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-07a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLFireability-09 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(!p0)))))'
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 82 transition count 359
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 359
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 80 transition count 355
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 9 ms. Remains 80 /84 variables (removed 4) and now considering 355/363 (removed 8) transitions.
[2024-05-29 19:46:32] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:46:32] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 19:46:32] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 19:46:32] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:46:32] [INFO ] Invariant cache hit.
[2024-05-29 19:46:32] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:46:32] [INFO ] Implicit Places using invariants and state equation in 222 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 257 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/363 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 5 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:46:32] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:46:32] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:46:32] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 19:46:32] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:46:32] [INFO ] Invariant cache hit.
[2024-05-29 19:46:32] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:46:32] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/363 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 394 ms. Remains : 58/84 places, 334/363 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLFireability-10 finished in 532 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) U G(p1)))'
Support contains 9 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 84 transition count 354
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 75 transition count 354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 73 transition count 350
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 350
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 71 transition count 346
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 71 transition count 346
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 69 transition count 344
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 69 transition count 344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 69 transition count 341
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 57 place count 57 transition count 329
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 53 transition count 325
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 53 transition count 325
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 125 place count 53 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 132 place count 53 transition count 258
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 146 place count 46 transition count 251
Applied a total of 146 rules in 42 ms. Remains 46 /84 variables (removed 38) and now considering 251/363 (removed 112) transitions.
[2024-05-29 19:46:33] [INFO ] Flow matrix only has 243 transitions (discarded 8 similar events)
// Phase 1: matrix 243 rows 46 cols
[2024-05-29 19:46:33] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 19:46:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 19:46:33] [INFO ] Flow matrix only has 243 transitions (discarded 8 similar events)
[2024-05-29 19:46:33] [INFO ] Invariant cache hit.
[2024-05-29 19:46:33] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-05-29 19:46:33] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-29 19:46:33] [INFO ] Redundant transitions in 10 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-29 19:46:33] [INFO ] Flow matrix only has 243 transitions (discarded 8 similar events)
[2024-05-29 19:46:33] [INFO ] Invariant cache hit.
[2024-05-29 19:46:33] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:46:34] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:46:34] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:46:34] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:46:34] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (OVERLAPS) 242/288 variables, 46/106 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 225/331 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (OVERLAPS) 1/289 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 332 constraints, problems are : Problem set: 0 solved, 250 unsolved in 14706 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 242/288 variables, 46/109 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 225/334 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 250/584 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 1/289 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 585 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 61/61 constraints]
After SMT, in 45579ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 45581ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/84 places, 251/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45796 ms. Remains : 46/84 places, 251/363 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-11
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-07a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLFireability-11 finished in 45891 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 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 82 transition count 359
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 359
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 80 transition count 355
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 5 ms. Remains 80 /84 variables (removed 4) and now considering 355/363 (removed 8) transitions.
[2024-05-29 19:47:18] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:47:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 19:47:19] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 19:47:19] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:47:19] [INFO ] Invariant cache hit.
[2024-05-29 19:47:19] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:47:19] [INFO ] Implicit Places using invariants and state equation in 279 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 360 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/363 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 7 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:47:19] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:47:19] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:47:19] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 19:47:19] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:47:19] [INFO ] Invariant cache hit.
[2024-05-29 19:47:19] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:47:19] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/363 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 655 ms. Remains : 58/84 places, 334/363 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 84 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 10093 steps (5 resets) in 106 ms. (94 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-07a-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-07a-LTLFireability-12 finished in 1334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(X(F(p0))&&p1)))))'
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 82 transition count 359
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 359
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 80 transition count 355
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 6 ms. Remains 80 /84 variables (removed 4) and now considering 355/363 (removed 8) transitions.
[2024-05-29 19:47:20] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
// Phase 1: matrix 347 rows 80 cols
[2024-05-29 19:47:20] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 19:47:20] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 19:47:20] [INFO ] Flow matrix only has 347 transitions (discarded 8 similar events)
[2024-05-29 19:47:20] [INFO ] Invariant cache hit.
[2024-05-29 19:47:20] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:47:20] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 274 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/84 places, 355/363 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 65 transition count 341
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 65 transition count 341
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 58 transition count 334
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 58 transition count 334
Applied a total of 42 rules in 24 ms. Remains 58 /79 variables (removed 21) and now considering 334/355 (removed 21) transitions.
[2024-05-29 19:47:20] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:47:20] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 19:47:20] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 19:47:20] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:47:20] [INFO ] Invariant cache hit.
[2024-05-29 19:47:20] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:47:20] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/84 places, 334/363 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 500 ms. Remains : 58/84 places, 334/363 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-13
Product exploration explored 100000 steps with 6250 reset in 409 ms.
Product exploration explored 100000 steps with 6250 reset in 368 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 : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 60 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 19:47:22] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:47:22] [INFO ] Invariant cache hit.
[2024-05-29 19:47:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 19:47:22] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-29 19:47:22] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:47:22] [INFO ] [Real]Added 260 Read/Feed constraints in 27 ms returned sat
[2024-05-29 19:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:47:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 19:47:22] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-29 19:47:22] [INFO ] [Nat]Added 260 Read/Feed constraints in 26 ms returned sat
[2024-05-29 19:47:23] [INFO ] Computed and/alt/rep : 49/56/49 causal constraints (skipped 276 transitions) in 47 ms.
[2024-05-29 19:47:23] [INFO ] Added : 27 causal constraints over 6 iterations in 194 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 334/334 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2024-05-29 19:47:23] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:47:23] [INFO ] Invariant cache hit.
[2024-05-29 19:47:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 19:47:23] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:47:23] [INFO ] Invariant cache hit.
[2024-05-29 19:47:23] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:47:23] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-05-29 19:47:23] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:47:23] [INFO ] Invariant cache hit.
[2024-05-29 19:47:23] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 10 (OVERLAPS) 325/383 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 259/388 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 13 (OVERLAPS) 1/384 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 15 (OVERLAPS) 0/384 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 389 constraints, problems are : Problem set: 0 solved, 333 unsolved in 25799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 70/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 325/383 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 259/388 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 333/721 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:48:03] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:48:03] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:48:03] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:48:08] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 7/728 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/384 variables, and 728 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 77/77 constraints]
After SMT, in 57185ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 57188ms
Finished structural reductions in LTL mode , in 1 iterations and 57317 ms. Remains : 58/58 places, 334/334 transitions.
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 : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 60 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 19:48:21] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:48:21] [INFO ] Invariant cache hit.
[2024-05-29 19:48:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 19:48:21] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-29 19:48:21] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:48:21] [INFO ] [Real]Added 260 Read/Feed constraints in 24 ms returned sat
[2024-05-29 19:48:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:48:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 19:48:21] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-29 19:48:21] [INFO ] [Nat]Added 260 Read/Feed constraints in 25 ms returned sat
[2024-05-29 19:48:21] [INFO ] Computed and/alt/rep : 49/56/49 causal constraints (skipped 276 transitions) in 26 ms.
[2024-05-29 19:48:21] [INFO ] Added : 27 causal constraints over 6 iterations in 157 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6250 reset in 346 ms.
Product exploration explored 100000 steps with 6250 reset in 353 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 334/334 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 58 transition count 341
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 58 transition count 341
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 58 transition count 348
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 155 place count 58 transition count 221
Deduced a syphon composed of 28 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 169 place count 58 transition count 207
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 176 place count 58 transition count 207
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 190 place count 44 transition count 193
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 204 place count 44 transition count 193
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 204 rules in 41 ms. Remains 44 /58 variables (removed 14) and now considering 193/334 (removed 141) transitions.
[2024-05-29 19:48:22] [INFO ] Redundant transitions in 1 ms returned []
Running 192 sub problems to find dead transitions.
[2024-05-29 19:48:22] [INFO ] Flow matrix only has 185 transitions (discarded 8 similar events)
// Phase 1: matrix 185 rows 44 cols
[2024-05-29 19:48:22] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:48:22] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-29 19:48:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:48:23] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:48:23] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:48:23] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:48:23] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:48:23] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:48:23] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:48:23] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:48:24] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:48:25] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-29 19:48:25] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:48:25] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:48:25] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-29 19:48:25] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:48:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:48:25] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:48:26] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-29 19:48:27] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 10 (OVERLAPS) 184/228 variables, 44/92 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 140/232 constraints. Problems are: Problem set: 28 solved, 164 unsolved
[2024-05-29 19:48:28] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:48:28] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:48:28] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 3/235 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/235 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 14 (OVERLAPS) 1/229 variables, 1/236 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/229 variables, 0/236 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 16 (OVERLAPS) 0/229 variables, 0/236 constraints. Problems are: Problem set: 28 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 236 constraints, problems are : Problem set: 28 solved, 164 unsolved in 10228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 28 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 22/44 variables, 1/1 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 50/51 constraints. Problems are: Problem set: 28 solved, 164 unsolved
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:48:33] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/54 constraints. Problems are: Problem set: 28 solved, 164 unsolved
[2024-05-29 19:48:34] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:48:34] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:48:34] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:48:34] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 4/58 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/58 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 184/228 variables, 44/102 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 140/242 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 164/406 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/406 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 1/229 variables, 1/407 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/407 constraints. Problems are: Problem set: 28 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/229 variables, 0/407 constraints. Problems are: Problem set: 28 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 407 constraints, problems are : Problem set: 28 solved, 164 unsolved in 19163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 164/192 constraints, Known Traps: 57/57 constraints]
After SMT, in 29796ms problems are : Problem set: 28 solved, 164 unsolved
Search for dead transitions found 28 dead transitions in 29800ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 44/58 places, 165/334 transitions.
Graph (complete) has 183 edges and 44 vertex of which 23 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 23 /44 variables (removed 21) and now considering 165/165 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/58 places, 165/334 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29859 ms. Remains : 23/58 places, 165/334 transitions.
Support contains 7 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 334/334 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 334/334 (removed 0) transitions.
[2024-05-29 19:48:52] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-05-29 19:48:52] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:48:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 19:48:52] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:48:52] [INFO ] Invariant cache hit.
[2024-05-29 19:48:52] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 19:48:52] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-05-29 19:48:52] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-05-29 19:48:52] [INFO ] Invariant cache hit.
[2024-05-29 19:48:52] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:48:55] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:49:01] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 10 (OVERLAPS) 325/383 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 259/388 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 13 (OVERLAPS) 1/384 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 15 (OVERLAPS) 0/384 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 389 constraints, problems are : Problem set: 0 solved, 333 unsolved in 26502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 70/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 325/383 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 259/388 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 333/721 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-29 19:49:33] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:49:33] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:49:33] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:49:39] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:49:40] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:49:40] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:49:40] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 7/728 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/384 variables, and 728 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 77/77 constraints]
After SMT, in 58135ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 58140ms
Finished structural reductions in LTL mode , in 1 iterations and 58272 ms. Remains : 58/58 places, 334/334 transitions.
Treatment of property StigmergyElection-PT-07a-LTLFireability-13 finished in 150762 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 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 348
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 348
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 68 transition count 337
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 57 transition count 337
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 65 place count 43 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 79 place count 43 transition count 321
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 110 place count 43 transition count 290
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 110 place count 43 transition count 285
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 120 place count 38 transition count 285
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 36 transition count 281
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 36 transition count 281
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 220 place count 36 transition count 185
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 234 place count 29 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 241 place count 29 transition count 171
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 255 place count 22 transition count 164
Applied a total of 255 rules in 30 ms. Remains 22 /84 variables (removed 62) and now considering 164/363 (removed 199) transitions.
[2024-05-29 19:49:51] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
// Phase 1: matrix 156 rows 22 cols
[2024-05-29 19:49:51] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:49:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 19:49:51] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:49:51] [INFO ] Invariant cache hit.
[2024-05-29 19:49:51] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:49:51] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-29 19:49:51] [INFO ] Redundant transitions in 2 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 19:49:51] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:49:51] [INFO ] Invariant cache hit.
[2024-05-29 19:49:51] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:49:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:49:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:49:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:49:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:49:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:49:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:49:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:49:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5388 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:49:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:49:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:49:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 18081ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 18082ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/84 places, 164/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18195 ms. Remains : 22/84 places, 164/363 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-14
Product exploration explored 100000 steps with 12500 reset in 318 ms.
Product exploration explored 100000 steps with 12500 reset in 323 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 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 85 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-29 19:50:10] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:50:10] [INFO ] Invariant cache hit.
[2024-05-29 19:50:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 19:50:10] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-29 19:50:10] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:50:10] [INFO ] [Real]Added 141 Read/Feed constraints in 14 ms returned sat
[2024-05-29 19:50:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:50:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 19:50:10] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-29 19:50:10] [INFO ] [Nat]Added 141 Read/Feed constraints in 13 ms returned sat
[2024-05-29 19:50:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 149 transitions) in 11 ms.
[2024-05-29 19:50:10] [INFO ] Added : 0 causal constraints over 0 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 164/164 transitions.
Applied a total of 0 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-29 19:50:10] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:50:10] [INFO ] Invariant cache hit.
[2024-05-29 19:50:10] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 19:50:10] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:50:10] [INFO ] Invariant cache hit.
[2024-05-29 19:50:10] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:50:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-29 19:50:10] [INFO ] Redundant transitions in 4 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 19:50:10] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:50:10] [INFO ] Invariant cache hit.
[2024-05-29 19:50:10] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:50:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:50:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5315 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:50:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:50:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:50:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 18316ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 18319ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18428 ms. Remains : 22/22 places, 164/164 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 82 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 35 ms :[(NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 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 90 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-29 19:50:29] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:50:29] [INFO ] Invariant cache hit.
[2024-05-29 19:50:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 19:50:29] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-29 19:50:29] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:50:29] [INFO ] [Real]Added 141 Read/Feed constraints in 14 ms returned sat
[2024-05-29 19:50:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:50:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 19:50:29] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-29 19:50:29] [INFO ] [Nat]Added 141 Read/Feed constraints in 13 ms returned sat
[2024-05-29 19:50:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 149 transitions) in 10 ms.
[2024-05-29 19:50:29] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12500 reset in 334 ms.
Product exploration explored 100000 steps with 12500 reset in 330 ms.
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 164/164 transitions.
Applied a total of 0 rules in 4 ms. Remains 22 /22 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-29 19:50:30] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:50:30] [INFO ] Invariant cache hit.
[2024-05-29 19:50:30] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 19:50:30] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:50:30] [INFO ] Invariant cache hit.
[2024-05-29 19:50:30] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:50:30] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-29 19:50:30] [INFO ] Redundant transitions in 2 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-29 19:50:30] [INFO ] Flow matrix only has 156 transitions (discarded 8 similar events)
[2024-05-29 19:50:30] [INFO ] Invariant cache hit.
[2024-05-29 19:50:30] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:50:30] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:50:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:50:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:50:30] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:50:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:50:30] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:50:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:50:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
[2024-05-29 19:50:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:50:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:50:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 155/177 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 140/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 196 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5533 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-29 19:50:36] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:50:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:50:36] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 155/177 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 140/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 157/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 356 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 35/35 constraints]
After SMT, in 18475ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 18477ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18564 ms. Remains : 22/22 places, 164/164 transitions.
Treatment of property StigmergyElection-PT-07a-LTLFireability-14 finished in 57730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(X(F(p0))&&p1)))))'
Found a Shortening insensitive property : StigmergyElection-PT-07a-LTLFireability-13
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 84/84 places, 363/363 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 348
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 348
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 68 transition count 337
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 57 transition count 337
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 65 place count 43 transition count 321
Iterating global reduction 2 with 14 rules applied. Total rules applied 79 place count 43 transition count 321
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 110 place count 43 transition count 290
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 110 place count 43 transition count 285
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 120 place count 38 transition count 285
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 36 transition count 281
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 36 transition count 281
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 220 place count 36 transition count 185
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 234 place count 29 transition count 178
Applied a total of 234 rules in 27 ms. Remains 29 /84 variables (removed 55) and now considering 178/363 (removed 185) transitions.
[2024-05-29 19:50:48] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
// Phase 1: matrix 170 rows 29 cols
[2024-05-29 19:50:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 19:50:49] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 19:50:49] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
[2024-05-29 19:50:49] [INFO ] Invariant cache hit.
[2024-05-29 19:50:49] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:50:49] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-29 19:50:49] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
[2024-05-29 19:50:49] [INFO ] Invariant cache hit.
[2024-05-29 19:50:49] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:50:49] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:50:49] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:50:49] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:50:49] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:50:49] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:50:51] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:50:51] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:50:51] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:50:51] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:50:51] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:50:51] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:50:51] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:50:51] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:50:51] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:50:51] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 169/198 variables, 29/62 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 140/202 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 1/199 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:50:53] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:50:53] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:50:54] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:50:54] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 14 (OVERLAPS) 0/199 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 207 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:50:56] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:50:56] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:50:57] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:50:57] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:50:57] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:50:57] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:50:57] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:50:57] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:50:57] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:50:57] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:50:57] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 169/198 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 140/217 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 171/388 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 1/199 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (OVERLAPS) 0/199 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 389 constraints, problems are : Problem set: 0 solved, 171 unsolved in 12755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 47/47 constraints]
After SMT, in 20321ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 20323ms
Starting structural reductions in LI_LTL mode, iteration 1 : 29/84 places, 178/363 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 20447 ms. Remains : 29/84 places, 178/363 transitions.
Running random walk in product with property : StigmergyElection-PT-07a-LTLFireability-13
Product exploration explored 100000 steps with 12500 reset in 333 ms.
Product exploration explored 100000 steps with 12500 reset in 335 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 19:51:10] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
[2024-05-29 19:51:10] [INFO ] Invariant cache hit.
[2024-05-29 19:51:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 19:51:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-29 19:51:10] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:51:10] [INFO ] [Real]Added 141 Read/Feed constraints in 13 ms returned sat
[2024-05-29 19:51:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:51:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 19:51:10] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-29 19:51:10] [INFO ] [Nat]Added 141 Read/Feed constraints in 16 ms returned sat
[2024-05-29 19:51:10] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 156 transitions) in 15 ms.
[2024-05-29 19:51:10] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 178/178 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-29 19:51:10] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
[2024-05-29 19:51:10] [INFO ] Invariant cache hit.
[2024-05-29 19:51:10] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 19:51:10] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
[2024-05-29 19:51:10] [INFO ] Invariant cache hit.
[2024-05-29 19:51:10] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:51:11] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-29 19:51:11] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
[2024-05-29 19:51:11] [INFO ] Invariant cache hit.
[2024-05-29 19:51:11] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:11] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:51:11] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:51:11] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:51:11] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:51:11] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:51:11] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:51:11] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:51:12] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:13] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:51:13] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:51:13] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:51:13] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:51:13] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:51:13] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:51:13] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:51:13] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:13] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:51:13] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 169/198 variables, 29/62 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 140/202 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 1/199 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:15] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:51:15] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:16] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:51:16] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 14 (OVERLAPS) 0/199 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 207 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:18] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:51:18] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:51:18] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:51:18] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:19] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:19] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:51:19] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:51:19] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:51:19] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:51:19] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:51:19] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 169/198 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 140/217 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 171/388 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 1/199 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (OVERLAPS) 0/199 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 389 constraints, problems are : Problem set: 0 solved, 171 unsolved in 12119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 47/47 constraints]
After SMT, in 19683ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 19685ms
Finished structural reductions in LTL mode , in 1 iterations and 19765 ms. Remains : 29/29 places, 178/178 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 19:51:31] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
[2024-05-29 19:51:31] [INFO ] Invariant cache hit.
[2024-05-29 19:51:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 19:51:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-29 19:51:31] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:51:31] [INFO ] [Real]Added 141 Read/Feed constraints in 12 ms returned sat
[2024-05-29 19:51:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:51:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-29 19:51:31] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-29 19:51:31] [INFO ] [Nat]Added 141 Read/Feed constraints in 13 ms returned sat
[2024-05-29 19:51:31] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 156 transitions) in 14 ms.
[2024-05-29 19:51:31] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12500 reset in 328 ms.
Product exploration explored 100000 steps with 12500 reset in 324 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 178/178 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 29 transition count 171
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 29 transition count 171
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 14 rules in 24 ms. Remains 29 /29 variables (removed 0) and now considering 171/178 (removed 7) transitions.
[2024-05-29 19:51:32] [INFO ] Redundant transitions in 2 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-29 19:51:32] [INFO ] Flow matrix only has 163 transitions (discarded 8 similar events)
// Phase 1: matrix 163 rows 29 cols
[2024-05-29 19:51:32] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:51:32] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 6 (OVERLAPS) 162/191 variables, 29/55 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 140/195 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/195 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/196 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/196 constraints. Problems are: Problem set: 7 solved, 157 unsolved
[2024-05-29 19:51:36] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/192 variables, 1/197 constraints. Problems are: Problem set: 7 solved, 157 unsolved
[2024-05-29 19:51:37] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:51:37] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 2/199 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/199 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/199 constraints. Problems are: Problem set: 7 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 199 constraints, problems are : Problem set: 7 solved, 157 unsolved in 6748 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 7 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 14/29 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 28/29 constraints. Problems are: Problem set: 7 solved, 157 unsolved
[2024-05-29 19:51:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:51:39] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:51:39] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:51:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:51:39] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:51:39] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:51:39] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 7/36 constraints. Problems are: Problem set: 7 solved, 157 unsolved
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 2/38 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/38 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 162/191 variables, 29/67 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 140/207 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 157/364 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/364 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/365 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/365 constraints. Problems are: Problem set: 7 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/365 constraints. Problems are: Problem set: 7 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 365 constraints, problems are : Problem set: 7 solved, 157 unsolved in 12978 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 157/164 constraints, Known Traps: 37/37 constraints]
After SMT, in 20085ms problems are : Problem set: 7 solved, 157 unsolved
Search for dead transitions found 7 dead transitions in 20089ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 29/29 places, 164/178 transitions.
Graph (complete) has 176 edges and 29 vertex of which 22 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 22 /29 variables (removed 7) and now considering 164/164 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/29 places, 164/178 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20143 ms. Remains : 22/29 places, 164/178 transitions.
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 178/178 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-29 19:51:52] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
// Phase 1: matrix 170 rows 29 cols
[2024-05-29 19:51:52] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:51:52] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 19:51:52] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
[2024-05-29 19:51:52] [INFO ] Invariant cache hit.
[2024-05-29 19:51:52] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-29 19:51:52] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-29 19:51:52] [INFO ] Flow matrix only has 170 transitions (discarded 8 similar events)
[2024-05-29 19:51:52] [INFO ] Invariant cache hit.
[2024-05-29 19:51:52] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:55] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:51:55] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 169/198 variables, 29/62 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 140/202 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 1/199 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:57] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:51:57] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:51:57] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:51:57] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 14 (OVERLAPS) 0/199 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 207 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:52:00] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:52:00] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:52:00] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:52:00] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:52:00] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-29 19:52:01] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:52:01] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:52:01] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:52:01] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:52:01] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:52:01] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 169/198 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 140/217 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 171/388 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 1/199 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (OVERLAPS) 0/199 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 389 constraints, problems are : Problem set: 0 solved, 171 unsolved in 11984 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 47/47 constraints]
After SMT, in 19409ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 19411ms
Finished structural reductions in LTL mode , in 1 iterations and 19505 ms. Remains : 29/29 places, 178/178 transitions.
Treatment of property StigmergyElection-PT-07a-LTLFireability-13 finished in 83372 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 19:52:12] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:52:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 19:52:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 84 places, 363 transitions and 3933 arcs took 6 ms.
Total runtime 510940 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-07a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 84
TRANSITIONS: 363
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 3860
MODEL NAME: /home/mcc/execution/413/model
84 places, 363 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-07a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717012338231

--------------------
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-07a"
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-07a, 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-171690530100332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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