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-171690531900260.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-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531900260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:54 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 71K 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-02b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717244715125

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:25:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:25:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:25:16] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-01 12:25:16] [INFO ] Transformed 291 places.
[2024-06-01 12:25:16] [INFO ] Transformed 332 transitions.
[2024-06-01 12:25:16] [INFO ] Found NUPN structural information;
[2024-06-01 12:25:16] [INFO ] Parsed PT model containing 291 places and 332 transitions and 734 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyElection-PT-02b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 265 transition count 306
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 265 transition count 306
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 251 transition count 292
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 251 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 247 transition count 288
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 247 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 245 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 245 transition count 286
Applied a total of 92 rules in 76 ms. Remains 245 /291 variables (removed 46) and now considering 286/332 (removed 46) transitions.
// Phase 1: matrix 286 rows 245 cols
[2024-06-01 12:25:16] [INFO ] Computed 3 invariants in 22 ms
[2024-06-01 12:25:17] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-06-01 12:25:17] [INFO ] Invariant cache hit.
[2024-06-01 12:25:17] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-06-01 12:25:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-01 12:25:20] [INFO ] Deduced a trap composed of 100 places in 186 ms of which 17 ms to minimize.
[2024-06-01 12:25:20] [INFO ] Deduced a trap composed of 198 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:25:21] [INFO ] Deduced a trap composed of 169 places in 121 ms of which 25 ms to minimize.
[2024-06-01 12:25:21] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 2 ms to minimize.
[2024-06-01 12:25:21] [INFO ] Deduced a trap composed of 167 places in 493 ms of which 3 ms to minimize.
[2024-06-01 12:25:21] [INFO ] Deduced a trap composed of 169 places in 129 ms of which 2 ms to minimize.
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 170 places in 109 ms of which 1 ms to minimize.
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 172 places in 82 ms of which 17 ms to minimize.
[2024-06-01 12:25:22] [INFO ] Deduced a trap composed of 173 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-01 12:25:23] [INFO ] Deduced a trap composed of 170 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:25:23] [INFO ] Deduced a trap composed of 103 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 286/531 variables, 245/259 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 259 constraints, problems are : Problem set: 0 solved, 285 unsolved in 16097 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/531 variables, 245/259 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 285/544 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-01 12:25:37] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 545 constraints, problems are : Problem set: 0 solved, 285 unsolved in 16061 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 12/12 constraints]
After SMT, in 32239ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 32262ms
Starting structural reductions in LTL mode, iteration 1 : 245/291 places, 286/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32781 ms. Remains : 245/291 places, 286/332 transitions.
Support contains 32 out of 245 places after structural reductions.
[2024-06-01 12:25:49] [INFO ] Flatten gal took : 39 ms
[2024-06-01 12:25:49] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:25:49] [INFO ] Input system was already deterministic with 286 transitions.
Support contains 27 out of 245 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (423 resets) in 1624 ms. (24 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40001 steps (193 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
[2024-06-01 12:25:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/531 variables, 245/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/531 variables, 245/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 249 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 89 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 13 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyElection-PT-02b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 33 stabilizing places and 35 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' '!((G(p0) U (p1||F(p2))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Graph (trivial) has 236 edges and 245 vertex of which 29 / 245 are part of one of the 5 SCC in 3 ms
Free SCC test removed 24 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 220 transition count 119
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 146 rules applied. Total rules applied 286 place count 81 transition count 112
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 297 place count 77 transition count 105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 304 place count 70 transition count 105
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 304 place count 70 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 318 place count 63 transition count 98
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 324 place count 57 transition count 92
Iterating global reduction 4 with 6 rules applied. Total rules applied 330 place count 57 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 330 place count 57 transition count 91
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 332 place count 56 transition count 91
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 334 place count 54 transition count 84
Iterating global reduction 4 with 2 rules applied. Total rules applied 336 place count 54 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 338 place count 54 transition count 82
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 368 place count 39 transition count 67
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 374 place count 33 transition count 56
Iterating global reduction 5 with 6 rules applied. Total rules applied 380 place count 33 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 383 place count 33 transition count 53
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 384 place count 32 transition count 51
Iterating global reduction 6 with 1 rules applied. Total rules applied 385 place count 32 transition count 51
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 393 place count 28 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 394 place count 28 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 396 place count 28 transition count 49
Applied a total of 396 rules in 64 ms. Remains 28 /245 variables (removed 217) and now considering 49/286 (removed 237) transitions.
[2024-06-01 12:25:51] [INFO ] Flow matrix only has 47 transitions (discarded 2 similar events)
// Phase 1: matrix 47 rows 28 cols
[2024-06-01 12:25:51] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:25:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 12:25:51] [INFO ] Flow matrix only has 47 transitions (discarded 2 similar events)
[2024-06-01 12:25:51] [INFO ] Invariant cache hit.
[2024-06-01 12:25:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 12:25:51] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-01 12:25:51] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-01 12:25:51] [INFO ] Flow matrix only has 47 transitions (discarded 2 similar events)
[2024-06-01 12:25:51] [INFO ] Invariant cache hit.
[2024-06-01 12:25:51] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 12:25:51] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:25:51] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 12:25:51] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 46/74 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 1/75 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 12:25:51] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/75 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 38 constraints, problems are : Problem set: 0 solved, 44 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 46/74 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 1/75 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/75 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 82 constraints, problems are : Problem set: 0 solved, 44 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 4/4 constraints]
After SMT, in 1338ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1339ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/245 places, 49/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1486 ms. Remains : 28/245 places, 49/286 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-00
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-00 finished in 1798 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((G(p0)||(!p0 U (p1||G(!p0)))))))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Graph (trivial) has 246 edges and 245 vertex of which 36 / 245 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 214 transition count 108
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 145 rules applied. Total rules applied 289 place count 71 transition count 106
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 291 place count 70 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 292 place count 69 transition count 105
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 292 place count 69 transition count 99
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 304 place count 63 transition count 99
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 309 place count 58 transition count 94
Iterating global reduction 4 with 5 rules applied. Total rules applied 314 place count 58 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 314 place count 58 transition count 93
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 316 place count 57 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 318 place count 55 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 320 place count 55 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 322 place count 55 transition count 84
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 354 place count 39 transition count 68
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 361 place count 32 transition count 55
Iterating global reduction 5 with 7 rules applied. Total rules applied 368 place count 32 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 371 place count 32 transition count 52
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 31 transition count 50
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 31 transition count 50
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 381 place count 27 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 385 place count 27 transition count 47
Applied a total of 385 rules in 27 ms. Remains 27 /245 variables (removed 218) and now considering 47/286 (removed 239) transitions.
[2024-06-01 12:25:52] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
// Phase 1: matrix 44 rows 27 cols
[2024-06-01 12:25:52] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:25:52] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 12:25:52] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-01 12:25:52] [INFO ] Invariant cache hit.
[2024-06-01 12:25:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:25:52] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-01 12:25:52] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-01 12:25:52] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-01 12:25:52] [INFO ] Invariant cache hit.
[2024-06-01 12:25:52] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:25:53] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:25:53] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:25:53] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 43/70 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/71 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 37 constraints, problems are : Problem set: 0 solved, 42 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 43/70 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 42/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/71 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/71 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 79 constraints, problems are : Problem set: 0 solved, 42 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints]
After SMT, in 1245ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1245ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/245 places, 47/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1375 ms. Remains : 27/245 places, 47/286 transitions.
Stuttering acceptance computed with spot in 93 ms :[false, false]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 7 reset in 71 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[false, false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 635 steps (94 resets) in 24 ms. (25 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 237 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[false, false]
Stuttering acceptance computed with spot in 173 ms :[false, false]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 47/47 transitions.
Applied a total of 0 rules in 6 ms. Remains 27 /27 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-06-01 12:25:55] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-01 12:25:55] [INFO ] Invariant cache hit.
[2024-06-01 12:25:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 12:25:55] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-01 12:25:55] [INFO ] Invariant cache hit.
[2024-06-01 12:25:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:25:55] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-01 12:25:55] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-01 12:25:55] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-01 12:25:55] [INFO ] Invariant cache hit.
[2024-06-01 12:25:55] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:25:55] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:25:55] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:25:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 43/70 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/71 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 37 constraints, problems are : Problem set: 0 solved, 42 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 43/70 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 42/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/71 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/71 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 79 constraints, problems are : Problem set: 0 solved, 42 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints]
After SMT, in 1238ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1239ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1329 ms. Remains : 27/27 places, 47/47 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[false, false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1921 steps (294 resets) in 25 ms. (73 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 211 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[false, false]
Stuttering acceptance computed with spot in 92 ms :[false, false]
Stuttering acceptance computed with spot in 82 ms :[false, false]
Product exploration explored 100000 steps with 41 reset in 127 ms.
Product exploration explored 100000 steps with 15 reset in 56 ms.
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-06-01 12:25:57] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-01 12:25:57] [INFO ] Invariant cache hit.
[2024-06-01 12:25:57] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 12:25:57] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-01 12:25:57] [INFO ] Invariant cache hit.
[2024-06-01 12:25:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:25:57] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-06-01 12:25:57] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-01 12:25:57] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-01 12:25:57] [INFO ] Invariant cache hit.
[2024-06-01 12:25:57] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:25:57] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:25:57] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:25:57] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 43/70 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/71 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 37 constraints, problems are : Problem set: 0 solved, 42 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 43/70 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 42/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/71 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/71 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 79 constraints, problems are : Problem set: 0 solved, 42 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints]
After SMT, in 1175ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1175ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1290 ms. Remains : 27/27 places, 47/47 transitions.
Treatment of property StigmergyElection-PT-02b-LTLFireability-01 finished in 6040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 235 transition count 276
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 235 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 230 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 230 transition count 271
Applied a total of 30 rules in 11 ms. Remains 230 /245 variables (removed 15) and now considering 271/286 (removed 15) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-06-01 12:25:58] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 12:25:58] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 12:25:58] [INFO ] Invariant cache hit.
[2024-06-01 12:25:58] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-01 12:25:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-01 12:26:01] [INFO ] Deduced a trap composed of 164 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:26:02] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:26:02] [INFO ] Deduced a trap composed of 165 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:26:02] [INFO ] Deduced a trap composed of 166 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:26:02] [INFO ] Deduced a trap composed of 166 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:26:02] [INFO ] Deduced a trap composed of 164 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-01 12:26:06] [INFO ] Deduced a trap composed of 163 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 240 constraints, problems are : Problem set: 0 solved, 270 unsolved in 13519 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-01 12:26:13] [INFO ] Deduced a trap composed of 164 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 271/501 variables, 230/241 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 270/511 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-01 12:26:19] [INFO ] Deduced a trap composed of 162 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/501 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 512 constraints, problems are : Problem set: 0 solved, 270 unsolved in 17591 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 31142ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 31146ms
Starting structural reductions in LTL mode, iteration 1 : 230/245 places, 271/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31315 ms. Remains : 230/245 places, 271/286 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-02
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-02 finished in 31480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 234 transition count 275
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 234 transition count 275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 228 transition count 269
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 228 transition count 269
Applied a total of 34 rules in 14 ms. Remains 228 /245 variables (removed 17) and now considering 269/286 (removed 17) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-06-01 12:26:30] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 12:26:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 12:26:30] [INFO ] Invariant cache hit.
[2024-06-01 12:26:30] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-06-01 12:26:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 12:26:33] [INFO ] Deduced a trap composed of 164 places in 74 ms of which 5 ms to minimize.
[2024-06-01 12:26:33] [INFO ] Deduced a trap composed of 164 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:26:33] [INFO ] Deduced a trap composed of 163 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:26:33] [INFO ] Deduced a trap composed of 162 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 12:26:40] [INFO ] Deduced a trap composed of 162 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 15051 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11571 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 26648ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 26652ms
Starting structural reductions in LTL mode, iteration 1 : 228/245 places, 269/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26903 ms. Remains : 228/245 places, 269/286 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-03 finished in 27152 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)||G(F(p1))))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Graph (trivial) has 246 edges and 245 vertex of which 35 / 245 are part of one of the 6 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 215 transition count 106
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 149 rules applied. Total rules applied 297 place count 68 transition count 104
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 299 place count 67 transition count 103
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 302 place count 66 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 65 transition count 101
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 303 place count 65 transition count 96
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 313 place count 60 transition count 96
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 318 place count 55 transition count 91
Iterating global reduction 5 with 5 rules applied. Total rules applied 323 place count 55 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 323 place count 55 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 325 place count 54 transition count 90
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 327 place count 52 transition count 83
Iterating global reduction 5 with 2 rules applied. Total rules applied 329 place count 52 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 331 place count 52 transition count 81
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 363 place count 36 transition count 65
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 369 place count 30 transition count 54
Iterating global reduction 6 with 6 rules applied. Total rules applied 375 place count 30 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 378 place count 30 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 384 place count 27 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 388 place count 27 transition count 48
Applied a total of 388 rules in 33 ms. Remains 27 /245 variables (removed 218) and now considering 48/286 (removed 238) transitions.
[2024-06-01 12:26:57] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
// Phase 1: matrix 44 rows 27 cols
[2024-06-01 12:26:57] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:26:57] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 12:26:57] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
[2024-06-01 12:26:57] [INFO ] Invariant cache hit.
[2024-06-01 12:26:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:26:57] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 12:26:57] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 12:26:57] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
[2024-06-01 12:26:57] [INFO ] Invariant cache hit.
[2024-06-01 12:26:57] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 12:26:57] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
[2024-06-01 12:26:57] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:26:57] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 43/70 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/71 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 37 constraints, problems are : Problem set: 0 solved, 43 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 12:26:58] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 43/70 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 1/71 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/71 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 81 constraints, problems are : Problem set: 0 solved, 43 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 4/4 constraints]
After SMT, in 1288ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1289ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/245 places, 48/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1396 ms. Remains : 27/245 places, 48/286 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-05
Product exploration explored 100000 steps with 15 reset in 66 ms.
Product exploration explored 100000 steps with 2 reset in 60 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 105 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 732 steps (121 resets) in 6 ms. (104 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 27 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 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-01 12:26:59] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
[2024-06-01 12:26:59] [INFO ] Invariant cache hit.
[2024-06-01 12:26:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 12:26:59] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
[2024-06-01 12:26:59] [INFO ] Invariant cache hit.
[2024-06-01 12:26:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:26:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 12:26:59] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 12:26:59] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
[2024-06-01 12:26:59] [INFO ] Invariant cache hit.
[2024-06-01 12:26:59] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 12:26:59] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:26:59] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:26:59] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 43/70 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/71 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 37 constraints, problems are : Problem set: 0 solved, 43 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 12:27:00] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 43/70 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 1/71 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/71 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 81 constraints, problems are : Problem set: 0 solved, 43 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 4/4 constraints]
After SMT, in 1264ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1265ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1344 ms. Remains : 27/27 places, 48/48 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1539 steps (239 resets) in 13 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 48 reset in 56 ms.
Product exploration explored 100000 steps with 24 reset in 63 ms.
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 48/48 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 25 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 25 transition count 46
Applied a total of 4 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 46/48 (removed 2) transitions.
[2024-06-01 12:27:01] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 25 cols
[2024-06-01 12:27:01] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:27:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 12:27:01] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2024-06-01 12:27:01] [INFO ] Invariant cache hit.
[2024-06-01 12:27:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:27:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 12:27:01] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
[2024-06-01 12:27:01] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2024-06-01 12:27:01] [INFO ] Invariant cache hit.
[2024-06-01 12:27:01] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:27:01] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:27:01] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 12:27:01] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 41/66 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 1/67 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/67 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 35 constraints, problems are : Problem set: 0 solved, 41 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 41/66 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 41/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 1/67 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/67 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 76 constraints, problems are : Problem set: 0 solved, 41 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints]
After SMT, in 1112ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1112ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/27 places, 46/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1183 ms. Remains : 25/27 places, 46/48 transitions.
Treatment of property StigmergyElection-PT-02b-LTLFireability-05 finished in 5312 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 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Graph (trivial) has 248 edges and 245 vertex of which 36 / 245 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 214 transition count 104
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 151 rules applied. Total rules applied 299 place count 67 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 301 place count 65 transition count 100
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 301 place count 65 transition count 94
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 313 place count 59 transition count 94
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 318 place count 54 transition count 89
Iterating global reduction 3 with 5 rules applied. Total rules applied 323 place count 54 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 323 place count 54 transition count 88
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 325 place count 53 transition count 88
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 327 place count 51 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 51 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 331 place count 51 transition count 79
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 361 place count 36 transition count 64
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 368 place count 29 transition count 51
Iterating global reduction 4 with 7 rules applied. Total rules applied 375 place count 29 transition count 51
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 378 place count 29 transition count 48
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 379 place count 28 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 380 place count 28 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 386 place count 25 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 388 place count 25 transition count 45
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 389 place count 25 transition count 45
Applied a total of 389 rules in 16 ms. Remains 25 /245 variables (removed 220) and now considering 45/286 (removed 241) transitions.
[2024-06-01 12:27:02] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
// Phase 1: matrix 42 rows 25 cols
[2024-06-01 12:27:02] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:27:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 12:27:02] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2024-06-01 12:27:02] [INFO ] Invariant cache hit.
[2024-06-01 12:27:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:27:03] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-06-01 12:27:03] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-06-01 12:27:03] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2024-06-01 12:27:03] [INFO ] Invariant cache hit.
[2024-06-01 12:27:03] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 12:27:03] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:27:03] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/66 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 1/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 34 constraints, problems are : Problem set: 0 solved, 40 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 12:27:03] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/66 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 40/74 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 1/67 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 0/67 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 75 constraints, problems are : Problem set: 0 solved, 40 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 3/3 constraints]
After SMT, in 1110ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/245 places, 45/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1397 ms. Remains : 25/245 places, 45/286 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-06 finished in 1452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Graph (trivial) has 245 edges and 245 vertex of which 29 / 245 are part of one of the 5 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 151 place count 220 transition count 108
Reduce places removed 150 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 154 rules applied. Total rules applied 305 place count 70 transition count 104
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 68 transition count 103
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 311 place count 67 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 312 place count 66 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 312 place count 66 transition count 95
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 324 place count 60 transition count 95
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 329 place count 55 transition count 90
Iterating global reduction 5 with 5 rules applied. Total rules applied 334 place count 55 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 334 place count 55 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 336 place count 54 transition count 89
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 338 place count 52 transition count 82
Iterating global reduction 5 with 2 rules applied. Total rules applied 340 place count 52 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 342 place count 52 transition count 80
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 372 place count 37 transition count 65
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 378 place count 31 transition count 54
Iterating global reduction 6 with 6 rules applied. Total rules applied 384 place count 31 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 387 place count 31 transition count 51
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 388 place count 30 transition count 49
Iterating global reduction 7 with 1 rules applied. Total rules applied 389 place count 30 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 395 place count 27 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 397 place count 27 transition count 48
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 398 place count 27 transition count 48
Applied a total of 398 rules in 17 ms. Remains 27 /245 variables (removed 218) and now considering 48/286 (removed 238) transitions.
[2024-06-01 12:27:04] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 27 cols
[2024-06-01 12:27:04] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:27:04] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 12:27:04] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
[2024-06-01 12:27:04] [INFO ] Invariant cache hit.
[2024-06-01 12:27:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:27:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 12:27:04] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 12:27:04] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
[2024-06-01 12:27:04] [INFO ] Invariant cache hit.
[2024-06-01 12:27:04] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 12:27:04] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:27:04] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 44/71 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/72 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 36 constraints, problems are : Problem set: 0 solved, 43 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 44/71 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 43/78 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 1/72 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 79 constraints, problems are : Problem set: 0 solved, 43 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 2/2 constraints]
After SMT, in 1228ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1229ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/245 places, 48/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1321 ms. Remains : 27/245 places, 48/286 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-08 finished in 1412 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&&(p1 U X(p0))))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 234 transition count 275
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 234 transition count 275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 228 transition count 269
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 228 transition count 269
Applied a total of 34 rules in 15 ms. Remains 228 /245 variables (removed 17) and now considering 269/286 (removed 17) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-06-01 12:27:05] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 12:27:05] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 12:27:05] [INFO ] Invariant cache hit.
[2024-06-01 12:27:05] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-06-01 12:27:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 12:27:08] [INFO ] Deduced a trap composed of 164 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:27:08] [INFO ] Deduced a trap composed of 164 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:27:09] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:27:09] [INFO ] Deduced a trap composed of 162 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-01 12:27:15] [INFO ] Deduced a trap composed of 162 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 15130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11366 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 26529ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 26533ms
Starting structural reductions in LTL mode, iteration 1 : 228/245 places, 269/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26727 ms. Remains : 228/245 places, 269/286 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-09
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-09 finished in 26923 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)&&F(G((p1&&(p2 U p3)))))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Graph (trivial) has 235 edges and 245 vertex of which 36 / 245 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 214 transition count 116
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 139 rules applied. Total rules applied 275 place count 79 transition count 112
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 10 rules applied. Total rules applied 285 place count 77 transition count 104
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 293 place count 69 transition count 104
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 293 place count 69 transition count 98
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 305 place count 63 transition count 98
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 312 place count 56 transition count 91
Iterating global reduction 4 with 7 rules applied. Total rules applied 319 place count 56 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 319 place count 56 transition count 90
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 321 place count 55 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 323 place count 53 transition count 83
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 53 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 327 place count 53 transition count 81
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 357 place count 38 transition count 66
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 364 place count 31 transition count 53
Iterating global reduction 5 with 7 rules applied. Total rules applied 371 place count 31 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 374 place count 31 transition count 50
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 376 place count 29 transition count 46
Iterating global reduction 6 with 2 rules applied. Total rules applied 378 place count 29 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 382 place count 27 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 384 place count 27 transition count 45
Applied a total of 384 rules in 30 ms. Remains 27 /245 variables (removed 218) and now considering 45/286 (removed 241) transitions.
[2024-06-01 12:27:32] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
// Phase 1: matrix 43 rows 27 cols
[2024-06-01 12:27:32] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:27:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 12:27:32] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
[2024-06-01 12:27:32] [INFO ] Invariant cache hit.
[2024-06-01 12:27:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 12:27:32] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 12:27:32] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-01 12:27:32] [INFO ] Flow matrix only has 43 transitions (discarded 2 similar events)
[2024-06-01 12:27:32] [INFO ] Invariant cache hit.
[2024-06-01 12:27:32] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:27:32] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:27:32] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:27:32] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 42/69 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/70 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 36 constraints, problems are : Problem set: 0 solved, 42 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 42/69 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 42/77 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 12:27:33] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 1/70 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/70 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 79 constraints, problems are : Problem set: 0 solved, 42 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 4/4 constraints]
After SMT, in 1295ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1295ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/245 places, 45/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1406 ms. Remains : 27/245 places, 45/286 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-10 finished in 1696 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 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Graph (trivial) has 248 edges and 245 vertex of which 36 / 245 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 214 transition count 106
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 149 rules applied. Total rules applied 295 place count 69 transition count 102
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 298 place count 67 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 299 place count 66 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 299 place count 66 transition count 95
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 311 place count 60 transition count 95
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 316 place count 55 transition count 90
Iterating global reduction 4 with 5 rules applied. Total rules applied 321 place count 55 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 321 place count 55 transition count 89
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 323 place count 54 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 325 place count 52 transition count 82
Iterating global reduction 4 with 2 rules applied. Total rules applied 327 place count 52 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 329 place count 52 transition count 80
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 361 place count 36 transition count 64
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 368 place count 29 transition count 51
Iterating global reduction 5 with 7 rules applied. Total rules applied 375 place count 29 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 377 place count 29 transition count 49
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 379 place count 27 transition count 45
Iterating global reduction 6 with 2 rules applied. Total rules applied 381 place count 27 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 387 place count 24 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 389 place count 24 transition count 44
Applied a total of 389 rules in 20 ms. Remains 24 /245 variables (removed 221) and now considering 44/286 (removed 242) transitions.
[2024-06-01 12:27:34] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 24 cols
[2024-06-01 12:27:34] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:27:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 12:27:34] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-01 12:27:34] [INFO ] Invariant cache hit.
[2024-06-01 12:27:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:27:34] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 12:27:34] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 12:27:34] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-01 12:27:34] [INFO ] Invariant cache hit.
[2024-06-01 12:27:34] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/64 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 33 constraints, problems are : Problem set: 0 solved, 39 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 24/24 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 12:27:34] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 40/64 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 39/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 1/65 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/65 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 73 constraints, problems are : Problem set: 0 solved, 39 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 24/24 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 1060ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1060ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/245 places, 44/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1148 ms. Remains : 24/245 places, 44/286 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-13
Product exploration explored 100000 steps with 6 reset in 35 ms.
Product exploration explored 100000 steps with 172 reset in 30 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 95 steps (10 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 44/44 transitions.
Applied a total of 0 rules in 5 ms. Remains 24 /24 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-06-01 12:27:35] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-01 12:27:35] [INFO ] Invariant cache hit.
[2024-06-01 12:27:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 12:27:36] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-01 12:27:36] [INFO ] Invariant cache hit.
[2024-06-01 12:27:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:27:36] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 12:27:36] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 12:27:36] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-01 12:27:36] [INFO ] Invariant cache hit.
[2024-06-01 12:27:36] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 12:27:36] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:27:36] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/64 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 33 constraints, problems are : Problem set: 0 solved, 39 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 24/24 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 12:27:36] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 40/64 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 39/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 1/65 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/65 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 73 constraints, problems are : Problem set: 0 solved, 39 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 24/24 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 1067ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1068ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1146 ms. Remains : 24/24 places, 44/44 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 163 steps (22 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 246 steps with 37 reset in 2 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-13 finished in 3423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 286/286 transitions.
Graph (trivial) has 244 edges and 245 vertex of which 36 / 245 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 214 transition count 107
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 148 rules applied. Total rules applied 293 place count 70 transition count 103
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 296 place count 68 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 297 place count 67 transition count 102
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 297 place count 67 transition count 96
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 309 place count 61 transition count 96
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 313 place count 57 transition count 92
Iterating global reduction 4 with 4 rules applied. Total rules applied 317 place count 57 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 317 place count 57 transition count 91
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 319 place count 56 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 320 place count 55 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 321 place count 55 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 322 place count 55 transition count 86
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 354 place count 39 transition count 70
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 360 place count 33 transition count 59
Iterating global reduction 5 with 6 rules applied. Total rules applied 366 place count 33 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 368 place count 33 transition count 57
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 370 place count 31 transition count 53
Iterating global reduction 6 with 2 rules applied. Total rules applied 372 place count 31 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 376 place count 29 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 378 place count 29 transition count 51
Applied a total of 378 rules in 22 ms. Remains 29 /245 variables (removed 216) and now considering 51/286 (removed 235) transitions.
[2024-06-01 12:27:37] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
// Phase 1: matrix 48 rows 29 cols
[2024-06-01 12:27:37] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:27:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 12:27:37] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-01 12:27:37] [INFO ] Invariant cache hit.
[2024-06-01 12:27:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 12:27:37] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 12:27:37] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-01 12:27:37] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-01 12:27:37] [INFO ] Invariant cache hit.
[2024-06-01 12:27:37] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 12:27:37] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:27:37] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:27:37] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/76 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/77 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 38 constraints, problems are : Problem set: 0 solved, 46 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/76 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 84 constraints, problems are : Problem set: 0 solved, 46 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints]
After SMT, in 1423ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1424ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/245 places, 51/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1523 ms. Remains : 29/245 places, 51/286 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-14
Product exploration explored 100000 steps with 52 reset in 117 ms.
Product exploration explored 100000 steps with 26 reset in 101 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5694 resets) in 124 ms. (320 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1161 resets) in 252 ms. (158 steps per ms) remains 1/1 properties
[2024-06-01 12:27:39] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-01 12:27:39] [INFO ] Invariant cache hit.
[2024-06-01 12:27:39] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/73 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/76 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 35 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:27:39] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
Problem apf1 is UNSAT
After SMT solving in domain Int declared 27/77 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/29 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 82ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 285 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 12:27:40] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-01 12:27:40] [INFO ] Invariant cache hit.
[2024-06-01 12:27:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 12:27:40] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-01 12:27:40] [INFO ] Invariant cache hit.
[2024-06-01 12:27:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 12:27:40] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-06-01 12:27:40] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-01 12:27:40] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-01 12:27:40] [INFO ] Invariant cache hit.
[2024-06-01 12:27:40] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 12:27:40] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:27:40] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:27:40] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/76 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/77 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 38 constraints, problems are : Problem set: 0 solved, 46 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/76 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 84 constraints, problems are : Problem set: 0 solved, 46 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints]
After SMT, in 1342ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1342ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1423 ms. Remains : 29/29 places, 51/51 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5755 resets) in 92 ms. (430 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1097 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2024-06-01 12:27:41] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-01 12:27:41] [INFO ] Invariant cache hit.
[2024-06-01 12:27:41] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/73 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/76 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 35 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:27:41] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
Problem apf1 is UNSAT
After SMT solving in domain Int declared 27/77 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/29 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 95ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 320 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 41 reset in 90 ms.
Product exploration explored 100000 steps with 13 reset in 103 ms.
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 12:27:42] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-01 12:27:42] [INFO ] Invariant cache hit.
[2024-06-01 12:27:42] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 12:27:42] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-01 12:27:42] [INFO ] Invariant cache hit.
[2024-06-01 12:27:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 12:27:42] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-01 12:27:42] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-01 12:27:42] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-06-01 12:27:42] [INFO ] Invariant cache hit.
[2024-06-01 12:27:42] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 12:27:42] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:27:42] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:27:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/76 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/77 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/77 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 38 constraints, problems are : Problem set: 0 solved, 46 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 47/76 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 84 constraints, problems are : Problem set: 0 solved, 46 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 3/3 constraints]
After SMT, in 1369ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1369ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1452 ms. Remains : 29/29 places, 51/51 transitions.
Treatment of property StigmergyElection-PT-02b-LTLFireability-14 finished in 6447 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((G(p0)||(!p0 U (p1||G(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
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)||G(p1))))'
[2024-06-01 12:27:44] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:27:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 12:27:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 245 places, 286 transitions and 642 arcs took 3 ms.
Total runtime 148384 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-02b-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-02b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-02b-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717244867840

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyElection-PT-02b-LTLFireability-01
ltl formula formula --ltl=/tmp/1602/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 245 places, 286 transitions and 642 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.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1602/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1602/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1602/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1602/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 246, there are 298 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( 2/ 4): ~102 levels ~10000 states ~15520 transitions
pnml2lts-mc( 2/ 4): ~104 levels ~20000 states ~43536 transitions
pnml2lts-mc( 2/ 4): ~534 levels ~40000 states ~100032 transitions
pnml2lts-mc( 0/ 4): ~315 levels ~80000 states ~232240 transitions
pnml2lts-mc( 3/ 4): ~1488 levels ~160000 states ~467264 transitions
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: 75188
pnml2lts-mc( 0/ 4): unique states count: 173373
pnml2lts-mc( 0/ 4): unique transitions count: 513949
pnml2lts-mc( 0/ 4): - self-loop count: 120
pnml2lts-mc( 0/ 4): - claim dead count: 154032
pnml2lts-mc( 0/ 4): - claim found count: 190551
pnml2lts-mc( 0/ 4): - claim success count: 175779
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3784
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 176674 states 525427 transitions, fanout: 2.974
pnml2lts-mc( 0/ 4): Total exploration time 1.250 sec (1.250 sec minimum, 1.250 sec on average)
pnml2lts-mc( 0/ 4): States per second: 141339, Transitions per second: 420342
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.4MB, 8.7 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 289 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.4MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-02b-LTLFireability-05
ltl formula formula --ltl=/tmp/1602/ltl_1_
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 245 places, 286 transitions and 642 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.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1602/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1602/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1602/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1602/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 247 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 246, there are 294 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( 1/ 4): ~122 levels ~10000 states ~26016 transitions
pnml2lts-mc( 1/ 4): ~122 levels ~20000 states ~56508 transitions
pnml2lts-mc( 1/ 4): ~133 levels ~40000 states ~115016 transitions
pnml2lts-mc( 0/ 4): ~1190 levels ~80000 states ~222988 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~723!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 35983
pnml2lts-mc( 0/ 4): unique states count: 111343
pnml2lts-mc( 0/ 4): unique transitions count: 325008
pnml2lts-mc( 0/ 4): - self-loop count: 105
pnml2lts-mc( 0/ 4): - claim dead count: 73487
pnml2lts-mc( 0/ 4): - claim found count: 136670
pnml2lts-mc( 0/ 4): - claim success count: 111968
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3983
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 112160 states 327622 transitions, fanout: 2.921
pnml2lts-mc( 0/ 4): Total exploration time 0.790 sec (0.790 sec minimum, 0.790 sec on average)
pnml2lts-mc( 0/ 4): States per second: 141975, Transitions per second: 414711
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.9MB, 8.7 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 289 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.9MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-02b-LTLFireability-14
ltl formula formula --ltl=/tmp/1602/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 245 places, 286 transitions and 642 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1602/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1602/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1602/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1602/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 246, there are 341 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( 1/ 4): ~64 levels ~10000 states ~24808 transitions
pnml2lts-mc( 1/ 4): ~105 levels ~20000 states ~53644 transitions
pnml2lts-mc( 1/ 4): ~321 levels ~40000 states ~107644 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~887!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22915
pnml2lts-mc( 0/ 4): unique states count: 39994
pnml2lts-mc( 0/ 4): unique transitions count: 106537
pnml2lts-mc( 0/ 4): - self-loop count: 111
pnml2lts-mc( 0/ 4): - claim dead count: 42005
pnml2lts-mc( 0/ 4): - claim found count: 20956
pnml2lts-mc( 0/ 4): - claim success count: 40010
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2864
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 40012 states 106595 transitions, fanout: 2.664
pnml2lts-mc( 0/ 4): Total exploration time 0.280 sec (0.280 sec minimum, 0.280 sec on average)
pnml2lts-mc( 0/ 4): States per second: 142900, Transitions per second: 380696
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 9.0 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 289 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~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-02b"
export BK_EXAMINATION="LTLFireability"
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-02b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690531900260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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