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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717012504184

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:55:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 19:55:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:55:05] [INFO ] Load time of PNML (sax parser for PT used): 435 ms
[2024-05-29 19:55:05] [INFO ] Transformed 114 places.
[2024-05-29 19:55:05] [INFO ] Transformed 6882 transitions.
[2024-05-29 19:55:05] [INFO ] Found NUPN structural information;
[2024-05-29 19:55:05] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 594 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-08a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 664/664 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 103 transition count 647
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 103 transition count 647
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 100 transition count 641
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 100 transition count 641
Applied a total of 28 rules in 136 ms. Remains 100 /114 variables (removed 14) and now considering 641/664 (removed 23) transitions.
[2024-05-29 19:55:06] [INFO ] Flow matrix only has 628 transitions (discarded 13 similar events)
// Phase 1: matrix 628 rows 100 cols
[2024-05-29 19:55:06] [INFO ] Computed 4 invariants in 12 ms
[2024-05-29 19:55:06] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-29 19:55:06] [INFO ] Flow matrix only has 628 transitions (discarded 13 similar events)
[2024-05-29 19:55:06] [INFO ] Invariant cache hit.
[2024-05-29 19:55:07] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:55:07] [INFO ] Implicit Places using invariants and state equation in 874 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1292 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/114 places, 641/664 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 93 transition count 635
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 93 transition count 635
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 92 transition count 634
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 92 transition count 634
Applied a total of 14 rules in 11 ms. Remains 92 /99 variables (removed 7) and now considering 634/641 (removed 7) transitions.
[2024-05-29 19:55:07] [INFO ] Flow matrix only has 621 transitions (discarded 13 similar events)
// Phase 1: matrix 621 rows 92 cols
[2024-05-29 19:55:07] [INFO ] Computed 3 invariants in 5 ms
[2024-05-29 19:55:07] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 19:55:07] [INFO ] Flow matrix only has 621 transitions (discarded 13 similar events)
[2024-05-29 19:55:07] [INFO ] Invariant cache hit.
[2024-05-29 19:55:07] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:55:08] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/114 places, 634/664 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1896 ms. Remains : 92/114 places, 634/664 transitions.
Support contains 29 out of 92 places after structural reductions.
[2024-05-29 19:55:08] [INFO ] Flatten gal took : 112 ms
[2024-05-29 19:55:08] [INFO ] Flatten gal took : 70 ms
[2024-05-29 19:55:08] [INFO ] Input system was already deterministic with 634 transitions.
Support contains 24 out of 92 places (down from 29) after GAL structural reductions.
RANDOM walk for 40000 steps (27 resets) in 2692 ms. (14 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
[2024-05-29 19:55:09] [INFO ] Flow matrix only has 621 transitions (discarded 13 similar events)
[2024-05-29 19:55:09] [INFO ] Invariant cache hit.
[2024-05-29 19:55:09] [INFO ] State equation strengthened by 517 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 620/712 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 516/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/713 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/713 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/713 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 713/713 variables, and 612 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 517/517 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 6 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 4 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 81/713 variables, and 32 constraints, problems are : Problem set: 1 solved, 0 unsolved in 2952 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/92 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 30/30 constraints]
After SMT, in 3350ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyElection-PT-08a-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA StigmergyElection-PT-08a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 13 stabilizing places and 13 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((p0&&X(p1))))'
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 634/634 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 78 transition count 615
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 78 transition count 615
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 69 transition count 604
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 69 transition count 604
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 67 transition count 602
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 67 transition count 602
Applied a total of 50 rules in 13 ms. Remains 67 /92 variables (removed 25) and now considering 602/634 (removed 32) transitions.
[2024-05-29 19:55:13] [INFO ] Flow matrix only has 593 transitions (discarded 9 similar events)
// Phase 1: matrix 593 rows 67 cols
[2024-05-29 19:55:13] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:55:13] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-29 19:55:13] [INFO ] Flow matrix only has 593 transitions (discarded 9 similar events)
[2024-05-29 19:55:13] [INFO ] Invariant cache hit.
[2024-05-29 19:55:13] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:55:13] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:55:13] [INFO ] Flow matrix only has 593 transitions (discarded 9 similar events)
[2024-05-29 19:55:13] [INFO ] Invariant cache hit.
[2024-05-29 19:55:13] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:55:22] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-29 19:55:22] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:55:22] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 19:55:23] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 1 ms to minimize.
[2024-05-29 19:55:23] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 12 ms to minimize.
[2024-05-29 19:55:23] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2024-05-29 19:55:23] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:55:23] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 19:55:23] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2024-05-29 19:55:24] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2024-05-29 19:55:24] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-29 19:55:24] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 19:55:24] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:55:24] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-29 19:55:24] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-29 19:55:24] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-29 19:55:24] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 7 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:55:25] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:55:26] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:55:26] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:55:26] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:55:26] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:55:26] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:55:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:55:26] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:55:26] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:55:26] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:55:26] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2024-05-29 19:55:27] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:55:28] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:55:28] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:55:28] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:55:28] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:55:28] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:55:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:55:28] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:55:28] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-29 19:55:28] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:55:28] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:55:29] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:55:29] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:55:29] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:55:30] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:55:30] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:55:30] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:55:30] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:55:30] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:55:30] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:55:30] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:55:30] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:55:30] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:55:31] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:55:31] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 19:55:32] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-29 19:55:32] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:55:32] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:55:32] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:55:33] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:55:33] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:55:33] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:55:33] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:55:33] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:55:33] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:55:38] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:55:38] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:55:38] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:55:39] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:55:39] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:55:39] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:55:39] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:55:39] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:55:39] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 11 (OVERLAPS) 592/659 variables, 67/163 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/659 variables, 516/679 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 659/660 variables, and 679 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 592/659 variables, 67/163 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 516/679 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 601/1280 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/660 variables, and 1280 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 95/95 constraints]
After SMT, in 67061ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 67094ms
Starting structural reductions in LTL mode, iteration 1 : 67/92 places, 602/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67587 ms. Remains : 67/92 places, 602/634 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLCardinality-03
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 8 ms.
FORMULA StigmergyElection-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLCardinality-03 finished in 67878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 634/634 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 80 transition count 618
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 80 transition count 618
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 71 transition count 607
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 71 transition count 607
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 69 transition count 605
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 69 transition count 605
Applied a total of 46 rules in 12 ms. Remains 69 /92 variables (removed 23) and now considering 605/634 (removed 29) transitions.
[2024-05-29 19:56:20] [INFO ] Flow matrix only has 596 transitions (discarded 9 similar events)
// Phase 1: matrix 596 rows 69 cols
[2024-05-29 19:56:20] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:56:21] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-29 19:56:21] [INFO ] Flow matrix only has 596 transitions (discarded 9 similar events)
[2024-05-29 19:56:21] [INFO ] Invariant cache hit.
[2024-05-29 19:56:21] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:56:21] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2024-05-29 19:56:21] [INFO ] Flow matrix only has 596 transitions (discarded 9 similar events)
[2024-05-29 19:56:21] [INFO ] Invariant cache hit.
[2024-05-29 19:56:21] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:56:30] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2024-05-29 19:56:30] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:56:30] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2024-05-29 19:56:30] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2024-05-29 19:56:30] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2024-05-29 19:56:30] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2024-05-29 19:56:31] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2024-05-29 19:56:31] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:56:31] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2024-05-29 19:56:31] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2024-05-29 19:56:31] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2024-05-29 19:56:31] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2024-05-29 19:56:31] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:56:32] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2024-05-29 19:56:32] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:56:32] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 19:56:32] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2024-05-29 19:56:32] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-05-29 19:56:32] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:56:32] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:56:32] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:56:33] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:56:34] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 19:56:34] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:56:34] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2024-05-29 19:56:34] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-29 19:56:34] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:56:34] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:56:36] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:56:37] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:56:38] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:56:38] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:56:38] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:56:38] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:56:38] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:56:38] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:56:38] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:56:38] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:56:38] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:56:39] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:56:40] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-29 19:56:41] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:56:41] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:56:41] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:56:41] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:56:42] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:56:43] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:56:45] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:56:45] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:56:45] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:56:45] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:56:45] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:56:45] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:56:45] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:56:47] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:56:47] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:56:47] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:56:47] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:56:47] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:56:47] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 11 (OVERLAPS) 595/664 variables, 69/173 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/664 variables, 516/689 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/665 variables, and 689 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 103/103 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:57:01] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:57:01] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:57:04] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:57:05] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:57:08] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 7 (OVERLAPS) 595/664 variables, 69/178 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 516/694 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/665 variables, and 1298 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30728 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 108/108 constraints]
After SMT, in 67425ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 67432ms
Starting structural reductions in LTL mode, iteration 1 : 69/92 places, 605/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67921 ms. Remains : 69/92 places, 605/634 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08a-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08a-LTLCardinality-09 finished in 68395 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 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 634/634 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 80 transition count 617
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 80 transition count 617
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 71 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 71 transition count 606
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 69 transition count 604
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 69 transition count 604
Applied a total of 46 rules in 15 ms. Remains 69 /92 variables (removed 23) and now considering 604/634 (removed 30) transitions.
[2024-05-29 19:57:29] [INFO ] Flow matrix only has 594 transitions (discarded 10 similar events)
// Phase 1: matrix 594 rows 69 cols
[2024-05-29 19:57:29] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 19:57:29] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-29 19:57:29] [INFO ] Flow matrix only has 594 transitions (discarded 10 similar events)
[2024-05-29 19:57:29] [INFO ] Invariant cache hit.
[2024-05-29 19:57:29] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:57:29] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2024-05-29 19:57:29] [INFO ] Flow matrix only has 594 transitions (discarded 10 similar events)
[2024-05-29 19:57:29] [INFO ] Invariant cache hit.
[2024-05-29 19:57:29] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:57:38] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 19:57:38] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 19:57:38] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-29 19:57:38] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:57:38] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-29 19:57:38] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:57:38] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:57:38] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 19:57:38] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-29 19:57:38] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:57:39] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:57:39] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-29 19:57:39] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:57:39] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:57:39] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:57:39] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2024-05-29 19:57:39] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:57:39] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2024-05-29 19:57:39] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:57:39] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 3 ms to minimize.
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:57:40] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:57:41] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:57:41] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:57:41] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:57:41] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:57:41] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:57:41] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:57:41] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:57:41] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:57:41] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:57:42] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:57:42] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:57:42] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:57:43] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:57:43] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:57:43] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:57:43] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:57:43] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:57:43] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:57:44] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:57:44] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:57:44] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:57:44] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:57:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:57:44] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:57:45] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:57:45] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:57:45] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:57:45] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:57:45] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 19:57:45] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:57:45] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:57:46] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:57:46] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:57:47] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:57:47] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:57:47] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:57:47] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:57:47] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:57:50] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:57:51] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:57:51] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:57:51] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:57:51] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:57:52] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:57:52] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:57:53] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 11 (OVERLAPS) 593/662 variables, 69/148 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 516/664 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/663 variables, and 664 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:58:07] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:58:07] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:58:07] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:58:07] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:58:09] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 5 (OVERLAPS) 593/662 variables, 69/153 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 516/669 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 603/1272 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/663 variables, and 1272 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 82/82 constraints]
After SMT, in 66242ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 66250ms
Starting structural reductions in LTL mode, iteration 1 : 69/92 places, 604/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66706 ms. Remains : 69/92 places, 604/634 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 152 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 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 71 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 43 ms :[true, (NOT p0)]
RANDOM walk for 38885 steps (27 resets) in 716 ms. (54 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 83 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-08a-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08a-LTLCardinality-10 finished in 67516 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 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 634/634 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 80 transition count 617
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 80 transition count 617
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 71 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 71 transition count 606
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 69 transition count 604
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 69 transition count 604
Applied a total of 46 rules in 12 ms. Remains 69 /92 variables (removed 23) and now considering 604/634 (removed 30) transitions.
[2024-05-29 19:58:36] [INFO ] Flow matrix only has 595 transitions (discarded 9 similar events)
// Phase 1: matrix 595 rows 69 cols
[2024-05-29 19:58:36] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 19:58:36] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 19:58:36] [INFO ] Flow matrix only has 595 transitions (discarded 9 similar events)
[2024-05-29 19:58:36] [INFO ] Invariant cache hit.
[2024-05-29 19:58:37] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:58:37] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2024-05-29 19:58:37] [INFO ] Flow matrix only has 595 transitions (discarded 9 similar events)
[2024-05-29 19:58:37] [INFO ] Invariant cache hit.
[2024-05-29 19:58:37] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:58:45] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2024-05-29 19:58:45] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:58:45] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2024-05-29 19:58:45] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:58:45] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2024-05-29 19:58:46] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:58:46] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2024-05-29 19:58:46] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 19:58:46] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2024-05-29 19:58:46] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 1 ms to minimize.
[2024-05-29 19:58:46] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:58:46] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:58:47] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:58:48] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:58:49] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:58:50] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:58:50] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:58:50] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:58:50] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:58:50] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:58:50] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:58:50] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:58:50] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:58:50] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:58:52] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:58:52] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:58:52] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:58:52] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:58:52] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:58:52] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:58:52] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:58:52] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:58:52] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:58:52] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:58:53] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:58:55] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 19:58:55] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:58:55] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:58:55] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:58:55] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:58:55] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:58:55] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:58:56] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:58:56] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:58:57] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 8 (OVERLAPS) 594/663 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/664 variables, and 667 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:59:15] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:59:15] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:59:15] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:59:15] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:59:15] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:59:17] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:59:18] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:59:18] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 6 (OVERLAPS) 594/663 variables, 69/159 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 516/675 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 603/1278 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/664 variables, and 1278 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 89/89 constraints]
After SMT, in 66155ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 66161ms
Starting structural reductions in LTL mode, iteration 1 : 69/92 places, 604/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66586 ms. Remains : 69/92 places, 604/634 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-08a-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08a-LTLCardinality-11 finished in 66895 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 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 634/634 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 91 transition count 611
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 69 transition count 610
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 68 transition count 610
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 46 place count 68 transition count 597
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 72 place count 55 transition count 597
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 79 place count 48 transition count 585
Iterating global reduction 3 with 7 rules applied. Total rules applied 86 place count 48 transition count 585
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 93 place count 48 transition count 578
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 95 place count 46 transition count 574
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 46 transition count 574
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 121 place count 46 transition count 550
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 5 with 24 rules applied. Total rules applied 145 place count 34 transition count 538
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Iterating post reduction 5 with 230 rules applied. Total rules applied 375 place count 34 transition count 308
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 377 place count 33 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 378 place count 33 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 7 with 256 rules applied. Total rules applied 634 place count 33 transition count 50
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 650 place count 25 transition count 42
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 7 with 7 rules applied. Total rules applied 657 place count 18 transition count 35
Applied a total of 657 rules in 115 ms. Remains 18 /92 variables (removed 74) and now considering 35/634 (removed 599) transitions.
[2024-05-29 19:59:43] [INFO ] Flow matrix only has 27 transitions (discarded 8 similar events)
// Phase 1: matrix 27 rows 18 cols
[2024-05-29 19:59:43] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:59:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 19:59:43] [INFO ] Flow matrix only has 27 transitions (discarded 8 similar events)
[2024-05-29 19:59:43] [INFO ] Invariant cache hit.
[2024-05-29 19:59:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 19:59:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-29 19:59:43] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-29 19:59:43] [INFO ] Flow matrix only has 27 transitions (discarded 8 similar events)
[2024-05-29 19:59:43] [INFO ] Invariant cache hit.
[2024-05-29 19:59:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 19:59:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:59:44] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 26/44 variables, 18/65 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 1/45 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 78 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:59:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 26/44 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 19/100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/45 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 101 constraints, problems are : Problem set: 0 solved, 19 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 62/62 constraints]
After SMT, in 2046ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 2046ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/92 places, 35/634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2241 ms. Remains : 18/92 places, 35/634 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-08a-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-08a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLCardinality-13 finished in 2298 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(F((p0||G(F(p1))))))))'
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 634/634 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 80 transition count 618
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 80 transition count 618
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 71 transition count 607
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 71 transition count 607
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 69 transition count 605
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 69 transition count 605
Applied a total of 46 rules in 14 ms. Remains 69 /92 variables (removed 23) and now considering 605/634 (removed 29) transitions.
[2024-05-29 19:59:46] [INFO ] Flow matrix only has 595 transitions (discarded 10 similar events)
// Phase 1: matrix 595 rows 69 cols
[2024-05-29 19:59:46] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 19:59:46] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 19:59:46] [INFO ] Flow matrix only has 595 transitions (discarded 10 similar events)
[2024-05-29 19:59:46] [INFO ] Invariant cache hit.
[2024-05-29 19:59:46] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:59:46] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2024-05-29 19:59:46] [INFO ] Flow matrix only has 595 transitions (discarded 10 similar events)
[2024-05-29 19:59:46] [INFO ] Invariant cache hit.
[2024-05-29 19:59:46] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:59:54] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 19:59:55] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:59:56] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:59:56] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:59:56] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:59:56] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:59:56] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 0 ms to minimize.
[2024-05-29 19:59:56] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 19:59:56] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:59:56] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:59:57] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:59:58] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 19:59:58] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:59:58] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:59:58] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:59:58] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:59:59] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:59:59] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:59:59] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:59:59] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:59:59] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:59:59] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 19:59:59] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:00:00] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 20:00:01] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:00:01] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:00:01] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:00:01] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:00:01] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 20:00:01] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:00:01] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-05-29 20:00:01] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:00:01] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:00:02] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:00:02] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:00:02] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:00:02] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:00:03] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 20:00:04] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:00:05] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 8 (OVERLAPS) 594/663 variables, 69/147 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 516/663 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:00:19] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/664 variables, and 668 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:00:24] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:00:26] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2024-05-29 20:00:26] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:00:26] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:00:26] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 20:00:27] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:00:27] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:00:27] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:00:29] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:00:29] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:00:29] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:00:30] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:00:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 20:00:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 8 (OVERLAPS) 594/663 variables, 69/174 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 516/690 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/664 variables, and 1294 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30498 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 103/103 constraints]
After SMT, in 66306ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 66316ms
Starting structural reductions in LTL mode, iteration 1 : 69/92 places, 605/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66756 ms. Remains : 69/92 places, 605/634 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-08a-LTLCardinality-14
Product exploration explored 100000 steps with 71 reset in 145 ms.
Stuttering criterion allowed to conclude after 2043 steps with 27 reset in 26 ms.
FORMULA StigmergyElection-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-08a-LTLCardinality-14 finished in 67125 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(p1)||p0)))'
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 634/634 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 80 transition count 618
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 80 transition count 618
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 72 transition count 608
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 72 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 71 transition count 607
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 71 transition count 607
Applied a total of 42 rules in 12 ms. Remains 71 /92 variables (removed 21) and now considering 607/634 (removed 27) transitions.
[2024-05-29 20:00:53] [INFO ] Flow matrix only has 598 transitions (discarded 9 similar events)
// Phase 1: matrix 598 rows 71 cols
[2024-05-29 20:00:53] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 20:00:53] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-29 20:00:53] [INFO ] Flow matrix only has 598 transitions (discarded 9 similar events)
[2024-05-29 20:00:53] [INFO ] Invariant cache hit.
[2024-05-29 20:00:53] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 20:00:53] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2024-05-29 20:00:53] [INFO ] Flow matrix only has 598 transitions (discarded 9 similar events)
[2024-05-29 20:00:53] [INFO ] Invariant cache hit.
[2024-05-29 20:00:53] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:03] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2024-05-29 20:01:03] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2024-05-29 20:01:03] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:01:03] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:01:03] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:01:03] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2024-05-29 20:01:03] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:01:04] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 20:01:04] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:01:04] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:01:04] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2024-05-29 20:01:04] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:01:04] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:01:04] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:01:04] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:01:05] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2024-05-29 20:01:05] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:01:05] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2024-05-29 20:01:05] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:01:05] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:05] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:01:05] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2024-05-29 20:01:06] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 20:01:07] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:01:07] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2024-05-29 20:01:07] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2024-05-29 20:01:07] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:01:07] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:01:07] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:08] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:01:09] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:01:09] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:01:09] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:01:09] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:01:09] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:01:09] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:01:09] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:01:10] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:01:10] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:01:10] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:01:10] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:01:10] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:01:11] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 20:01:12] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 20:01:13] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:01:14] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:01:15] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2024-05-29 20:01:15] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:01:15] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 14/94 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:16] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:01:16] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:18] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:01:19] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:20] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:01:20] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:01:20] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:23] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:24] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 13 (OVERLAPS) 597/668 variables, 71/174 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 516/690 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/669 variables, and 690 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-29 20:01:35] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 5 (OVERLAPS) 597/668 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 516/691 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 606/1297 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/669 variables, and 1297 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 103/103 constraints]
After SMT, in 67144ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 67154ms
Starting structural reductions in LTL mode, iteration 1 : 71/92 places, 607/634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67672 ms. Remains : 71/92 places, 607/634 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-08a-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-08a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-08a-LTLCardinality-15 finished in 68144 ms.
All properties solved by simple procedures.
Total runtime 415954 ms.
ITS solved all properties within timeout

BK_STOP 1717012921374

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyElection-PT-08a, examination is LTLCardinality"
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-171690530100347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08a.tgz
mv StigmergyElection-PT-08a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;