Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 18:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 18:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 11 18:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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 31K 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-03a-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-03a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717244968256

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:29:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:29:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:29:29] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-06-01 12:29:29] [INFO ] Transformed 44 places.
[2024-06-01 12:29:29] [INFO ] Transformed 118 transitions.
[2024-06-01 12:29:29] [INFO ] Found NUPN structural information;
[2024-06-01 12:29:29] [INFO ] Parsed PT model containing 44 places and 118 transitions and 467 arcs in 144 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 2 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-03a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Applied a total of 0 rules in 9 ms. Remains 44 /44 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2024-06-01 12:29:29] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
// Phase 1: matrix 64 rows 44 cols
[2024-06-01 12:29:29] [INFO ] Computed 4 invariants in 8 ms
[2024-06-01 12:29:29] [INFO ] Implicit Places using invariants in 203 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/44 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 39 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 39 transition count 69
Applied a total of 8 rules in 10 ms. Remains 39 /43 variables (removed 4) and now considering 69/73 (removed 4) transitions.
[2024-06-01 12:29:29] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
// Phase 1: matrix 60 rows 39 cols
[2024-06-01 12:29:29] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 12:29:29] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 12:29:29] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-06-01 12:29:29] [INFO ] Invariant cache hit.
[2024-06-01 12:29:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:29:30] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/44 places, 69/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 399 ms. Remains : 39/44 places, 69/73 transitions.
Support contains 14 out of 39 places after structural reductions.
[2024-06-01 12:29:30] [INFO ] Flatten gal took : 20 ms
[2024-06-01 12:29:30] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:29:30] [INFO ] Input system was already deterministic with 69 transitions.
RANDOM walk for 1376 steps (15 resets) in 97 ms. (14 steps per ms) remains 0/10 properties
Computed a total of 3 stabilizing places and 3 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 69/69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 38 transition count 62
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 32 transition count 62
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 32 transition count 56
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 26 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 22 transition count 49
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 22 transition count 49
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 19 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 19 transition count 43
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 45 place count 19 transition count 36
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 53 place count 15 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 15 transition count 31
Performed 4 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 62 place count 11 transition count 31
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 70 place count 11 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 74 place count 11 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 75 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 11 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 9 transition count 16
Applied a total of 78 rules in 29 ms. Remains 9 /39 variables (removed 30) and now considering 16/69 (removed 53) transitions.
[2024-06-01 12:29:30] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2024-06-01 12:29:30] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:29:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 12:29:30] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-06-01 12:29:30] [INFO ] Invariant cache hit.
[2024-06-01 12:29:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 12:29:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 12:29:30] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 12:29:30] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-06-01 12:29:30] [INFO ] Invariant cache hit.
[2024-06-01 12:29:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 4 ms to minimize.
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 5 ms to minimize.
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 11/20 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 11/20 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints]
After SMT, in 574ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 583ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/39 places, 16/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 676 ms. Remains : 9/39 places, 16/69 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-03a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLCardinality-00 finished in 905 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 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 33 transition count 61
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 33 transition count 61
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 31 transition count 57
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 31 transition count 57
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 29 transition count 55
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 29 transition count 55
Applied a total of 20 rules in 4 ms. Remains 29 /39 variables (removed 10) and now considering 55/69 (removed 14) transitions.
[2024-06-01 12:29:31] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
// Phase 1: matrix 50 rows 29 cols
[2024-06-01 12:29:31] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:29:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 12:29:31] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
[2024-06-01 12:29:31] [INFO ] Invariant cache hit.
[2024-06-01 12:29:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:29:31] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 12:29:31] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
[2024-06-01 12:29:31] [INFO ] Invariant cache hit.
[2024-06-01 12:29:31] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:29:32] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:29:32] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 49/78 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:29:32] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 61 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 49/78 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 54/114 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 115 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 15/15 constraints]
After SMT, in 2434ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2435ms
Starting structural reductions in LTL mode, iteration 1 : 29/39 places, 55/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2505 ms. Remains : 29/39 places, 55/69 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-03a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLCardinality-04 finished in 2609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 33 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 33 transition count 60
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 30 transition count 54
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 30 transition count 54
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 27 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 27 transition count 51
Applied a total of 24 rules in 6 ms. Remains 27 /39 variables (removed 12) and now considering 51/69 (removed 18) transitions.
[2024-06-01 12:29:33] [INFO ] Flow matrix only has 47 transitions (discarded 4 similar events)
// Phase 1: matrix 47 rows 27 cols
[2024-06-01 12:29:33] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:29:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 12:29:33] [INFO ] Flow matrix only has 47 transitions (discarded 4 similar events)
[2024-06-01 12:29:33] [INFO ] Invariant cache hit.
[2024-06-01 12:29:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:29:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 12:29:34] [INFO ] Flow matrix only has 47 transitions (discarded 4 similar events)
[2024-06-01 12:29:34] [INFO ] Invariant cache hit.
[2024-06-01 12:29:34] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 46/73 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 1/74 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 57 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 12:29:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:29:35] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 46/73 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 12:29:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 1/74 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/74 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (OVERLAPS) 0/74 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 110 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1238 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 16/16 constraints]
After SMT, in 2431ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2432ms
Starting structural reductions in LTL mode, iteration 1 : 27/39 places, 51/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2497 ms. Remains : 27/39 places, 51/69 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLCardinality-05
Product exploration explored 100000 steps with 22234 reset in 203 ms.
Product exploration explored 100000 steps with 22292 reset in 105 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/27 stabilizing places and 2/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 51/51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 27 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 24 transition count 48
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 24 transition count 45
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 21 transition count 45
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 30 place count 12 transition count 36
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 40 place count 12 transition count 26
Performed 3 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 9 transition count 27
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 53 place count 9 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 57 place count 9 transition count 16
Applied a total of 57 rules in 9 ms. Remains 9 /27 variables (removed 18) and now considering 16/51 (removed 35) transitions.
[2024-06-01 12:29:37] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 9 cols
[2024-06-01 12:29:37] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:29:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 12:29:37] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 12:29:37] [INFO ] Invariant cache hit.
[2024-06-01 12:29:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 12:29:37] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 12:29:37] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 12:29:37] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-06-01 12:29:37] [INFO ] Invariant cache hit.
[2024-06-01 12:29:37] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:29:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 12/21 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/22 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 25 constraints, problems are : Problem set: 0 solved, 15 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 12/21 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/22 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/22 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 40 constraints, problems are : Problem set: 0 solved, 15 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 8/8 constraints]
After SMT, in 445ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 445ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/27 places, 16/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 505 ms. Remains : 9/27 places, 16/51 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/9 stabilizing places and 2/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-03a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03a-LTLCardinality-05 finished in 4119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 69/69 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 34 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 34 transition count 62
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 32 transition count 58
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 32 transition count 58
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 30 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 30 transition count 56
Applied a total of 18 rules in 8 ms. Remains 30 /39 variables (removed 9) and now considering 56/69 (removed 13) transitions.
[2024-06-01 12:29:38] [INFO ] Flow matrix only has 51 transitions (discarded 5 similar events)
// Phase 1: matrix 51 rows 30 cols
[2024-06-01 12:29:38] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 12:29:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 12:29:38] [INFO ] Flow matrix only has 51 transitions (discarded 5 similar events)
[2024-06-01 12:29:38] [INFO ] Invariant cache hit.
[2024-06-01 12:29:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:29:38] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-06-01 12:29:38] [INFO ] Flow matrix only has 51 transitions (discarded 5 similar events)
[2024-06-01 12:29:38] [INFO ] Invariant cache hit.
[2024-06-01 12:29:38] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 2 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 12:29:38] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 50/80 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 1/81 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 60 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 50/80 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 55/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 12:29:39] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 0/81 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 116 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1314 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 14/14 constraints]
After SMT, in 2636ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2636ms
Starting structural reductions in LTL mode, iteration 1 : 30/39 places, 56/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2706 ms. Remains : 30/39 places, 56/69 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 52 ms.
Product exploration explored 100000 steps with 50000 reset in 123 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-03a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03a-LTLCardinality-09 finished in 3005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 33 transition count 61
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 33 transition count 61
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 31 transition count 57
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 31 transition count 57
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 29 transition count 55
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 29 transition count 55
Applied a total of 20 rules in 3 ms. Remains 29 /39 variables (removed 10) and now considering 55/69 (removed 14) transitions.
[2024-06-01 12:29:41] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
// Phase 1: matrix 50 rows 29 cols
[2024-06-01 12:29:41] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:29:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 12:29:41] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
[2024-06-01 12:29:41] [INFO ] Invariant cache hit.
[2024-06-01 12:29:41] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:29:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 12:29:41] [INFO ] Flow matrix only has 50 transitions (discarded 5 similar events)
[2024-06-01 12:29:41] [INFO ] Invariant cache hit.
[2024-06-01 12:29:41] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:29:41] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 49/78 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/79 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 61 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1245 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 12:29:42] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:29:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 49/78 variables, 29/47 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 54/116 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 117 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 17/17 constraints]
After SMT, in 2570ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2571ms
Starting structural reductions in LTL mode, iteration 1 : 29/39 places, 55/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2636 ms. Remains : 29/39 places, 55/69 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 124 ms.
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (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-03a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03a-LTLCardinality-11 finished in 3060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 33 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 33 transition count 60
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 30 transition count 54
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 30 transition count 54
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 27 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 27 transition count 51
Applied a total of 24 rules in 5 ms. Remains 27 /39 variables (removed 12) and now considering 51/69 (removed 18) transitions.
[2024-06-01 12:29:44] [INFO ] Flow matrix only has 47 transitions (discarded 4 similar events)
// Phase 1: matrix 47 rows 27 cols
[2024-06-01 12:29:44] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:29:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 12:29:44] [INFO ] Flow matrix only has 47 transitions (discarded 4 similar events)
[2024-06-01 12:29:44] [INFO ] Invariant cache hit.
[2024-06-01 12:29:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:29:44] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 12:29:44] [INFO ] Flow matrix only has 47 transitions (discarded 4 similar events)
[2024-06-01 12:29:44] [INFO ] Invariant cache hit.
[2024-06-01 12:29:44] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 12:29:44] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 46/73 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 1/74 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 58 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 12:29:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 46/73 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 1/74 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/74 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 109 constraints, problems are : Problem set: 0 solved, 50 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 15/15 constraints]
After SMT, in 2122ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2125ms
Starting structural reductions in LTL mode, iteration 1 : 27/39 places, 51/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2193 ms. Remains : 27/39 places, 51/69 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03a-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/27 stabilizing places and 2/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-03a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03a-LTLCardinality-12 finished in 2387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((X(p1)&&F(!p0)))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 33 transition count 61
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 33 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 32 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 32 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 31 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 31 transition count 58
Applied a total of 16 rules in 2 ms. Remains 31 /39 variables (removed 8) and now considering 58/69 (removed 11) transitions.
[2024-06-01 12:29:46] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
// Phase 1: matrix 53 rows 31 cols
[2024-06-01 12:29:46] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 12:29:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 12:29:46] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-06-01 12:29:46] [INFO ] Invariant cache hit.
[2024-06-01 12:29:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:29:46] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-06-01 12:29:46] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-06-01 12:29:46] [INFO ] Invariant cache hit.
[2024-06-01 12:29:46] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 12:29:46] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:29:46] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:29:46] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:29:46] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:29:46] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:29:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:29:46] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:29:46] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:29:47] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:29:47] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:29:47] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:29:47] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:29:47] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:29:47] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 52/83 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 1/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 62 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1316 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-01 12:29:48] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:29:48] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 52/83 variables, 31/48 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 57/120 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 1/84 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/84 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 121 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 16/16 constraints]
After SMT, in 2523ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2524ms
Starting structural reductions in LTL mode, iteration 1 : 31/39 places, 58/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2597 ms. Remains : 31/39 places, 58/69 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), p0]
Running random walk in product with property : StigmergyElection-PT-03a-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-03a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03a-LTLCardinality-14 finished in 2938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (p1&&X(X(G(p0)))))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 69/69 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 33 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 33 transition count 60
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 30 transition count 54
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 30 transition count 54
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 27 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 27 transition count 51
Applied a total of 24 rules in 3 ms. Remains 27 /39 variables (removed 12) and now considering 51/69 (removed 18) transitions.
[2024-06-01 12:29:49] [INFO ] Flow matrix only has 46 transitions (discarded 5 similar events)
// Phase 1: matrix 46 rows 27 cols
[2024-06-01 12:29:49] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:29:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 12:29:49] [INFO ] Flow matrix only has 46 transitions (discarded 5 similar events)
[2024-06-01 12:29:49] [INFO ] Invariant cache hit.
[2024-06-01 12:29:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:29:49] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 12:29:49] [INFO ] Flow matrix only has 46 transitions (discarded 5 similar events)
[2024-06-01 12:29:49] [INFO ] Invariant cache hit.
[2024-06-01 12:29:49] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:29:49] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:29:50] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:29:50] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 45/72 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 1/73 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 59 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 12:29:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 45/72 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 1/73 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 110 constraints, problems are : Problem set: 0 solved, 50 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 15/15 constraints]
After SMT, in 1763ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1763ms
Starting structural reductions in LTL mode, iteration 1 : 27/39 places, 51/69 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1830 ms. Remains : 27/39 places, 51/69 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-03a-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 72 ms.
Entered a terminal (fully accepting) state of product in 121 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03a-LTLCardinality-15 finished in 2078 ms.
All properties solved by simple procedures.
Total runtime 22183 ms.
ITS solved all properties within timeout

BK_STOP 1717244991583

--------------------
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-03a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-03a, 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 r536-tall-171690532000267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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