Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872700276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyElection-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872700276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 30 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 30 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 30 14:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 30 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.5K May 30 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K May 30 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 30 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 117K May 29 12:20 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-03b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654841293699

Running Version 202205111006
[2022-06-10 06:08:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 06:08:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 06:08:16] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2022-06-10 06:08:16] [INFO ] Transformed 427 places.
[2022-06-10 06:08:16] [INFO ] Transformed 518 transitions.
[2022-06-10 06:08:16] [INFO ] Found NUPN structural information;
[2022-06-10 06:08:16] [INFO ] Parsed PT model containing 427 places and 518 transitions in 446 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyElection-PT-03b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 375 transition count 466
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 375 transition count 466
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 131 place count 348 transition count 439
Iterating global reduction 0 with 27 rules applied. Total rules applied 158 place count 348 transition count 439
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 162 place count 344 transition count 435
Iterating global reduction 0 with 4 rules applied. Total rules applied 166 place count 344 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 167 place count 343 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 168 place count 343 transition count 434
Applied a total of 168 rules in 221 ms. Remains 343 /427 variables (removed 84) and now considering 434/518 (removed 84) transitions.
// Phase 1: matrix 434 rows 343 cols
[2022-06-10 06:08:17] [INFO ] Computed 4 place invariants in 45 ms
[2022-06-10 06:08:17] [INFO ] Implicit Places using invariants in 473 ms returned []
// Phase 1: matrix 434 rows 343 cols
[2022-06-10 06:08:17] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-10 06:08:18] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
// Phase 1: matrix 434 rows 343 cols
[2022-06-10 06:08:18] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:08:18] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/427 places, 434/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 343/427 places, 434/518 transitions.
Support contains 40 out of 343 places after structural reductions.
[2022-06-10 06:08:19] [INFO ] Flatten gal took : 138 ms
[2022-06-10 06:08:19] [INFO ] Flatten gal took : 62 ms
[2022-06-10 06:08:19] [INFO ] Input system was already deterministic with 434 transitions.
Support contains 39 out of 343 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 177 resets, run finished after 982 ms. (steps per millisecond=10 ) properties (out of 32) seen :12
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 434 rows 343 cols
[2022-06-10 06:08:20] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:08:20] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-06-10 06:08:21] [INFO ] After 530ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:11
[2022-06-10 06:08:21] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 10 ms to minimize.
[2022-06-10 06:08:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2022-06-10 06:08:22] [INFO ] Deduced a trap composed of 166 places in 265 ms of which 3 ms to minimize.
[2022-06-10 06:08:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2022-06-10 06:08:22] [INFO ] Deduced a trap composed of 164 places in 313 ms of which 2 ms to minimize.
[2022-06-10 06:08:22] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2022-06-10 06:08:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 638 ms
[2022-06-10 06:08:23] [INFO ] After 2110ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2022-06-10 06:08:23] [INFO ] After 2489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-06-10 06:08:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2022-06-10 06:08:24] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :15
[2022-06-10 06:08:24] [INFO ] Deduced a trap composed of 165 places in 252 ms of which 2 ms to minimize.
[2022-06-10 06:08:24] [INFO ] Deduced a trap composed of 164 places in 271 ms of which 1 ms to minimize.
[2022-06-10 06:08:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 622 ms
[2022-06-10 06:08:25] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 1 ms to minimize.
[2022-06-10 06:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2022-06-10 06:08:25] [INFO ] Deduced a trap composed of 163 places in 188 ms of which 1 ms to minimize.
[2022-06-10 06:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2022-06-10 06:08:26] [INFO ] After 2591ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :15
Attempting to minimize the solution found.
Minimization took 354 ms.
[2022-06-10 06:08:26] [INFO ] After 3518ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :15
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 6 properties in 147 ms.
Support contains 12 out of 343 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 328 edges and 343 vertex of which 41 / 343 are part of one of the 7 SCC in 5 ms
Free SCC test removed 34 places
Drop transitions removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 518 edges and 309 vertex of which 307 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 209 rules applied. Total rules applied 211 place count 307 transition count 179
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 210 rules applied. Total rules applied 421 place count 100 transition count 176
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 427 place count 99 transition count 171
Reduce places removed 5 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 7 rules applied. Total rules applied 434 place count 94 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 435 place count 93 transition count 169
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 435 place count 93 transition count 153
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 467 place count 77 transition count 153
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 468 place count 77 transition count 152
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 469 place count 76 transition count 150
Iterating global reduction 6 with 1 rules applied. Total rules applied 470 place count 76 transition count 150
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 471 place count 75 transition count 148
Iterating global reduction 6 with 1 rules applied. Total rules applied 472 place count 75 transition count 148
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 494 place count 64 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 498 place count 64 transition count 133
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 506 place count 56 transition count 89
Iterating global reduction 7 with 8 rules applied. Total rules applied 514 place count 56 transition count 89
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 521 place count 56 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 525 place count 54 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 533 place count 50 transition count 84
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 539 place count 50 transition count 78
Free-agglomeration rule applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 555 place count 50 transition count 62
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 573 place count 34 transition count 60
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 575 place count 32 transition count 58
Iterating global reduction 9 with 2 rules applied. Total rules applied 577 place count 32 transition count 58
Applied a total of 577 rules in 76 ms. Remains 32 /343 variables (removed 311) and now considering 58/434 (removed 376) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/343 places, 58/434 transitions.
Finished random walk after 4011 steps, including 1 resets, run visited all 9 properties in 85 ms. (steps per millisecond=47 )
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 45 stabilizing places and 48 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 349 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 209 place count 298 transition count 175
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 214 rules applied. Total rules applied 423 place count 90 transition count 169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 426 place count 87 transition count 169
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 426 place count 87 transition count 156
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 452 place count 74 transition count 156
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 457 place count 69 transition count 149
Iterating global reduction 3 with 5 rules applied. Total rules applied 462 place count 69 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 465 place count 66 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 468 place count 66 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 470 place count 64 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 472 place count 64 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 492 place count 54 transition count 130
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 501 place count 45 transition count 88
Iterating global reduction 3 with 9 rules applied. Total rules applied 510 place count 45 transition count 88
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 515 place count 45 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 516 place count 44 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 517 place count 44 transition count 81
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 518 place count 43 transition count 79
Iterating global reduction 4 with 1 rules applied. Total rules applied 519 place count 43 transition count 79
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 537 place count 34 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 538 place count 33 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 539 place count 33 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 540 place count 33 transition count 86
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 543 place count 33 transition count 83
Applied a total of 543 rules in 59 ms. Remains 33 /343 variables (removed 310) and now considering 83/434 (removed 351) transitions.
[2022-06-10 06:08:27] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
// Phase 1: matrix 79 rows 33 cols
[2022-06-10 06:08:27] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 06:08:27] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-06-10 06:08:27] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
// Phase 1: matrix 79 rows 33 cols
[2022-06-10 06:08:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:08:27] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:08:27] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2022-06-10 06:08:27] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-10 06:08:27] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
// Phase 1: matrix 79 rows 33 cols
[2022-06-10 06:08:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:08:27] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/343 places, 83/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/343 places, 83/434 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-00 finished in 771 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 339 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 338 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 338 transition count 429
Applied a total of 10 rules in 45 ms. Remains 338 /343 variables (removed 5) and now considering 429/434 (removed 5) transitions.
// Phase 1: matrix 429 rows 338 cols
[2022-06-10 06:08:28] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-10 06:08:28] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 429 rows 338 cols
[2022-06-10 06:08:28] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-10 06:08:28] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
// Phase 1: matrix 429 rows 338 cols
[2022-06-10 06:08:28] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:08:29] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 338/343 places, 429/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 338/343 places, 429/434 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-01 finished in 1422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!F(G(!G((p0 U p1)))) U X(G(p0))))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 337 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 336 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 336 transition count 427
Applied a total of 14 rules in 47 ms. Remains 336 /343 variables (removed 7) and now considering 427/434 (removed 7) transitions.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:08:29] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:08:29] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:08:29] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-10 06:08:30] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:08:30] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:08:30] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/343 places, 427/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/343 places, 427/434 transitions.
Stuttering acceptance computed with spot in 306 ms :[p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s266 1), p1:(EQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 426 reset in 440 ms.
Product exploration explored 100000 steps with 317 reset in 255 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 78 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 472868 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 472868 steps, saw 108625 distinct states, run finished after 3003 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:08:35] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:08:35] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-06-10 06:08:35] [INFO ] After 178ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-10 06:08:35] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 1 ms to minimize.
[2022-06-10 06:08:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 186 ms
[2022-06-10 06:08:35] [INFO ] After 370ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:1
[2022-06-10 06:08:35] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-06-10 06:08:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-06-10 06:08:36] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-06-10 06:08:36] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 1 ms to minimize.
[2022-06-10 06:08:36] [INFO ] Deduced a trap composed of 218 places in 131 ms of which 1 ms to minimize.
[2022-06-10 06:08:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2022-06-10 06:08:36] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-10 06:08:36] [INFO ] After 760ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 336/336 places, 427/427 transitions.
Graph (trivial) has 339 edges and 336 vertex of which 51 / 336 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 500 edges and 294 vertex of which 291 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 209 rules applied. Total rules applied 211 place count 291 transition count 161
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 210 rules applied. Total rules applied 421 place count 85 transition count 157
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 424 place count 83 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 425 place count 82 transition count 156
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 425 place count 82 transition count 141
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 455 place count 67 transition count 141
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 456 place count 67 transition count 140
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 488 place count 51 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 494 place count 51 transition count 118
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 506 place count 39 transition count 69
Iterating global reduction 6 with 12 rules applied. Total rules applied 518 place count 39 transition count 69
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 525 place count 39 transition count 62
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 526 place count 38 transition count 61
Iterating global reduction 7 with 1 rules applied. Total rules applied 527 place count 38 transition count 61
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 533 place count 35 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 537 place count 33 transition count 60
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 542 place count 33 transition count 55
Free-agglomeration rule applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 558 place count 33 transition count 39
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 577 place count 17 transition count 36
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 580 place count 14 transition count 33
Iterating global reduction 8 with 3 rules applied. Total rules applied 583 place count 14 transition count 33
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 588 place count 14 transition count 28
Applied a total of 588 rules in 30 ms. Remains 14 /336 variables (removed 322) and now considering 28/427 (removed 399) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/336 places, 28/427 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 p0)))
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-03b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03b-LTLFireability-02 finished in 7362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U G((p0 U X(p1)))))'
Support contains 4 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 336 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 335 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 22 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:36] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:08:36] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 06:08:37] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:37] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:08:37] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 124 ms :[p1, p1]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s39 1), p1:(AND (EQ s56 1) (EQ s162 1) (EQ s268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 909 ms.
Product exploration explored 100000 steps with 50000 reset in 636 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 8 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-03b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03b-LTLFireability-03 finished in 2720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X((X(G(p0)) U p1)) U (p1||(F(p2)&&p3))))'
Support contains 6 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 336 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 335 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 22 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:39] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:08:39] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:39] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:08:40] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:40] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:08:40] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), p1, (NOT p2), true, (AND p0 p1), p0]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s175 1), p3:(EQ s53 1), p2:(AND (EQ s95 1) (EQ s200 1) (EQ s306 1)), p0:(EQ s210 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25136 reset in 459 ms.
Product exploration explored 100000 steps with 25014 reset in 328 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Detected a total of 45/335 stabilizing places and 48/426 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 679 ms. Reduced automaton from 6 states, 10 edges and 4 AP to 6 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), p1, (NOT p2), true, (AND p0 p1), p0]
Incomplete random walk after 10000 steps, including 170 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:43] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:08:43] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-06-10 06:08:43] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-06-10 06:08:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-06-10 06:08:43] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-06-10 06:08:43] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 1 ms to minimize.
[2022-06-10 06:08:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2022-06-10 06:08:43] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-10 06:08:43] [INFO ] After 647ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 335 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 335/335 places, 426/426 transitions.
Graph (trivial) has 328 edges and 335 vertex of which 51 / 335 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 499 edges and 293 vertex of which 290 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 290 transition count 169
Reduce places removed 197 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 203 rules applied. Total rules applied 405 place count 93 transition count 163
Reduce places removed 3 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 416 place count 90 transition count 155
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 424 place count 82 transition count 155
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 424 place count 82 transition count 141
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 452 place count 68 transition count 141
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 4 with 32 rules applied. Total rules applied 484 place count 52 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 490 place count 52 transition count 119
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 502 place count 40 transition count 70
Iterating global reduction 5 with 12 rules applied. Total rules applied 514 place count 40 transition count 70
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 520 place count 40 transition count 64
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 522 place count 38 transition count 62
Iterating global reduction 6 with 2 rules applied. Total rules applied 524 place count 38 transition count 62
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 530 place count 35 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 534 place count 33 transition count 61
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 538 place count 33 transition count 57
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 547 place count 33 transition count 48
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 556 place count 24 transition count 48
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 559 place count 21 transition count 45
Iterating global reduction 7 with 3 rules applied. Total rules applied 562 place count 21 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 563 place count 21 transition count 44
Applied a total of 563 rules in 58 ms. Remains 21 /335 variables (removed 314) and now considering 44/426 (removed 382) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/335 places, 44/426 transitions.
Finished random walk after 116 steps, including 11 resets, run visited all 1 properties in 1 ms. (steps per millisecond=116 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p2), (F p0), (F (NOT (AND (NOT p3) (NOT p1)))), (F p1), (F (AND p3 (NOT p1) (NOT p2)))]
Knowledge based reduction with 14 factoid took 746 ms. Reduced automaton from 6 states, 10 edges and 4 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), true]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), true]
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:45] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:08:45] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-06-10 06:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 06:08:45] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2022-06-10 06:08:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 06:08:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-06-10 06:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 06:08:46] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2022-06-10 06:08:46] [INFO ] Computed and/alt/rep : 406/593/406 causal constraints (skipped 19 transitions) in 49 ms.
[2022-06-10 06:08:47] [INFO ] Added : 178 causal constraints over 36 iterations in 1220 ms. Result :sat
Could not prove EG (NOT p3)
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:47] [INFO ] Computed 4 place invariants in 11 ms
[2022-06-10 06:08:47] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-06-10 06:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 06:08:48] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2022-06-10 06:08:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 06:08:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-06-10 06:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 06:08:48] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2022-06-10 06:08:48] [INFO ] Computed and/alt/rep : 406/593/406 causal constraints (skipped 19 transitions) in 50 ms.
[2022-06-10 06:08:51] [INFO ] Added : 285 causal constraints over 58 iterations in 2211 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 335 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 426/426 transitions.
Applied a total of 0 rules in 14 ms. Remains 335 /335 variables (removed 0) and now considering 426/426 (removed 0) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:51] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:08:51] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:51] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:08:51] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:51] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:08:52] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/335 places, 426/426 transitions.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 328 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), true]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:08:52] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-06-10 06:08:52] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:08:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-06-10 06:08:53] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 06:08:53] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 1 ms to minimize.
[2022-06-10 06:08:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2022-06-10 06:08:53] [INFO ] After 500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-06-10 06:08:53] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 335 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 335/335 places, 426/426 transitions.
Graph (trivial) has 328 edges and 335 vertex of which 51 / 335 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 499 edges and 293 vertex of which 290 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 290 transition count 169
Reduce places removed 197 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 203 rules applied. Total rules applied 405 place count 93 transition count 163
Reduce places removed 3 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 416 place count 90 transition count 155
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 424 place count 82 transition count 155
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 424 place count 82 transition count 141
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 452 place count 68 transition count 141
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 4 with 32 rules applied. Total rules applied 484 place count 52 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 490 place count 52 transition count 119
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 502 place count 40 transition count 70
Iterating global reduction 5 with 12 rules applied. Total rules applied 514 place count 40 transition count 70
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 520 place count 40 transition count 64
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 522 place count 38 transition count 62
Iterating global reduction 6 with 2 rules applied. Total rules applied 524 place count 38 transition count 62
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 530 place count 35 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 534 place count 33 transition count 61
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 538 place count 33 transition count 57
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 547 place count 33 transition count 48
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 556 place count 24 transition count 48
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 559 place count 21 transition count 45
Iterating global reduction 7 with 3 rules applied. Total rules applied 562 place count 21 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 563 place count 21 transition count 44
Applied a total of 563 rules in 50 ms. Remains 21 /335 variables (removed 314) and now considering 44/426 (removed 382) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/335 places, 44/426 transitions.
Finished random walk after 501 steps, including 47 resets, run visited all 1 properties in 2 ms. (steps per millisecond=250 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p3) (NOT p1)))), (F (AND (NOT p2) p3 (NOT p1)))]
Knowledge based reduction with 9 factoid took 406 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), true]
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), true]
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:54] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:08:54] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-06-10 06:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 06:08:54] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2022-06-10 06:08:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 06:08:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-06-10 06:08:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 06:08:55] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2022-06-10 06:08:55] [INFO ] Computed and/alt/rep : 406/593/406 causal constraints (skipped 19 transitions) in 52 ms.
[2022-06-10 06:08:56] [INFO ] Added : 178 causal constraints over 36 iterations in 1655 ms. Result :sat
Could not prove EG (NOT p3)
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:08:56] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:08:57] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-06-10 06:08:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 06:08:57] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2022-06-10 06:08:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 06:08:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-06-10 06:08:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 06:08:58] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2022-06-10 06:08:58] [INFO ] Computed and/alt/rep : 406/593/406 causal constraints (skipped 19 transitions) in 52 ms.
[2022-06-10 06:09:00] [INFO ] Added : 285 causal constraints over 58 iterations in 2686 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (OR (NOT p3) (NOT p2) p1), (OR (NOT p3) (NOT p2) p1), true]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-05 finished in 21498 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(!(p1 U F(G(!p1)))))))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 348 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 2 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 207 place count 298 transition count 177
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 212 rules applied. Total rules applied 419 place count 92 transition count 171
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 424 place count 89 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 426 place count 87 transition count 169
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 426 place count 87 transition count 157
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 450 place count 75 transition count 157
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 455 place count 70 transition count 150
Iterating global reduction 4 with 5 rules applied. Total rules applied 460 place count 70 transition count 150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 463 place count 67 transition count 145
Iterating global reduction 4 with 3 rules applied. Total rules applied 466 place count 67 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 468 place count 65 transition count 141
Iterating global reduction 4 with 2 rules applied. Total rules applied 470 place count 65 transition count 141
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 492 place count 54 transition count 130
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 501 place count 45 transition count 88
Iterating global reduction 4 with 9 rules applied. Total rules applied 510 place count 45 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 516 place count 45 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 517 place count 44 transition count 80
Iterating global reduction 5 with 1 rules applied. Total rules applied 518 place count 44 transition count 80
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 519 place count 43 transition count 78
Iterating global reduction 5 with 1 rules applied. Total rules applied 520 place count 43 transition count 78
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 534 place count 36 transition count 90
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 535 place count 35 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 536 place count 35 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 537 place count 35 transition count 83
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 540 place count 35 transition count 80
Applied a total of 540 rules in 56 ms. Remains 35 /343 variables (removed 308) and now considering 80/434 (removed 354) transitions.
[2022-06-10 06:09:01] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 06:09:01] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 06:09:01] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-06-10 06:09:01] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 06:09:01] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 06:09:01] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:09:01] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2022-06-10 06:09:01] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 06:09:01] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 06:09:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:09:01] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/343 places, 80/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/343 places, 80/434 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 1), p1:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 79 reset in 199 ms.
Product exploration explored 100000 steps with 274 reset in 177 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Detected a total of 3/35 stabilizing places and 6/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 264 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 06:09:02] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 06:09:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-10 06:09:02] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 35 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 : 35/35 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2022-06-10 06:09:02] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 06:09:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:02] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-06-10 06:09:02] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 06:09:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:09:03] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2022-06-10 06:09:03] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 06:09:03] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 06:09:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:03] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 80/80 transitions.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Detected a total of 3/35 stabilizing places and 6/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 173 reset in 370 ms.
Product exploration explored 100000 steps with 166 reset in 151 ms.
Built C files in :
/tmp/ltsmin2999069166154926422
[2022-06-10 06:09:04] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-06-10 06:09:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:09:04] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-06-10 06:09:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:09:04] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-06-10 06:09:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:09:04] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2999069166154926422
Running compilation step : cd /tmp/ltsmin2999069166154926422;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 522 ms.
Running link step : cd /tmp/ltsmin2999069166154926422;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2999069166154926422;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6693577161633225406.hoa' '--buchi-type=spotba'
LTSmin run took 205 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-03b-LTLFireability-06 finished in 4316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(!(p0 U p1))&&p2))||G(p3))))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 337 transition count 428
Applied a total of 12 rules in 17 ms. Remains 337 /343 variables (removed 6) and now considering 428/434 (removed 6) transitions.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:09:05] [INFO ] Computed 4 place invariants in 10 ms
[2022-06-10 06:09:05] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:09:05] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:09:05] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:09:05] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 06:09:06] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/343 places, 428/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/343 places, 428/434 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), true, p1, (OR (NOT p2) p1), (NOT p3)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s45 0), p3:(EQ s84 0), p1:(EQ s232 1), p0:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1740 reset in 361 ms.
Product exploration explored 100000 steps with 844 reset in 241 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p2 p3 (NOT p1) (NOT p0)), (X (NOT (AND p2 p1 (NOT p3)))), (X (AND p2 p3)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p1)))), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 898 ms. Reduced automaton from 6 states, 14 edges and 4 AP to 6 states, 14 edges and 4 AP.
Stuttering acceptance computed with spot in 306 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), true, p1, (OR (NOT p2) p1), (NOT p3)]
Incomplete random walk after 10000 steps, including 172 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:09:09] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-10 06:09:09] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-06-10 06:09:09] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-10 06:09:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-06-10 06:09:10] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-06-10 06:09:10] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 1 ms to minimize.
[2022-06-10 06:09:10] [INFO ] Deduced a trap composed of 218 places in 188 ms of which 1 ms to minimize.
[2022-06-10 06:09:10] [INFO ] Deduced a trap composed of 164 places in 265 ms of which 1 ms to minimize.
[2022-06-10 06:09:11] [INFO ] Deduced a trap composed of 166 places in 274 ms of which 1 ms to minimize.
[2022-06-10 06:09:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 967 ms
[2022-06-10 06:09:11] [INFO ] Deduced a trap composed of 165 places in 188 ms of which 1 ms to minimize.
[2022-06-10 06:09:11] [INFO ] Deduced a trap composed of 163 places in 167 ms of which 1 ms to minimize.
[2022-06-10 06:09:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2022-06-10 06:09:11] [INFO ] After 1875ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 122 ms.
[2022-06-10 06:09:11] [INFO ] After 2170ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 3 out of 337 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 337/337 places, 428/428 transitions.
Graph (trivial) has 339 edges and 337 vertex of which 48 / 337 are part of one of the 8 SCC in 1 ms
Free SCC test removed 40 places
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 504 edges and 297 vertex of which 295 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 209 rules applied. Total rules applied 211 place count 295 transition count 165
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 88 transition count 161
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 426 place count 86 transition count 159
Reduce places removed 2 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 4 rules applied. Total rules applied 430 place count 84 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 431 place count 83 transition count 157
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 431 place count 83 transition count 143
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 459 place count 69 transition count 143
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 460 place count 69 transition count 142
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 492 place count 53 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 496 place count 53 transition count 121
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 507 place count 42 transition count 73
Iterating global reduction 7 with 11 rules applied. Total rules applied 518 place count 42 transition count 73
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 525 place count 42 transition count 66
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 526 place count 41 transition count 65
Iterating global reduction 8 with 1 rules applied. Total rules applied 527 place count 41 transition count 65
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 535 place count 37 transition count 61
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 541 place count 34 transition count 65
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 545 place count 34 transition count 61
Free-agglomeration rule applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 561 place count 34 transition count 45
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 580 place count 18 transition count 42
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 583 place count 15 transition count 39
Iterating global reduction 9 with 3 rules applied. Total rules applied 586 place count 15 transition count 39
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 591 place count 15 transition count 34
Applied a total of 591 rules in 38 ms. Remains 15 /337 variables (removed 322) and now considering 34/428 (removed 394) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/337 places, 34/428 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Finished Best-First random walk after 3442 steps, including 1 resets, run visited all 3 properties in 31 ms. (steps per millisecond=111 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p3 (NOT p1) (NOT p0)), (X (NOT (AND p2 p1 (NOT p3)))), (X (AND p2 p3)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p2 p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p1)))), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p1))), (G (NOT (AND p2 (NOT p3) p1))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p2) p3)), (F (AND p2 (NOT p3))), (F p1), (F (AND (NOT p1) p0)), (F (NOT (AND p2 p3))), (F (AND p2 p1)), (F (NOT p2)), (F (NOT p3))]
Knowledge based reduction with 19 factoid took 1255 ms. Reduced automaton from 6 states, 14 edges and 4 AP to 6 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (AND p1 p3), (OR (NOT p2) (AND p1 p3)), (NOT p3)]
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (AND p1 p3), (OR (NOT p2) (AND p1 p3)), (NOT p3)]
Support contains 3 out of 337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 337/337 places, 428/428 transitions.
Applied a total of 0 rules in 9 ms. Remains 337 /337 variables (removed 0) and now considering 428/428 (removed 0) transitions.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:09:13] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:09:14] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:09:14] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:09:14] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:09:14] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:09:14] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 337/337 places, 428/428 transitions.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p2 p3 (NOT p1) (NOT p0)), (X p2), (X (AND p2 p3)), (X p3), (X (X p2)), (X (X (AND p2 p3))), (X (X (NOT (AND p1 p2)))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 422 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 6 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (AND p1 p3), (OR (NOT p2) (AND p1 p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 428 rows 337 cols
[2022-06-10 06:09:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 06:09:16] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 06:09:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-06-10 06:09:17] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 06:09:17] [INFO ] Deduced a trap composed of 162 places in 122 ms of which 1 ms to minimize.
[2022-06-10 06:09:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-06-10 06:09:17] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 1 ms to minimize.
[2022-06-10 06:09:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2022-06-10 06:09:17] [INFO ] After 710ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-06-10 06:09:17] [INFO ] After 970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 21 ms.
Support contains 1 out of 337 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 337/337 places, 428/428 transitions.
Graph (trivial) has 343 edges and 337 vertex of which 48 / 337 are part of one of the 8 SCC in 1 ms
Free SCC test removed 40 places
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 504 edges and 297 vertex of which 295 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 212 rules applied. Total rules applied 214 place count 295 transition count 162
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 216 rules applied. Total rules applied 430 place count 85 transition count 156
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 434 place count 82 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 435 place count 81 transition count 155
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 435 place count 81 transition count 140
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 465 place count 66 transition count 140
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 466 place count 66 transition count 139
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 496 place count 51 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 502 place count 51 transition count 118
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 515 place count 38 transition count 68
Iterating global reduction 6 with 13 rules applied. Total rules applied 528 place count 38 transition count 68
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 535 place count 38 transition count 61
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 538 place count 35 transition count 58
Iterating global reduction 7 with 3 rules applied. Total rules applied 541 place count 35 transition count 58
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 547 place count 32 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
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 553 place count 29 transition count 59
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 557 place count 29 transition count 55
Free-agglomeration rule applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 573 place count 29 transition count 39
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 598 place count 13 transition count 30
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 601 place count 10 transition count 27
Iterating global reduction 8 with 3 rules applied. Total rules applied 604 place count 10 transition count 27
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 611 place count 10 transition count 20
Applied a total of 611 rules in 24 ms. Remains 10 /337 variables (removed 327) and now considering 20/428 (removed 408) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/337 places, 20/428 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p2 p3 (NOT p1) (NOT p0)), (X p2), (X (AND p2 p3)), (X p3), (X (X p2)), (X (X (AND p2 p3))), (X (X (NOT (AND p1 p2)))), (X (X p3))]
False Knowledge obtained : [(F (AND p3 p1)), (F (OR (AND p0 (NOT p3)) (AND p0 (NOT p1)))), (F (AND p2 p1)), (F (NOT (AND p2 p3))), (F (NOT p2)), (F (NOT p3))]
Knowledge based reduction with 8 factoid took 694 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 6 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 410 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (AND p1 p3), (OR (NOT p2) (AND p1 p3)), (NOT p3)]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (AND p1 p3), (OR (NOT p2) (AND p1 p3)), (NOT p3)]
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (AND p1 p3), (OR (NOT p2) (AND p1 p3)), (NOT p3)]
Product exploration explored 100000 steps with 1738 reset in 208 ms.
Product exploration explored 100000 steps with 334 reset in 174 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (AND p1 p3), (OR (NOT p2) (AND p1 p3)), (NOT p3)]
Support contains 3 out of 337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 337/337 places, 428/428 transitions.
Graph (trivial) has 339 edges and 337 vertex of which 48 / 337 are part of one of the 8 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 203 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 297 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 207 place count 297 transition count 379
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 207 place count 297 transition count 382
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 212 place count 297 transition count 382
Discarding 169 places :
Symmetric choice reduction at 2 with 169 rule applications. Total rules 381 place count 128 transition count 213
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 2 with 169 rules applied. Total rules applied 550 place count 128 transition count 213
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 574 place count 128 transition count 213
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 608 place count 94 transition count 140
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 642 place count 94 transition count 140
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 649 place count 94 transition count 133
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 661 place count 82 transition count 119
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 673 place count 82 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 674 place count 81 transition count 118
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 675 place count 81 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 676 place count 81 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 677 place count 80 transition count 117
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 678 place count 80 transition count 117
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 687 place count 80 transition count 163
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 695 place count 72 transition count 147
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 703 place count 72 transition count 147
Deduced a syphon composed of 33 places in 0 ms
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 714 place count 72 transition count 136
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 714 rules in 50 ms. Remains 72 /337 variables (removed 265) and now considering 136/428 (removed 292) transitions.
[2022-06-10 06:09:20] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-10 06:09:20] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
// Phase 1: matrix 131 rows 72 cols
[2022-06-10 06:09:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 06:09:20] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/337 places, 136/428 transitions.
Finished structural reductions, in 1 iterations. Remains : 72/337 places, 136/428 transitions.
Product exploration explored 100000 steps with 1293 reset in 190 ms.
Product exploration explored 100000 steps with 515 reset in 221 ms.
Built C files in :
/tmp/ltsmin17286862400200760376
[2022-06-10 06:09:21] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17286862400200760376
Running compilation step : cd /tmp/ltsmin17286862400200760376;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1091 ms.
Running link step : cd /tmp/ltsmin17286862400200760376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17286862400200760376;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6416014417471759801.hoa' '--buchi-type=spotba'
LTSmin run took 6593 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-03b-LTLFireability-07 finished in 23378 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(F(X(p1))||X(G(p2))))))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 336 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 335 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 38 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:09:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 06:09:28] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:09:28] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:09:29] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:09:29] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:09:29] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(EQ s76 1), p2:(EQ s307 1), p0:(EQ s199 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-09 finished in 1428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(p1)||p0)))))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 348 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 208 place count 298 transition count 176
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 213 rules applied. Total rules applied 421 place count 91 transition count 170
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 424 place count 88 transition count 170
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 424 place count 88 transition count 157
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 450 place count 75 transition count 157
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 455 place count 70 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 460 place count 70 transition count 150
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 463 place count 67 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 466 place count 67 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 468 place count 65 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 470 place count 65 transition count 141
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 490 place count 55 transition count 131
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 498 place count 47 transition count 93
Iterating global reduction 3 with 8 rules applied. Total rules applied 506 place count 47 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 511 place count 47 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 512 place count 46 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 513 place count 46 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 514 place count 45 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 515 place count 45 transition count 84
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 533 place count 36 transition count 98
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 534 place count 35 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 535 place count 35 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 536 place count 35 transition count 91
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 539 place count 35 transition count 88
Applied a total of 539 rules in 39 ms. Remains 35 /343 variables (removed 308) and now considering 88/434 (removed 346) transitions.
[2022-06-10 06:09:30] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 35 cols
[2022-06-10 06:09:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-06-10 06:09:30] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 35 cols
[2022-06-10 06:09:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:30] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:09:30] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2022-06-10 06:09:30] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 06:09:30] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 35 cols
[2022-06-10 06:09:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:09:30] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/343 places, 88/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/343 places, 88/434 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s18 1) (EQ s28 1)), p0:(OR (EQ s8 0) (EQ s18 0) (EQ s28 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 72 reset in 158 ms.
Product exploration explored 100000 steps with 80 reset in 226 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 458 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1465 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 219 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 219 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-10 06:09:31] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 35 cols
[2022-06-10 06:09:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:09:31] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-06-10 06:09:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 06:09:31] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 590 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 52 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 47 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1)))]
Support contains 3 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 35 /35 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2022-06-10 06:09:32] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 35 cols
[2022-06-10 06:09:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:32] [INFO ] Implicit Places using invariants in 62 ms returned []
[2022-06-10 06:09:32] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 35 cols
[2022-06-10 06:09:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:09:32] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:09:32] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2022-06-10 06:09:32] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 06:09:32] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 35 cols
[2022-06-10 06:09:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:32] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 88/88 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 1 states, 3 edges and 2 AP to 1 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 46 ms :[(OR (AND p0 p1) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 219 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 06:09:33] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 35 cols
[2022-06-10 06:09:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:33] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:09:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-10 06:09:33] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1))))), (G (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 499 ms. Reduced automaton from 1 states, 3 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[false]
Stuttering acceptance computed with spot in 35 ms :[false]
Stuttering acceptance computed with spot in 31 ms :[false]
Product exploration explored 100000 steps with 111 reset in 215 ms.
Product exploration explored 100000 steps with 10 reset in 306 ms.
Built C files in :
/tmp/ltsmin15031209087906590410
[2022-06-10 06:09:34] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2022-06-10 06:09:34] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:09:34] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2022-06-10 06:09:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:09:34] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2022-06-10 06:09:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:09:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15031209087906590410
Running compilation step : cd /tmp/ltsmin15031209087906590410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 263 ms.
Running link step : cd /tmp/ltsmin15031209087906590410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15031209087906590410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17907619445500296566.hoa' '--buchi-type=spotba'
LTSmin run took 116 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-03b-LTLFireability-10 finished in 4848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 5 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 336 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 335 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 40 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:09:35] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:09:35] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:09:35] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:09:35] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:09:35] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:09:36] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s22 1), p0:(AND (EQ s305 1) (OR (EQ s20 0) (EQ s148 0) (EQ s254 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-11 finished in 1170 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U p1))'
Support contains 4 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 346 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 207 place count 298 transition count 177
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 212 rules applied. Total rules applied 419 place count 92 transition count 171
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 423 place count 89 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 424 place count 88 transition count 170
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 424 place count 88 transition count 157
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 450 place count 75 transition count 157
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 455 place count 70 transition count 150
Iterating global reduction 4 with 5 rules applied. Total rules applied 460 place count 70 transition count 150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 463 place count 67 transition count 145
Iterating global reduction 4 with 3 rules applied. Total rules applied 466 place count 67 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 468 place count 65 transition count 141
Iterating global reduction 4 with 2 rules applied. Total rules applied 470 place count 65 transition count 141
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 490 place count 55 transition count 131
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 498 place count 47 transition count 93
Iterating global reduction 4 with 8 rules applied. Total rules applied 506 place count 47 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 511 place count 47 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 512 place count 46 transition count 86
Iterating global reduction 5 with 1 rules applied. Total rules applied 513 place count 46 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 514 place count 45 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 515 place count 45 transition count 84
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 531 place count 37 transition count 91
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 532 place count 36 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 533 place count 36 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 534 place count 36 transition count 84
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 537 place count 36 transition count 81
Applied a total of 537 rules in 36 ms. Remains 36 /343 variables (removed 307) and now considering 81/434 (removed 353) transitions.
[2022-06-10 06:09:36] [INFO ] Flow matrix only has 77 transitions (discarded 4 similar events)
// Phase 1: matrix 77 rows 36 cols
[2022-06-10 06:09:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:09:36] [INFO ] Implicit Places using invariants in 50 ms returned []
[2022-06-10 06:09:36] [INFO ] Flow matrix only has 77 transitions (discarded 4 similar events)
// Phase 1: matrix 77 rows 36 cols
[2022-06-10 06:09:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-06-10 06:09:36] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2022-06-10 06:09:36] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 06:09:36] [INFO ] Flow matrix only has 77 transitions (discarded 4 similar events)
// Phase 1: matrix 77 rows 36 cols
[2022-06-10 06:09:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:36] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/343 places, 81/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/343 places, 81/434 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), true, p0]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s22 1), p0:(AND (EQ s7 1) (EQ s18 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 158 steps with 22 reset in 1 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-12 finished in 392 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(p1))))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 336 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 335 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 41 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:09:36] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:09:36] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:09:36] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:09:37] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:09:37] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:09:37] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s227 0) (EQ s296 0)), p1:(EQ s272 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 125 reset in 87 ms.
Product exploration explored 100000 steps with 1273 reset in 115 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 175 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 426 rows 335 cols
[2022-06-10 06:09:38] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:09:38] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:09:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-06-10 06:09:38] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-03b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03b-LTLFireability-13 finished in 2119 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p0)))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 348 edges and 343 vertex of which 44 / 343 are part of one of the 8 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 216 place count 306 transition count 177
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 222 rules applied. Total rules applied 438 place count 91 transition count 170
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 442 place count 88 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 443 place count 87 transition count 169
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 443 place count 87 transition count 155
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 471 place count 73 transition count 155
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 476 place count 68 transition count 148
Iterating global reduction 4 with 5 rules applied. Total rules applied 481 place count 68 transition count 148
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 484 place count 65 transition count 143
Iterating global reduction 4 with 3 rules applied. Total rules applied 487 place count 65 transition count 143
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 489 place count 63 transition count 139
Iterating global reduction 4 with 2 rules applied. Total rules applied 491 place count 63 transition count 139
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 511 place count 53 transition count 129
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 519 place count 45 transition count 89
Iterating global reduction 4 with 8 rules applied. Total rules applied 527 place count 45 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 533 place count 45 transition count 83
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 553 place count 35 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 554 place count 34 transition count 89
Iterating global reduction 5 with 1 rules applied. Total rules applied 555 place count 34 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 556 place count 34 transition count 88
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 559 place count 34 transition count 85
Applied a total of 559 rules in 41 ms. Remains 34 /343 variables (removed 309) and now considering 85/434 (removed 349) transitions.
[2022-06-10 06:09:38] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 34 cols
[2022-06-10 06:09:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-06-10 06:09:38] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 34 cols
[2022-06-10 06:09:38] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 06:09:38] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-10 06:09:38] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-06-10 06:09:38] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 06:09:38] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 34 cols
[2022-06-10 06:09:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:39] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/343 places, 85/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/343 places, 85/434 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-14 finished in 537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (F(!X(p1))&&p2))))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 337 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 336 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 336 transition count 427
Applied a total of 14 rules in 33 ms. Remains 336 /343 variables (removed 7) and now considering 427/434 (removed 7) transitions.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:09:39] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:09:39] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:09:39] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:09:39] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:09:39] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:09:40] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/343 places, 427/434 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/343 places, 427/434 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NEQ s275 1) (EQ s296 1)), p2:(EQ s296 1), p1:(EQ s275 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 592 reset in 159 ms.
Product exploration explored 100000 steps with 667 reset in 171 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:09:41] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-10 06:09:41] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-06-10 06:09:41] [INFO ] After 283ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 06:09:42] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 1 ms to minimize.
[2022-06-10 06:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2022-06-10 06:09:42] [INFO ] After 620ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:09:42] [INFO ] After 768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:09:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-06-10 06:09:42] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 06:09:42] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 1 ms to minimize.
[2022-06-10 06:09:42] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 1 ms to minimize.
[2022-06-10 06:09:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2022-06-10 06:09:43] [INFO ] After 818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-06-10 06:09:43] [INFO ] After 976ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 336 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 336/336 places, 427/427 transitions.
Graph (trivial) has 342 edges and 336 vertex of which 51 / 336 are part of one of the 9 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 500 edges and 294 vertex of which 291 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 210 rules applied. Total rules applied 212 place count 291 transition count 160
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 213 rules applied. Total rules applied 425 place count 84 transition count 154
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 428 place count 81 transition count 154
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 428 place count 81 transition count 137
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 462 place count 64 transition count 137
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 463 place count 64 transition count 136
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 464 place count 63 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 465 place count 63 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 466 place count 62 transition count 132
Iterating global reduction 4 with 1 rules applied. Total rules applied 467 place count 62 transition count 132
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 495 place count 48 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 500 place count 48 transition count 113
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 511 place count 37 transition count 66
Iterating global reduction 5 with 11 rules applied. Total rules applied 522 place count 37 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 529 place count 37 transition count 59
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 531 place count 35 transition count 57
Iterating global reduction 6 with 2 rules applied. Total rules applied 533 place count 35 transition count 57
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 539 place count 32 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 543 place count 30 transition count 56
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 547 place count 30 transition count 52
Free-agglomeration rule applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 563 place count 30 transition count 36
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 588 place count 14 transition count 27
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 591 place count 11 transition count 24
Iterating global reduction 7 with 3 rules applied. Total rules applied 594 place count 11 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 597 place count 11 transition count 21
Applied a total of 597 rules in 29 ms. Remains 11 /336 variables (removed 325) and now considering 21/427 (removed 406) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/336 places, 21/427 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F p1), (F p2)]
Knowledge based reduction with 6 factoid took 431 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 427/427 transitions.
Applied a total of 0 rules in 7 ms. Remains 336 /336 variables (removed 0) and now considering 427/427 (removed 0) transitions.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:09:43] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:09:43] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:09:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 06:09:44] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:09:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 06:09:44] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/336 places, 427/427 transitions.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 174 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:09:45] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:09:45] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-06-10 06:09:45] [INFO ] After 285ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 06:09:45] [INFO ] Deduced a trap composed of 164 places in 258 ms of which 1 ms to minimize.
[2022-06-10 06:09:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2022-06-10 06:09:46] [INFO ] After 617ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:09:46] [INFO ] After 734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:09:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-06-10 06:09:46] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 06:09:46] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 1 ms to minimize.
[2022-06-10 06:09:46] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 1 ms to minimize.
[2022-06-10 06:09:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 491 ms
[2022-06-10 06:09:46] [INFO ] After 767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-10 06:09:46] [INFO ] After 900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 336 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 336/336 places, 427/427 transitions.
Graph (trivial) has 342 edges and 336 vertex of which 51 / 336 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 500 edges and 294 vertex of which 291 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 210 rules applied. Total rules applied 212 place count 291 transition count 160
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 213 rules applied. Total rules applied 425 place count 84 transition count 154
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 428 place count 81 transition count 154
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 428 place count 81 transition count 137
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 462 place count 64 transition count 137
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 463 place count 64 transition count 136
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 464 place count 63 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 465 place count 63 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 466 place count 62 transition count 132
Iterating global reduction 4 with 1 rules applied. Total rules applied 467 place count 62 transition count 132
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 495 place count 48 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 500 place count 48 transition count 113
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 511 place count 37 transition count 66
Iterating global reduction 5 with 11 rules applied. Total rules applied 522 place count 37 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 529 place count 37 transition count 59
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 531 place count 35 transition count 57
Iterating global reduction 6 with 2 rules applied. Total rules applied 533 place count 35 transition count 57
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 539 place count 32 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 543 place count 30 transition count 56
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 547 place count 30 transition count 52
Free-agglomeration rule applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 563 place count 30 transition count 36
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 588 place count 14 transition count 27
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 591 place count 11 transition count 24
Iterating global reduction 7 with 3 rules applied. Total rules applied 594 place count 11 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 597 place count 11 transition count 21
Applied a total of 597 rules in 30 ms. Remains 11 /336 variables (removed 325) and now considering 21/427 (removed 406) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/336 places, 21/427 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F p1), (F p2)]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Product exploration explored 100000 steps with 1775 reset in 163 ms.
Product exploration explored 100000 steps with 1755 reset in 134 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 427/427 transitions.
Graph (trivial) has 340 edges and 336 vertex of which 51 / 336 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 294 transition count 379
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 203 place count 294 transition count 376
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 203 place count 294 transition count 379
Deduced a syphon composed of 206 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 210 place count 294 transition count 379
Discarding 169 places :
Symmetric choice reduction at 2 with 169 rule applications. Total rules 379 place count 125 transition count 209
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 169 rules applied. Total rules applied 548 place count 125 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 549 place count 124 transition count 207
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 550 place count 124 transition count 207
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 573 place count 124 transition count 207
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 605 place count 92 transition count 136
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 637 place count 92 transition count 136
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 644 place count 92 transition count 129
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 655 place count 81 transition count 116
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 666 place count 81 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 668 place count 79 transition count 114
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 670 place count 79 transition count 114
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 679 place count 79 transition count 159
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 688 place count 70 transition count 141
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 697 place count 70 transition count 141
Deduced a syphon composed of 34 places in 0 ms
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 707 place count 70 transition count 131
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 707 rules in 29 ms. Remains 70 /336 variables (removed 266) and now considering 131/427 (removed 296) transitions.
[2022-06-10 06:09:48] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 06:09:48] [INFO ] Flow matrix only has 127 transitions (discarded 4 similar events)
// Phase 1: matrix 127 rows 70 cols
[2022-06-10 06:09:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:09:48] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/336 places, 131/427 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/336 places, 131/427 transitions.
Product exploration explored 100000 steps with 56 reset in 265 ms.
Product exploration explored 100000 steps with 438 reset in 186 ms.
Built C files in :
/tmp/ltsmin17630518157374227032
[2022-06-10 06:09:48] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17630518157374227032
Running compilation step : cd /tmp/ltsmin17630518157374227032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 938 ms.
Running link step : cd /tmp/ltsmin17630518157374227032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17630518157374227032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased654281433681040015.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 427/427 transitions.
Applied a total of 0 rules in 7 ms. Remains 336 /336 variables (removed 0) and now considering 427/427 (removed 0) transitions.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:10:03] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-10 06:10:04] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:10:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 06:10:04] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
// Phase 1: matrix 427 rows 336 cols
[2022-06-10 06:10:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-10 06:10:04] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 336/336 places, 427/427 transitions.
Built C files in :
/tmp/ltsmin5706876182830671233
[2022-06-10 06:10:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5706876182830671233
Running compilation step : cd /tmp/ltsmin5706876182830671233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 905 ms.
Running link step : cd /tmp/ltsmin5706876182830671233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5706876182830671233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10532218158100482583.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 06:10:20] [INFO ] Flatten gal took : 33 ms
[2022-06-10 06:10:20] [INFO ] Flatten gal took : 30 ms
[2022-06-10 06:10:20] [INFO ] Time to serialize gal into /tmp/LTL13487258476331347158.gal : 8 ms
[2022-06-10 06:10:20] [INFO ] Time to serialize properties into /tmp/LTL13766466158171607433.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13487258476331347158.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13766466158171607433.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1348725...268
Read 1 LTL properties
Checking formula 0 : !((X(!(("((p350!=1)||(p378==1))")U((F(!(X("(p350==1)"))))&&("(p378==1)"))))))
Formula 0 simplified : !X!("((p350!=1)||(p378==1))" U ("(p378==1)" & F!X"(p350==1)"))
Reverse transition relation is NOT exact ! Due to transitions t52, t62, t97, t98, t131, t132, t134, t151, t160, t194, t195, t196, t231, t232, t234, t250, t...314
Computing Next relation with stutter on 1252 deadlock states
Detected timeout of ITS tools.
[2022-06-10 06:10:35] [INFO ] Flatten gal took : 29 ms
[2022-06-10 06:10:35] [INFO ] Applying decomposition
[2022-06-10 06:10:35] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2549267674032599942.txt' '-o' '/tmp/graph2549267674032599942.bin' '-w' '/tmp/graph2549267674032599942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2549267674032599942.bin' '-l' '-1' '-v' '-w' '/tmp/graph2549267674032599942.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:10:35] [INFO ] Decomposing Gal with order
[2022-06-10 06:10:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:10:35] [INFO ] Removed a total of 345 redundant transitions.
[2022-06-10 06:10:35] [INFO ] Flatten gal took : 171 ms
[2022-06-10 06:10:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 32 ms.
[2022-06-10 06:10:35] [INFO ] Time to serialize gal into /tmp/LTL3782931001833352260.gal : 16 ms
[2022-06-10 06:10:35] [INFO ] Time to serialize properties into /tmp/LTL18311374257953439797.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3782931001833352260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18311374257953439797.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3782931...246
Read 1 LTL properties
Checking formula 0 : !((X(!(("((i18.i1.u112.p350!=1)||(i19.i2.u122.p378==1))")U((F(!(X("(i18.i1.u112.p350==1)"))))&&("(i19.i2.u122.p378==1)"))))))
Formula 0 simplified : !X!("((i18.i1.u112.p350!=1)||(i19.i2.u122.p378==1))" U ("(i19.i2.u122.p378==1)" & F!X"(i18.i1.u112.p350==1)"))
Reverse transition relation is NOT exact ! Due to transitions t52, t97, t98, t131, t134, t232, t234, t250, t295, t297, t330, t333, t350, t351, t353, i2.i0....385
Computing Next relation with stutter on 1252 deadlock states
86 unique states visited
86 strongly connected components in search stack
87 transitions explored
86 items max in DFS search stack
241 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.48995,79028,1,0,120034,456,4703,223940,221,1791,358055
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyElection-PT-03b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property StigmergyElection-PT-03b-LTLFireability-15 finished in 59243 ms.
All properties solved by simple procedures.
Total runtime 142406 ms.

BK_STOP 1654841438647

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-03b, 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 r294-smll-165463872700276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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