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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 11 19:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 11 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 193K 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-05a-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-05a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717245798133

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-05a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:43:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:43:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:43:19] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-01 12:43:19] [INFO ] Transformed 72 places.
[2024-06-01 12:43:19] [INFO ] Transformed 450 transitions.
[2024-06-01 12:43:19] [INFO ] Found NUPN structural information;
[2024-06-01 12:43:19] [INFO ] Parsed PT model containing 72 places and 450 transitions and 3637 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 291 transitions
Reduce redundant transitions removed 291 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-05a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 159/159 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 67 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 67 transition count 151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 66 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 66 transition count 149
Applied a total of 12 rules in 21 ms. Remains 66 /72 variables (removed 6) and now considering 149/159 (removed 10) transitions.
[2024-06-01 12:43:19] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
// Phase 1: matrix 139 rows 66 cols
[2024-06-01 12:43:19] [INFO ] Computed 4 invariants in 16 ms
[2024-06-01 12:43:19] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-06-01 12:43:19] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-06-01 12:43:19] [INFO ] Invariant cache hit.
[2024-06-01 12:43:20] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 12:43:20] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-06-01 12:43:20] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-06-01 12:43:20] [INFO ] Invariant cache hit.
[2024-06-01 12:43:20] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 11 ms to minimize.
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 3 ms to minimize.
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:43:21] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 25 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 1 ms to minimize.
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-01 12:43:22] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 4 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:43:23] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-01 12:43:24] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2024-06-01 12:43:24] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:43:24] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:43:24] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:43:25] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:43:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-01 12:43:25] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:43:25] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-01 12:43:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:43:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-01 12:43:26] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-01 12:43:26] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 138/204 variables, 66/122 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 85/207 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-06-01 12:43:27] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 14 (OVERLAPS) 1/205 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 16 (OVERLAPS) 0/205 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 209 constraints, problems are : Problem set: 0 solved, 148 unsolved in 10754 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 138/204 variables, 66/123 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 85/208 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 148/356 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 1/205 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/205 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 357 constraints, problems are : Problem set: 0 solved, 148 unsolved in 7000 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 53/53 constraints]
After SMT, in 18073ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 18089ms
Starting structural reductions in LTL mode, iteration 1 : 66/72 places, 149/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18545 ms. Remains : 66/72 places, 149/159 transitions.
Support contains 31 out of 66 places after structural reductions.
[2024-06-01 12:43:38] [INFO ] Flatten gal took : 32 ms
[2024-06-01 12:43:38] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:43:38] [INFO ] Input system was already deterministic with 149 transitions.
RANDOM walk for 13327 steps (61 resets) in 530 ms. (25 steps per ms) remains 0/21 properties
FORMULA StigmergyElection-PT-05a-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 11 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 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 64 transition count 129
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 45 transition count 129
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 45 transition count 121
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 37 transition count 121
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 31 transition count 112
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 31 transition count 112
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 74 place count 31 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 74 place count 31 transition count 104
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 30 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 29 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 29 transition count 102
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 86 place count 29 transition count 94
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 96 place count 24 transition count 89
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 101 place count 24 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 5 with 47 rules applied. Total rules applied 148 place count 24 transition count 37
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 158 place count 19 transition count 32
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 162 place count 15 transition count 28
Applied a total of 162 rules in 37 ms. Remains 15 /66 variables (removed 51) and now considering 28/149 (removed 121) transitions.
[2024-06-01 12:43:39] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
// Phase 1: matrix 22 rows 15 cols
[2024-06-01 12:43:39] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:43:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 12:43:39] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2024-06-01 12:43:39] [INFO ] Invariant cache hit.
[2024-06-01 12:43:39] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 12:43:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 12:43:39] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2024-06-01 12:43:39] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2024-06-01 12:43:39] [INFO ] Invariant cache hit.
[2024-06-01 12:43:39] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 8 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 21/36 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 1/37 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/37 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 0/37 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 41 constraints, problems are : Problem set: 0 solved, 27 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 12:43:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:43:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 21/36 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 27/69 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 1/37 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/37 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 0/37 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 70 constraints, problems are : Problem set: 0 solved, 27 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 20/20 constraints]
After SMT, in 1201ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1202ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/66 places, 28/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1301 ms. Remains : 15/66 places, 28/149 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLCardinality-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-05a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLCardinality-00 finished in 1526 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)||X((p1 U (G(p1)||p2)))))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 149/149 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 59 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 59 transition count 136
Applied a total of 14 rules in 7 ms. Remains 59 /66 variables (removed 7) and now considering 136/149 (removed 13) transitions.
[2024-06-01 12:43:40] [INFO ] Flow matrix only has 129 transitions (discarded 7 similar events)
// Phase 1: matrix 129 rows 59 cols
[2024-06-01 12:43:40] [INFO ] Computed 3 invariants in 5 ms
[2024-06-01 12:43:40] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 12:43:40] [INFO ] Flow matrix only has 129 transitions (discarded 7 similar events)
[2024-06-01 12:43:40] [INFO ] Invariant cache hit.
[2024-06-01 12:43:40] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 12:43:40] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 157 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/66 places, 136/149 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 50 transition count 128
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 50 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 48 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 48 transition count 126
Applied a total of 20 rules in 7 ms. Remains 48 /58 variables (removed 10) and now considering 126/136 (removed 10) transitions.
[2024-06-01 12:43:40] [INFO ] Flow matrix only has 119 transitions (discarded 7 similar events)
// Phase 1: matrix 119 rows 48 cols
[2024-06-01 12:43:40] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 12:43:40] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 12:43:40] [INFO ] Flow matrix only has 119 transitions (discarded 7 similar events)
[2024-06-01 12:43:40] [INFO ] Invariant cache hit.
[2024-06-01 12:43:40] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:43:40] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 48/66 places, 126/149 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 275 ms. Remains : 48/66 places, 126/149 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 116 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05a-LTLCardinality-02 finished in 979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U X(p2))||p0))))'
Support contains 7 out of 66 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 149/149 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 66 transition count 141
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 58 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 54 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 54 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 52 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 52 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 52 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 51 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 51 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 51 transition count 128
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 49 place count 43 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 39 transition count 116
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 39 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 38 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 38 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 37 transition count 109
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 37 transition count 109
Applied a total of 69 rules in 38 ms. Remains 37 /66 variables (removed 29) and now considering 109/149 (removed 40) transitions.
[2024-06-01 12:43:41] [INFO ] Flow matrix only has 102 transitions (discarded 7 similar events)
// Phase 1: matrix 102 rows 37 cols
[2024-06-01 12:43:41] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:43:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 12:43:41] [INFO ] Flow matrix only has 102 transitions (discarded 7 similar events)
[2024-06-01 12:43:41] [INFO ] Invariant cache hit.
[2024-06-01 12:43:41] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-01 12:43:41] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/66 places, 109/149 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 36 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 34 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 34 transition count 107
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 26 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 26 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 1 with 52 rules applied. Total rules applied 73 place count 26 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 24 transition count 50
Applied a total of 77 rules in 13 ms. Remains 24 /36 variables (removed 12) and now considering 50/109 (removed 59) transitions.
[2024-06-01 12:43:41] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 24 cols
[2024-06-01 12:43:41] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:43:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 12:43:41] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2024-06-01 12:43:41] [INFO ] Invariant cache hit.
[2024-06-01 12:43:41] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 12:43:41] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/66 places, 50/149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 24/66 places, 50/149 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05a-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 1 reset in 113 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 552 steps (17 resets) in 19 ms. (27 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 7 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-06-01 12:43:42] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2024-06-01 12:43:42] [INFO ] Invariant cache hit.
[2024-06-01 12:43:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 12:43:42] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2024-06-01 12:43:42] [INFO ] Invariant cache hit.
[2024-06-01 12:43:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 12:43:42] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 12:43:42] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 12:43:42] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2024-06-01 12:43:42] [INFO ] Invariant cache hit.
[2024-06-01 12:43:42] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 12:43:42] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:43:42] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:43:42] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:42] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:43:42] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:43:42] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:43:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:43:43] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 43/67 variables, 24/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/68 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 69 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 12:43:44] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:43:44] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:43:44] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 43/67 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 49/120 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 1/68 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/68 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 121 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1337 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 26/26 constraints]
After SMT, in 2747ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2748ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2821 ms. Remains : 24/24 places, 50/50 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 171 steps (4 resets) in 6 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 64 ms.
Product exploration explored 100000 steps with 0 reset in 58 ms.
Support contains 7 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 50/50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 21 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 21 transition count 41
Applied a total of 12 rules in 4 ms. Remains 21 /24 variables (removed 3) and now considering 41/50 (removed 9) transitions.
[2024-06-01 12:43:46] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
// Phase 1: matrix 34 rows 21 cols
[2024-06-01 12:43:46] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:43:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 12:43:46] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2024-06-01 12:43:46] [INFO ] Invariant cache hit.
[2024-06-01 12:43:46] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 12:43:46] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-01 12:43:46] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-06-01 12:43:46] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2024-06-01 12:43:46] [INFO ] Invariant cache hit.
[2024-06-01 12:43:46] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:43:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:43:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:43:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:43:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 12:43:47] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:43:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 33/54 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 1/55 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/55 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 62 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1382 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 12:43:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 33/54 variables, 21/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 40/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 1/55 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/55 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 103 constraints, problems are : Problem set: 0 solved, 40 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 26/26 constraints]
After SMT, in 2356ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2356ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/24 places, 41/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2443 ms. Remains : 21/24 places, 41/50 transitions.
Treatment of property StigmergyElection-PT-05a-LTLCardinality-04 finished in 7281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 64 transition count 129
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 45 transition count 129
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 45 transition count 121
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 37 transition count 121
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 32 transition count 113
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 32 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 32 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 31 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 31 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 74 place count 31 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 86 place count 25 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 91 place count 25 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 5 with 56 rules applied. Total rules applied 147 place count 25 transition count 37
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 157 place count 20 transition count 32
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 162 place count 15 transition count 27
Applied a total of 162 rules in 13 ms. Remains 15 /66 variables (removed 51) and now considering 27/149 (removed 122) transitions.
[2024-06-01 12:43:48] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 15 cols
[2024-06-01 12:43:48] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:43:48] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 12:43:48] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-06-01 12:43:48] [INFO ] Invariant cache hit.
[2024-06-01 12:43:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 12:43:48] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-01 12:43:48] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-06-01 12:43:48] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-06-01 12:43:48] [INFO ] Invariant cache hit.
[2024-06-01 12:43:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 5/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/35 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/36 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/36 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 38 constraints, problems are : Problem set: 0 solved, 17 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 5/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:43:49] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 20/35 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/36 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/36 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 57 constraints, problems are : Problem set: 0 solved, 17 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 23/23 constraints]
After SMT, in 973ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 973ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/66 places, 27/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1122 ms. Remains : 15/66 places, 27/149 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLCardinality-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLCardinality-07 finished in 1211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 64 transition count 128
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 44 transition count 128
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 41 place count 44 transition count 121
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 37 transition count 121
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 30 transition count 110
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 30 transition count 110
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 76 place count 30 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 76 place count 30 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 29 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 28 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 28 transition count 100
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 88 place count 28 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 98 place count 23 transition count 87
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 103 place count 23 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 5 with 48 rules applied. Total rules applied 151 place count 23 transition count 34
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 161 place count 18 transition count 29
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 166 place count 13 transition count 24
Applied a total of 166 rules in 28 ms. Remains 13 /66 variables (removed 53) and now considering 24/149 (removed 125) transitions.
[2024-06-01 12:43:49] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 13 cols
[2024-06-01 12:43:49] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 12:43:50] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 12:43:50] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2024-06-01 12:43:50] [INFO ] Invariant cache hit.
[2024-06-01 12:43:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 12:43:50] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 12:43:50] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 12:43:50] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2024-06-01 12:43:50] [INFO ] Invariant cache hit.
[2024-06-01 12:43:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 18/31 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/32 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 24 constraints, problems are : Problem set: 0 solved, 13 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:50] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 18/31 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 39 constraints, problems are : Problem set: 0 solved, 13 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 11/11 constraints]
After SMT, in 568ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/66 places, 24/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 658 ms. Remains : 13/66 places, 24/149 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05a-LTLCardinality-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLCardinality-09 finished in 723 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((p0||X((G(p1) U (p0&&G(p1))))))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 149/149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 60 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 58 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 58 transition count 135
Applied a total of 16 rules in 6 ms. Remains 58 /66 variables (removed 8) and now considering 135/149 (removed 14) transitions.
[2024-06-01 12:43:50] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2024-06-01 12:43:50] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:43:50] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 12:43:50] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2024-06-01 12:43:50] [INFO ] Invariant cache hit.
[2024-06-01 12:43:50] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 12:43:50] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/66 places, 135/149 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 49 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 49 transition count 127
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 45 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 45 transition count 123
Applied a total of 24 rules in 4 ms. Remains 45 /57 variables (removed 12) and now considering 123/135 (removed 12) transitions.
[2024-06-01 12:43:50] [INFO ] Flow matrix only has 117 transitions (discarded 6 similar events)
// Phase 1: matrix 117 rows 45 cols
[2024-06-01 12:43:50] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 12:43:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 12:43:50] [INFO ] Flow matrix only has 117 transitions (discarded 6 similar events)
[2024-06-01 12:43:50] [INFO ] Invariant cache hit.
[2024-06-01 12:43:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:43:50] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 45/66 places, 123/149 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 238 ms. Remains : 45/66 places, 123/149 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05a-LTLCardinality-10
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLCardinality-10 finished in 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&((X(G(p1)) U p2)||(F(p1)&&p3))))))'
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 149/149 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 64 transition count 133
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 49 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 48 transition count 132
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 33 place count 48 transition count 124
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 49 place count 40 transition count 124
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 55 place count 34 transition count 115
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 34 transition count 115
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 68 place count 34 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 34 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 33 transition count 107
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 4 with 8 rules applied. Total rules applied 78 place count 29 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 29 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 5 with 52 rules applied. Total rules applied 132 place count 29 transition count 49
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 5 with 8 rules applied. Total rules applied 140 place count 25 transition count 45
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 25 transition count 45
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 143 place count 25 transition count 44
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 147 place count 21 transition count 40
Applied a total of 147 rules in 22 ms. Remains 21 /66 variables (removed 45) and now considering 40/149 (removed 109) transitions.
[2024-06-01 12:43:51] [INFO ] Flow matrix only has 33 transitions (discarded 7 similar events)
// Phase 1: matrix 33 rows 21 cols
[2024-06-01 12:43:51] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:43:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 12:43:51] [INFO ] Flow matrix only has 33 transitions (discarded 7 similar events)
[2024-06-01 12:43:51] [INFO ] Invariant cache hit.
[2024-06-01 12:43:51] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 12:43:51] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 12:43:51] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 12:43:51] [INFO ] Flow matrix only has 33 transitions (discarded 7 similar events)
[2024-06-01 12:43:51] [INFO ] Invariant cache hit.
[2024-06-01 12:43:51] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 32/53 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 12:43:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:43:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1/54 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 54 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 12:43:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:43:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 32/53 variables, 21/45 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 39/94 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1/54 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/54 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/54 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 95 constraints, problems are : Problem set: 0 solved, 39 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 22/22 constraints]
After SMT, in 1699ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1701ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/66 places, 40/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1777 ms. Remains : 21/66 places, 40/149 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-05a-LTLCardinality-11
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA StigmergyElection-PT-05a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05a-LTLCardinality-11 finished in 2062 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(p1)||X(G(p2))||p0))))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 149/149 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 63 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 145
Applied a total of 6 rules in 7 ms. Remains 63 /66 variables (removed 3) and now considering 145/149 (removed 4) transitions.
[2024-06-01 12:43:53] [INFO ] Flow matrix only has 137 transitions (discarded 8 similar events)
// Phase 1: matrix 137 rows 63 cols
[2024-06-01 12:43:53] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 12:43:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 12:43:53] [INFO ] Flow matrix only has 137 transitions (discarded 8 similar events)
[2024-06-01 12:43:53] [INFO ] Invariant cache hit.
[2024-06-01 12:43:53] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 12:43:53] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-06-01 12:43:53] [INFO ] Flow matrix only has 137 transitions (discarded 8 similar events)
[2024-06-01 12:43:53] [INFO ] Invariant cache hit.
[2024-06-01 12:43:53] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-06-01 12:43:53] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:43:53] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:43:54] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:43:55] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 136/199 variables, 63/105 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 85/190 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/200 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-06-01 12:43:58] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/200 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 192 constraints, problems are : Problem set: 0 solved, 144 unsolved in 7954 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-06-01 12:44:01] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:44:01] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:44:01] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:44:01] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:44:02] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-06-01 12:44:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:44:02] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:44:02] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:44:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:44:02] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 136/199 variables, 63/116 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 85/201 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 144/345 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 1/200 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 346 constraints, problems are : Problem set: 0 solved, 144 unsolved in 8684 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 51/51 constraints]
After SMT, in 16769ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 16772ms
Starting structural reductions in LTL mode, iteration 1 : 63/66 places, 145/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16906 ms. Remains : 63/66 places, 145/149 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05a-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 113 ms.
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05a-LTLCardinality-13 finished in 17406 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&&F(p1)))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 149/149 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 60 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 58 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 58 transition count 135
Applied a total of 16 rules in 7 ms. Remains 58 /66 variables (removed 8) and now considering 135/149 (removed 14) transitions.
[2024-06-01 12:44:10] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
// Phase 1: matrix 129 rows 58 cols
[2024-06-01 12:44:10] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:44:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 12:44:10] [INFO ] Flow matrix only has 129 transitions (discarded 6 similar events)
[2024-06-01 12:44:10] [INFO ] Invariant cache hit.
[2024-06-01 12:44:10] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 12:44:10] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 142 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/66 places, 135/149 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 49 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 49 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 46 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 46 transition count 124
Applied a total of 22 rules in 4 ms. Remains 46 /57 variables (removed 11) and now considering 124/135 (removed 11) transitions.
[2024-06-01 12:44:10] [INFO ] Flow matrix only has 118 transitions (discarded 6 similar events)
// Phase 1: matrix 118 rows 46 cols
[2024-06-01 12:44:10] [INFO ] Computed 1 invariants in 5 ms
[2024-06-01 12:44:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 12:44:10] [INFO ] Flow matrix only has 118 transitions (discarded 6 similar events)
[2024-06-01 12:44:10] [INFO ] Invariant cache hit.
[2024-06-01 12:44:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 12:44:10] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/66 places, 124/149 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 252 ms. Remains : 46/66 places, 124/149 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05a-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05a-LTLCardinality-15 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U X(p2))||p0))))'
[2024-06-01 12:44:11] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:44:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 12:44:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 149 transitions and 887 arcs took 5 ms.
Total runtime 52122 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-05a-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717245851739

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
ltl formula name StigmergyElection-PT-05a-LTLCardinality-04
ltl formula formula --ltl=/tmp/1643/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 66 places, 149 transitions and 887 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1643/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1643/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1643/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1643/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 68 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 67, there are 222 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 251
pnml2lts-mc( 0/ 4): unique states count: 4402
pnml2lts-mc( 0/ 4): unique transitions count: 26016
pnml2lts-mc( 0/ 4): - self-loop count: 4416
pnml2lts-mc( 0/ 4): - claim dead count: 576
pnml2lts-mc( 0/ 4): - claim found count: 16761
pnml2lts-mc( 0/ 4): - claim success count: 4467
pnml2lts-mc( 0/ 4): - cum. max stack depth: 104
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4474 states 26556 transitions, fanout: 5.936
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 111850, Transitions per second: 663900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 8.9 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 149 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

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