Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 428K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717125806838

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 03:23:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 03:23:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:23:28] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-31 03:23:28] [INFO ] Transformed 699 places.
[2024-05-31 03:23:28] [INFO ] Transformed 1266 transitions.
[2024-05-31 03:23:28] [INFO ] Found NUPN structural information;
[2024-05-31 03:23:28] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyElection-PT-05b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 85 place count 614 transition count 1181
Iterating global reduction 0 with 85 rules applied. Total rules applied 170 place count 614 transition count 1181
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 212 place count 572 transition count 1139
Iterating global reduction 0 with 42 rules applied. Total rules applied 254 place count 572 transition count 1139
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 262 place count 564 transition count 1131
Iterating global reduction 0 with 8 rules applied. Total rules applied 270 place count 564 transition count 1131
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 273 place count 561 transition count 1128
Iterating global reduction 0 with 3 rules applied. Total rules applied 276 place count 561 transition count 1128
Applied a total of 276 rules in 162 ms. Remains 561 /699 variables (removed 138) and now considering 1128/1266 (removed 138) transitions.
// Phase 1: matrix 1128 rows 561 cols
[2024-05-31 03:23:33] [INFO ] Computed 6 invariants in 31 ms
[2024-05-31 03:23:33] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-31 03:23:33] [INFO ] Invariant cache hit.
[2024-05-31 03:23:33] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 5132 ms to find 0 implicit places.
[2024-05-31 03:23:33] [INFO ] Invariant cache hit.
[2024-05-31 03:23:34] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 561/699 places, 1128/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5718 ms. Remains : 561/699 places, 1128/1266 transitions.
Support contains 58 out of 561 places after structural reductions.
[2024-05-31 03:23:34] [INFO ] Flatten gal took : 130 ms
[2024-05-31 03:23:34] [INFO ] Flatten gal took : 74 ms
[2024-05-31 03:23:34] [INFO ] Input system was already deterministic with 1128 transitions.
Support contains 54 out of 561 places (down from 58) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 36) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2024-05-31 03:23:35] [INFO ] Invariant cache hit.
[2024-05-31 03:23:35] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 03:23:36] [INFO ] After 536ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:19
[2024-05-31 03:23:37] [INFO ] Deduced a trap composed of 170 places in 238 ms of which 6 ms to minimize.
[2024-05-31 03:23:37] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 1 ms to minimize.
[2024-05-31 03:23:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 588 ms
[2024-05-31 03:23:37] [INFO ] After 1610ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :6 real:20
Attempting to minimize the solution found.
Minimization took 254 ms.
[2024-05-31 03:23:37] [INFO ] After 2302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :6 real:20
[2024-05-31 03:23:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 03:23:39] [INFO ] After 1243ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :25
[2024-05-31 03:23:40] [INFO ] Deduced a trap composed of 170 places in 222 ms of which 2 ms to minimize.
[2024-05-31 03:23:40] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 0 ms to minimize.
[2024-05-31 03:23:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 536 ms
[2024-05-31 03:23:41] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 0 ms to minimize.
[2024-05-31 03:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2024-05-31 03:23:41] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 1 ms to minimize.
[2024-05-31 03:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2024-05-31 03:23:42] [INFO ] After 3887ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :25
Attempting to minimize the solution found.
Minimization took 1049 ms.
[2024-05-31 03:23:43] [INFO ] After 5434ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :25
Fused 26 Parikh solutions to 24 different solutions.
Parikh walk visited 10 properties in 185 ms.
Support contains 32 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Graph (trivial) has 521 edges and 561 vertex of which 76 / 561 are part of one of the 13 SCC in 4 ms
Free SCC test removed 63 places
Drop transitions removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Graph (complete) has 1064 edges and 498 vertex of which 494 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 309 transitions
Trivial Post-agglo rules discarded 309 transitions
Performed 309 trivial Post agglomeration. Transition count delta: 309
Iterating post reduction 0 with 313 rules applied. Total rules applied 315 place count 494 transition count 731
Reduce places removed 309 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 321 rules applied. Total rules applied 636 place count 185 transition count 719
Reduce places removed 6 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 21 rules applied. Total rules applied 657 place count 179 transition count 704
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 672 place count 164 transition count 704
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 672 place count 164 transition count 679
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 722 place count 139 transition count 679
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 724 place count 137 transition count 676
Iterating global reduction 4 with 2 rules applied. Total rules applied 726 place count 137 transition count 676
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 727 place count 137 transition count 675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 728 place count 136 transition count 675
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 730 place count 134 transition count 672
Iterating global reduction 6 with 2 rules applied. Total rules applied 732 place count 134 transition count 672
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 776 place count 112 transition count 649
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 782 place count 112 transition count 643
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 787 place count 107 transition count 630
Iterating global reduction 7 with 5 rules applied. Total rules applied 792 place count 107 transition count 630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 793 place count 107 transition count 629
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 794 place count 106 transition count 628
Iterating global reduction 8 with 1 rules applied. Total rules applied 795 place count 106 transition count 628
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 809 place count 99 transition count 621
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
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 817 place count 95 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 818 place count 95 transition count 628
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 827 place count 95 transition count 619
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 829 place count 94 transition count 625
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 837 place count 94 transition count 617
Free-agglomeration rule applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 856 place count 94 transition count 598
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 875 place count 75 transition count 598
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 880 place count 70 transition count 593
Iterating global reduction 10 with 5 rules applied. Total rules applied 885 place count 70 transition count 593
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 887 place count 70 transition count 593
Applied a total of 887 rules in 303 ms. Remains 70 /561 variables (removed 491) and now considering 593/1128 (removed 535) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 70/561 places, 593/1128 transitions.
Incomplete random walk after 10000 steps, including 735 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :2
Running SMT prover for 5 properties.
// Phase 1: matrix 593 rows 70 cols
[2024-05-31 03:23:44] [INFO ] Computed 6 invariants in 3 ms
[2024-05-31 03:23:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:23:44] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 03:23:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:23:44] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-31 03:23:44] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-31 03:23:44] [INFO ] After 155ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-31 03:23:45] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2024-05-31 03:23:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-05-31 03:23:45] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 0 ms to minimize.
[2024-05-31 03:23:45] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2024-05-31 03:23:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2024-05-31 03:23:45] [INFO ] After 743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-31 03:23:45] [INFO ] After 1076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 593/593 transitions.
Graph (trivial) has 45 edges and 70 vertex of which 2 / 70 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 69 transition count 581
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 59 transition count 581
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 59 transition count 580
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 58 transition count 580
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 31 place count 50 transition count 236
Iterating global reduction 2 with 8 rules applied. Total rules applied 39 place count 50 transition count 236
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 50 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 45 place count 50 transition count 229
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 49 transition count 229
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 49 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 50 place count 47 transition count 203
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 47 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 47 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 55 place count 46 transition count 201
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 56 place count 45 transition count 200
Iterating global reduction 5 with 1 rules applied. Total rules applied 57 place count 45 transition count 200
Free-agglomeration rule applied 21 times with reduction of 24 identical transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 78 place count 45 transition count 155
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 73 rules applied. Total rules applied 151 place count 24 transition count 103
Applied a total of 151 rules in 70 ms. Remains 24 /70 variables (removed 46) and now considering 103/593 (removed 490) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 24/70 places, 103/593 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :4
Finished Best-First random walk after 433 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=433 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 75 stabilizing places and 80 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Graph (trivial) has 567 edges and 561 vertex of which 84 / 561 are part of one of the 14 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 335 place count 490 transition count 713
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 344 rules applied. Total rules applied 679 place count 156 transition count 703
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 685 place count 151 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 686 place count 150 transition count 702
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 686 place count 150 transition count 682
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 726 place count 130 transition count 682
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 735 place count 121 transition count 671
Iterating global reduction 4 with 9 rules applied. Total rules applied 744 place count 121 transition count 671
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 745 place count 121 transition count 670
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 746 place count 120 transition count 670
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 746 place count 120 transition count 669
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 748 place count 119 transition count 669
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 751 place count 116 transition count 664
Iterating global reduction 6 with 3 rules applied. Total rules applied 754 place count 116 transition count 664
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 756 place count 114 transition count 660
Iterating global reduction 6 with 2 rules applied. Total rules applied 758 place count 114 transition count 660
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 796 place count 95 transition count 641
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 809 place count 82 transition count 339
Iterating global reduction 6 with 13 rules applied. Total rules applied 822 place count 82 transition count 339
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 828 place count 82 transition count 333
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 831 place count 79 transition count 327
Iterating global reduction 7 with 3 rules applied. Total rules applied 834 place count 79 transition count 327
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 837 place count 76 transition count 321
Iterating global reduction 7 with 3 rules applied. Total rules applied 840 place count 76 transition count 321
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 858 place count 67 transition count 328
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 859 place count 66 transition count 318
Iterating global reduction 7 with 1 rules applied. Total rules applied 860 place count 66 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 861 place count 66 transition count 317
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 866 place count 66 transition count 312
Applied a total of 866 rules in 133 ms. Remains 66 /561 variables (removed 495) and now considering 312/1128 (removed 816) transitions.
[2024-05-31 03:23:46] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
// Phase 1: matrix 306 rows 66 cols
[2024-05-31 03:23:46] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 03:23:46] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 03:23:46] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
[2024-05-31 03:23:46] [INFO ] Invariant cache hit.
[2024-05-31 03:23:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 03:23:46] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-31 03:23:46] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-31 03:23:46] [INFO ] Flow matrix only has 306 transitions (discarded 6 similar events)
[2024-05-31 03:23:46] [INFO ] Invariant cache hit.
[2024-05-31 03:23:46] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/561 places, 312/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 466 ms. Remains : 66/561 places, 312/1128 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 221 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s35 1), p0:(AND (EQ s8 1) (EQ s19 1) (EQ s32 1) (EQ s45 1) (EQ s58 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]]
Product exploration explored 100000 steps with 10555 reset in 355 ms.
Entered a terminal (fully accepting) state of product in 22298 steps with 2354 reset in 56 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-00 finished in 1150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0 U p1)) U p2))'
Support contains 7 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Graph (trivial) has 559 edges and 561 vertex of which 86 / 561 are part of one of the 15 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 489 transition count 716
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 341 rules applied. Total rules applied 673 place count 158 transition count 706
Reduce places removed 5 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 12 rules applied. Total rules applied 685 place count 153 transition count 699
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 692 place count 146 transition count 699
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 692 place count 146 transition count 680
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 730 place count 127 transition count 680
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 739 place count 118 transition count 669
Iterating global reduction 4 with 9 rules applied. Total rules applied 748 place count 118 transition count 669
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 749 place count 118 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 750 place count 117 transition count 668
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 750 place count 117 transition count 667
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 752 place count 116 transition count 667
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 755 place count 113 transition count 662
Iterating global reduction 6 with 3 rules applied. Total rules applied 758 place count 113 transition count 662
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 760 place count 111 transition count 658
Iterating global reduction 6 with 2 rules applied. Total rules applied 762 place count 111 transition count 658
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 800 place count 92 transition count 639
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 816 place count 76 transition count 209
Iterating global reduction 6 with 16 rules applied. Total rules applied 832 place count 76 transition count 209
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 842 place count 76 transition count 199
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 844 place count 74 transition count 195
Iterating global reduction 7 with 2 rules applied. Total rules applied 846 place count 74 transition count 195
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 848 place count 72 transition count 191
Iterating global reduction 7 with 2 rules applied. Total rules applied 850 place count 72 transition count 191
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 870 place count 62 transition count 198
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 871 place count 61 transition count 186
Iterating global reduction 7 with 1 rules applied. Total rules applied 872 place count 61 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 873 place count 61 transition count 185
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 879 place count 61 transition count 179
Applied a total of 879 rules in 95 ms. Remains 61 /561 variables (removed 500) and now considering 179/1128 (removed 949) transitions.
[2024-05-31 03:23:47] [INFO ] Flow matrix only has 173 transitions (discarded 6 similar events)
// Phase 1: matrix 173 rows 61 cols
[2024-05-31 03:23:47] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 03:23:47] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 03:23:47] [INFO ] Flow matrix only has 173 transitions (discarded 6 similar events)
[2024-05-31 03:23:47] [INFO ] Invariant cache hit.
[2024-05-31 03:23:47] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 03:23:47] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-31 03:23:47] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 03:23:47] [INFO ] Flow matrix only has 173 transitions (discarded 6 similar events)
[2024-05-31 03:23:47] [INFO ] Invariant cache hit.
[2024-05-31 03:23:47] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/561 places, 179/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 61/561 places, 179/1128 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s13 1), p1:(EQ s6 1), p0:(AND (EQ s16 1) (EQ s27 1) (EQ s37 1) (EQ s47 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-02 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)&&F(p2)))))'
Support contains 7 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 552 transition count 1119
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 551 transition count 1118
Applied a total of 20 rules in 48 ms. Remains 551 /561 variables (removed 10) and now considering 1118/1128 (removed 10) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2024-05-31 03:23:47] [INFO ] Computed 6 invariants in 21 ms
[2024-05-31 03:23:47] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-31 03:23:47] [INFO ] Invariant cache hit.
[2024-05-31 03:23:48] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-31 03:23:48] [INFO ] Invariant cache hit.
[2024-05-31 03:23:48] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 551/561 places, 1118/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1054 ms. Remains : 551/561 places, 1118/1128 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s118 1), p1:(AND (EQ s80 1) (EQ s166 1) (EQ s294 1) (EQ s400 1) (EQ s495 1)), p2:(NEQ s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-03 finished in 1264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 553 transition count 1120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 553 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 550 transition count 1117
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 549 transition count 1116
Applied a total of 24 rules in 55 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-31 03:23:49] [INFO ] Computed 6 invariants in 17 ms
[2024-05-31 03:23:49] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-31 03:23:49] [INFO ] Invariant cache hit.
[2024-05-31 03:23:49] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-31 03:23:49] [INFO ] Invariant cache hit.
[2024-05-31 03:23:50] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1099 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s271 0), p0:(OR (EQ s97 0) (EQ s202 0) (EQ s308 0) (EQ s415 0) (EQ s520 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 887 steps with 9 reset in 3 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-04 finished in 1253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 551 transition count 1118
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 550 transition count 1117
Applied a total of 22 rules in 44 ms. Remains 550 /561 variables (removed 11) and now considering 1117/1128 (removed 11) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2024-05-31 03:23:50] [INFO ] Computed 6 invariants in 14 ms
[2024-05-31 03:23:50] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-31 03:23:50] [INFO ] Invariant cache hit.
[2024-05-31 03:23:50] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2024-05-31 03:23:50] [INFO ] Invariant cache hit.
[2024-05-31 03:23:51] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 550/561 places, 1117/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1107 ms. Remains : 550/561 places, 1117/1128 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s22 1) (EQ s139 1) (EQ s234 1) (EQ s362 1) (EQ s469 1)), p0:(EQ s437 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-05 finished in 1323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&G(p2)&&X(p0)))))'
Support contains 7 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 552 transition count 1119
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 551 transition count 1118
Applied a total of 20 rules in 55 ms. Remains 551 /561 variables (removed 10) and now considering 1118/1128 (removed 10) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2024-05-31 03:23:51] [INFO ] Computed 6 invariants in 15 ms
[2024-05-31 03:23:51] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-31 03:23:51] [INFO ] Invariant cache hit.
[2024-05-31 03:23:52] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-31 03:23:52] [INFO ] Invariant cache hit.
[2024-05-31 03:23:52] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 551/561 places, 1118/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1134 ms. Remains : 551/561 places, 1118/1128 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s404 0), p1:(EQ s517 1), p2:(AND (EQ s96 1) (EQ s203 1) (EQ s309 1) (EQ s416 1) (EQ s523 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1125 reset in 156 ms.
Product exploration explored 100000 steps with 1120 reset in 162 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 p2))), true, (X (X (OR (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 143 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 112 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :3
Running SMT prover for 3 properties.
[2024-05-31 03:23:53] [INFO ] Invariant cache hit.
[2024-05-31 03:23:53] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 03:23:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 03:23:54] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 03:23:54] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-31 03:23:54] [INFO ] After 650ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 1118/1118 transitions.
Graph (trivial) has 535 edges and 551 vertex of which 85 / 551 are part of one of the 15 SCC in 0 ms
Free SCC test removed 70 places
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1043 edges and 481 vertex of which 476 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 324 rules applied. Total rules applied 326 place count 476 transition count 699
Reduce places removed 319 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 329 rules applied. Total rules applied 655 place count 157 transition count 689
Reduce places removed 5 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 24 rules applied. Total rules applied 679 place count 152 transition count 670
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 698 place count 133 transition count 670
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 698 place count 133 transition count 646
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 746 place count 109 transition count 646
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 747 place count 108 transition count 644
Iterating global reduction 4 with 1 rules applied. Total rules applied 748 place count 108 transition count 644
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 749 place count 108 transition count 643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 750 place count 107 transition count 643
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 751 place count 106 transition count 641
Iterating global reduction 6 with 1 rules applied. Total rules applied 752 place count 106 transition count 641
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 798 place count 83 transition count 618
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 807 place count 83 transition count 609
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 826 place count 64 transition count 170
Iterating global reduction 7 with 19 rules applied. Total rules applied 845 place count 64 transition count 170
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 856 place count 64 transition count 159
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 860 place count 60 transition count 155
Iterating global reduction 8 with 4 rules applied. Total rules applied 864 place count 60 transition count 155
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 874 place count 55 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 880 place count 52 transition count 158
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 888 place count 52 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 890 place count 51 transition count 156
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 898 place count 51 transition count 148
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 907 place count 51 transition count 139
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 916 place count 42 transition count 139
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 921 place count 37 transition count 134
Iterating global reduction 9 with 5 rules applied. Total rules applied 926 place count 37 transition count 134
Applied a total of 926 rules in 71 ms. Remains 37 /551 variables (removed 514) and now considering 134/1118 (removed 984) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 37/551 places, 134/1118 transitions.
Finished random walk after 1754 steps, including 131 resets, run visited all 2 properties in 22 ms. (steps per millisecond=79 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 p2))), true, (X (X (OR (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 p2)))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(F (AND p0 p2)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 14 factoid took 286 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLFireability-06 finished in 3448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(p0)&&F(!p1))||G(p0)))))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 553 transition count 1120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 553 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 550 transition count 1117
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 549 transition count 1116
Applied a total of 24 rules in 47 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-31 03:23:55] [INFO ] Computed 6 invariants in 15 ms
[2024-05-31 03:23:55] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-31 03:23:55] [INFO ] Invariant cache hit.
[2024-05-31 03:23:55] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-05-31 03:23:55] [INFO ] Invariant cache hit.
[2024-05-31 03:23:56] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1102 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 583 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (EQ s151 1) (NOT (AND (EQ s22 1) (EQ s139 1) (EQ s234 1) (EQ s351 1) (EQ s468 1)))), p0:(NEQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 358 ms.
Product exploration explored 100000 steps with 33333 reset in 306 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLFireability-07 finished in 2400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(p1))))))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Graph (trivial) has 568 edges and 561 vertex of which 87 / 561 are part of one of the 15 SCC in 2 ms
Free SCC test removed 72 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 488 transition count 713
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 342 rules applied. Total rules applied 675 place count 156 transition count 703
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 681 place count 151 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 682 place count 150 transition count 702
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 682 place count 150 transition count 682
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 722 place count 130 transition count 682
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 731 place count 121 transition count 671
Iterating global reduction 4 with 9 rules applied. Total rules applied 740 place count 121 transition count 671
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 741 place count 121 transition count 670
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 742 place count 120 transition count 670
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 742 place count 120 transition count 669
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 744 place count 119 transition count 669
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 747 place count 116 transition count 664
Iterating global reduction 6 with 3 rules applied. Total rules applied 750 place count 116 transition count 664
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 752 place count 114 transition count 660
Iterating global reduction 6 with 2 rules applied. Total rules applied 754 place count 114 transition count 660
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 794 place count 94 transition count 640
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 806 place count 82 transition count 419
Iterating global reduction 6 with 12 rules applied. Total rules applied 818 place count 82 transition count 419
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 823 place count 82 transition count 414
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 826 place count 79 transition count 408
Iterating global reduction 7 with 3 rules applied. Total rules applied 829 place count 79 transition count 408
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 832 place count 76 transition count 402
Iterating global reduction 7 with 3 rules applied. Total rules applied 835 place count 76 transition count 402
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 853 place count 67 transition count 409
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 854 place count 66 transition count 399
Iterating global reduction 7 with 1 rules applied. Total rules applied 855 place count 66 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 856 place count 66 transition count 398
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 861 place count 66 transition count 393
Applied a total of 861 rules in 73 ms. Remains 66 /561 variables (removed 495) and now considering 393/1128 (removed 735) transitions.
[2024-05-31 03:23:57] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
// Phase 1: matrix 387 rows 66 cols
[2024-05-31 03:23:57] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 03:23:57] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 03:23:57] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-31 03:23:57] [INFO ] Invariant cache hit.
[2024-05-31 03:23:57] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 03:23:57] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-31 03:23:57] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 03:23:57] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-31 03:23:57] [INFO ] Invariant cache hit.
[2024-05-31 03:23:57] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/561 places, 393/1128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 457 ms. Remains : 66/561 places, 393/1128 transitions.
Stuttering acceptance computed with spot in 122 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s39 1), p0:(AND (EQ s8 1) (EQ s21 1) (EQ s33 1) (EQ s47 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3834 reset in 197 ms.
Product exploration explored 100000 steps with 9784 reset in 179 ms.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Detected a total of 3/66 stabilizing places and 19/393 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[p0, (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 994 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:23:58] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-31 03:23:58] [INFO ] Invariant cache hit.
[2024-05-31 03:23:58] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 03:23:58] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-31 03:23:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 03:23:58] [INFO ] After 46ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :1 sat :1
[2024-05-31 03:23:59] [INFO ] After 86ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-31 03:23:59] [INFO ] After 253ms SMT Verify possible using all constraints in real 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 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 393/393 transitions.
Graph (complete) has 359 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 65 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 12 place count 65 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 64 transition count 380
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 1 with 20 rules applied. Total rules applied 34 place count 54 transition count 370
Free-agglomeration rule applied 31 times.
Iterating global reduction 1 with 31 rules applied. Total rules applied 65 place count 54 transition count 339
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 22 transition count 306
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 17 transition count 301
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 17 transition count 301
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 171 place count 17 transition count 270
Performed 5 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 181 place count 12 transition count 123
Drop transitions removed 5 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 3 with 85 rules applied. Total rules applied 266 place count 12 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 268 place count 11 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 10 transition count 36
Applied a total of 269 rules in 27 ms. Remains 10 /66 variables (removed 56) and now considering 36/393 (removed 357) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 10/66 places, 36/393 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 8 factoid took 231 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Support contains 5 out of 66 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 393/393 transitions.
Applied a total of 0 rules in 19 ms. Remains 66 /66 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2024-05-31 03:23:59] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-31 03:23:59] [INFO ] Invariant cache hit.
[2024-05-31 03:23:59] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 03:23:59] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-31 03:23:59] [INFO ] Invariant cache hit.
[2024-05-31 03:23:59] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 03:23:59] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-31 03:23:59] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 03:23:59] [INFO ] Flow matrix only has 387 transitions (discarded 6 similar events)
[2024-05-31 03:23:59] [INFO ] Invariant cache hit.
[2024-05-31 03:23:59] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 389 ms. Remains : 66/66 places, 393/393 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 969 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 569747 steps, run visited all 1 properties in 1005 ms. (steps per millisecond=566 )
Probabilistic random walk after 569747 steps, saw 120855 distinct states, run finished after 1006 ms. (steps per millisecond=566 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Product exploration explored 100000 steps with 9686 reset in 165 ms.
Product exploration explored 100000 steps with 3717 reset in 90 ms.
Built C files in :
/tmp/ltsmin8137717808831765535
[2024-05-31 03:24:01] [INFO ] Computing symmetric may disable matrix : 393 transitions.
[2024-05-31 03:24:01] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:24:01] [INFO ] Computing symmetric may enable matrix : 393 transitions.
[2024-05-31 03:24:01] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:24:01] [INFO ] Computing Do-Not-Accords matrix : 393 transitions.
[2024-05-31 03:24:01] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:24:01] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8137717808831765535
Running compilation step : cd /tmp/ltsmin8137717808831765535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1110 ms.
Running link step : cd /tmp/ltsmin8137717808831765535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin8137717808831765535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13628947602467280598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 393/393 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 66 transition count 392
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 392
Applied a total of 2 rules in 15 ms. Remains 65 /66 variables (removed 1) and now considering 392/393 (removed 1) transitions.
[2024-05-31 03:24:16] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
// Phase 1: matrix 386 rows 65 cols
[2024-05-31 03:24:16] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 03:24:16] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-31 03:24:16] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
[2024-05-31 03:24:16] [INFO ] Invariant cache hit.
[2024-05-31 03:24:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 03:24:17] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-31 03:24:17] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 03:24:17] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
[2024-05-31 03:24:17] [INFO ] Invariant cache hit.
[2024-05-31 03:24:17] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/66 places, 392/393 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 408 ms. Remains : 65/66 places, 392/393 transitions.
Built C files in :
/tmp/ltsmin10254561713957586799
[2024-05-31 03:24:17] [INFO ] Computing symmetric may disable matrix : 392 transitions.
[2024-05-31 03:24:17] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:24:17] [INFO ] Computing symmetric may enable matrix : 392 transitions.
[2024-05-31 03:24:17] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:24:17] [INFO ] Computing Do-Not-Accords matrix : 392 transitions.
[2024-05-31 03:24:17] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:24:17] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10254561713957586799
Running compilation step : cd /tmp/ltsmin10254561713957586799;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1031 ms.
Running link step : cd /tmp/ltsmin10254561713957586799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10254561713957586799;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8047821439690061978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 03:24:32] [INFO ] Flatten gal took : 39 ms
[2024-05-31 03:24:32] [INFO ] Flatten gal took : 34 ms
[2024-05-31 03:24:32] [INFO ] Time to serialize gal into /tmp/LTL17981637336971111392.gal : 6 ms
[2024-05-31 03:24:32] [INFO ] Time to serialize properties into /tmp/LTL9635572530854213065.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17981637336971111392.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6420824694828461136.hoa' '-atoms' '/tmp/LTL9635572530854213065.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9635572530854213065.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6420824694828461136.hoa
Reverse transition relation is NOT exact ! Due to transitions t70.t71.t72.t73.t74.t582, t79, t170.t171.t172.t173.t174.t596, t179, t277.t278, t368.t369.t370...682
Computing Next relation with stutter on 16531 deadlock states
17 unique states visited
0 strongly connected components in search stack
32 transitions explored
17 items max in DFS search stack
687 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,6.99335,195500,1,0,539,528798,807,391,11244,577029,925
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-05b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyElection-PT-05b-LTLFireability-09 finished in 42666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(p0))) U p1)))'
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 551 transition count 1118
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 550 transition count 1117
Applied a total of 22 rules in 42 ms. Remains 550 /561 variables (removed 11) and now considering 1117/1128 (removed 11) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2024-05-31 03:24:40] [INFO ] Computed 6 invariants in 16 ms
[2024-05-31 03:24:40] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-31 03:24:40] [INFO ] Invariant cache hit.
[2024-05-31 03:24:40] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-31 03:24:40] [INFO ] Invariant cache hit.
[2024-05-31 03:24:41] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 550/561 places, 1117/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1099 ms. Remains : 550/561 places, 1117/1128 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s298 1), p0:(AND (EQ s22 1) (EQ s150 1) (EQ s256 1) (EQ s363 1) (EQ s469 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-10 finished in 1287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p1)&&G(p2))))))'
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 551 transition count 1118
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 550 transition count 1117
Applied a total of 22 rules in 45 ms. Remains 550 /561 variables (removed 11) and now considering 1117/1128 (removed 11) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2024-05-31 03:24:41] [INFO ] Computed 6 invariants in 16 ms
[2024-05-31 03:24:41] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-31 03:24:41] [INFO ] Invariant cache hit.
[2024-05-31 03:24:42] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-31 03:24:42] [INFO ] Invariant cache hit.
[2024-05-31 03:24:42] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 550/561 places, 1117/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1106 ms. Remains : 550/561 places, 1117/1128 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s360 0), p2:(EQ s360 1), p1:(OR (EQ s360 0) (EQ s69 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Product exploration explored 100000 steps with 50000 reset in 361 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 98 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLFireability-11 finished in 2114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U G((!p2||F(p3))))))'
Support contains 14 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 553 transition count 1120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 553 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 550 transition count 1117
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 549 transition count 1116
Applied a total of 24 rules in 47 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-31 03:24:43] [INFO ] Computed 6 invariants in 14 ms
[2024-05-31 03:24:43] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-31 03:24:43] [INFO ] Invariant cache hit.
[2024-05-31 03:24:44] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2024-05-31 03:24:44] [INFO ] Invariant cache hit.
[2024-05-31 03:24:44] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1019 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) p2 (NOT p3)), (AND p2 (NOT p3) (NOT p0)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) p2), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p3) p2)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p3) p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s36 1), p2:(AND (EQ s44 1) (EQ s150 1) (EQ s234 1) (EQ s362 1) (EQ s468 1)), p3:(AND (EQ s58 1) (EQ s175 1) (EQ s292 1) (EQ s398 1) (EQ s482 1)), p...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1115 reset in 142 ms.
Product exploration explored 100000 steps with 1114 reset in 162 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p3) (NOT p0))), (X (NOT (AND p2 (NOT p3) p1 (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 103 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND p2 (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 643748 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 643748 steps, saw 110336 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:24:48] [INFO ] Invariant cache hit.
[2024-05-31 03:24:48] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 03:24:48] [INFO ] After 394ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 03:24:49] [INFO ] After 591ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 136 ms.
[2024-05-31 03:24:49] [INFO ] After 827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 10 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 553 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1041 edges and 479 vertex of which 474 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 334 rules applied. Total rules applied 336 place count 474 transition count 687
Reduce places removed 329 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 339 rules applied. Total rules applied 675 place count 145 transition count 677
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 680 place count 140 transition count 677
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 680 place count 140 transition count 651
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 732 place count 114 transition count 651
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 733 place count 114 transition count 650
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 785 place count 88 transition count 624
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 795 place count 88 transition count 614
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 809 place count 74 transition count 378
Iterating global reduction 5 with 14 rules applied. Total rules applied 823 place count 74 transition count 378
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 827 place count 74 transition count 374
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 832 place count 69 transition count 369
Iterating global reduction 6 with 5 rules applied. Total rules applied 837 place count 69 transition count 369
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 847 place count 64 transition count 364
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 853 place count 61 transition count 372
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 861 place count 61 transition count 364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 863 place count 60 transition count 370
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 871 place count 60 transition count 362
Free-agglomeration rule applied 33 times.
Iterating global reduction 6 with 33 rules applied. Total rules applied 904 place count 60 transition count 329
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 38 rules applied. Total rules applied 942 place count 27 transition count 324
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 947 place count 22 transition count 319
Iterating global reduction 7 with 5 rules applied. Total rules applied 952 place count 22 transition count 319
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 971 place count 22 transition count 300
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 8 with 62 rules applied. Total rules applied 1033 place count 22 transition count 238
Applied a total of 1033 rules in 67 ms. Remains 22 /549 variables (removed 527) and now considering 238/1116 (removed 878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 22/549 places, 238/1116 transitions.
Finished random walk after 739 steps, including 67 resets, run visited all 2 properties in 4 ms. (steps per millisecond=184 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p3) (NOT p0))), (X (NOT (AND p2 (NOT p3) p1 (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F p3)]
Knowledge based reduction with 16 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 64 ms :[(AND p2 (NOT p3)), (NOT p3)]
Support contains 10 out of 549 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 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 548 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 314 place count 478 transition count 722
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 323 rules applied. Total rules applied 637 place count 165 transition count 712
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 643 place count 160 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 644 place count 159 transition count 711
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 644 place count 159 transition count 690
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 686 place count 138 transition count 690
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 690 place count 134 transition count 686
Iterating global reduction 4 with 4 rules applied. Total rules applied 694 place count 134 transition count 686
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 742 place count 110 transition count 662
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 754 place count 98 transition count 512
Iterating global reduction 4 with 12 rules applied. Total rules applied 766 place count 98 transition count 512
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 768 place count 98 transition count 510
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 773 place count 93 transition count 500
Iterating global reduction 5 with 5 rules applied. Total rules applied 778 place count 93 transition count 500
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 783 place count 88 transition count 490
Iterating global reduction 5 with 5 rules applied. Total rules applied 788 place count 88 transition count 490
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 806 place count 79 transition count 497
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 807 place count 78 transition count 487
Iterating global reduction 5 with 1 rules applied. Total rules applied 808 place count 78 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 809 place count 78 transition count 486
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 814 place count 78 transition count 481
Applied a total of 814 rules in 66 ms. Remains 78 /549 variables (removed 471) and now considering 481/1116 (removed 635) transitions.
[2024-05-31 03:24:49] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
// Phase 1: matrix 475 rows 78 cols
[2024-05-31 03:24:49] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 03:24:49] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 03:24:49] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2024-05-31 03:24:49] [INFO ] Invariant cache hit.
[2024-05-31 03:24:49] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 03:24:50] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-31 03:24:50] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 03:24:50] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2024-05-31 03:24:50] [INFO ] Invariant cache hit.
[2024-05-31 03:24:50] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/549 places, 481/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 78/549 places, 481/1116 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND p2 (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 943 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1485868 steps, run timeout after 3001 ms. (steps per millisecond=495 ) properties seen :{0=1}
Probabilistic random walk after 1485868 steps, saw 288912 distinct states, run finished after 3003 ms. (steps per millisecond=494 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-31 03:24:53] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2024-05-31 03:24:53] [INFO ] Invariant cache hit.
[2024-05-31 03:24:53] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 03:24:53] [INFO ] After 109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 03:24:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 03:24:53] [INFO ] After 38ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 03:24:53] [INFO ] After 67ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-31 03:24:53] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 481/481 transitions.
Graph (complete) has 398 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 77 transition count 459
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 32 place count 67 transition count 459
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 62 transition count 248
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 62 transition count 248
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 47 place count 62 transition count 243
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 67 place count 52 transition count 233
Free-agglomeration rule applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 96 place count 52 transition count 204
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 135 place count 22 transition count 195
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 140 place count 17 transition count 190
Iterating global reduction 4 with 5 rules applied. Total rules applied 145 place count 17 transition count 190
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 176 place count 17 transition count 159
Performed 5 Post agglomeration using F-continuation condition with reduction of 85 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 186 place count 12 transition count 69
Drop transitions removed 5 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 217 place count 12 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 219 place count 11 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 10 transition count 36
Applied a total of 220 rules in 22 ms. Remains 10 /78 variables (removed 68) and now considering 36/481 (removed 445) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 10/78 places, 36/481 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F p3)]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 69 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 68 ms :[(AND p2 (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 2579 reset in 76 ms.
Product exploration explored 100000 steps with 4035 reset in 106 ms.
Built C files in :
/tmp/ltsmin1081441329896731710
[2024-05-31 03:24:54] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2024-05-31 03:24:54] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:24:54] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2024-05-31 03:24:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:24:54] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2024-05-31 03:24:54] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:24:54] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1081441329896731710
Running compilation step : cd /tmp/ltsmin1081441329896731710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1371 ms.
Running link step : cd /tmp/ltsmin1081441329896731710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1081441329896731710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2093569298294528253.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 481/481 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 78 transition count 476
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 73 transition count 476
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 72 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 72 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 72 transition count 394
Applied a total of 13 rules in 23 ms. Remains 72 /78 variables (removed 6) and now considering 394/481 (removed 87) transitions.
[2024-05-31 03:25:09] [INFO ] Flow matrix only has 388 transitions (discarded 6 similar events)
// Phase 1: matrix 388 rows 72 cols
[2024-05-31 03:25:09] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 03:25:09] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 03:25:09] [INFO ] Flow matrix only has 388 transitions (discarded 6 similar events)
[2024-05-31 03:25:09] [INFO ] Invariant cache hit.
[2024-05-31 03:25:09] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 03:25:09] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-31 03:25:09] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 03:25:09] [INFO ] Flow matrix only has 388 transitions (discarded 6 similar events)
[2024-05-31 03:25:09] [INFO ] Invariant cache hit.
[2024-05-31 03:25:09] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/78 places, 394/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 416 ms. Remains : 72/78 places, 394/481 transitions.
Built C files in :
/tmp/ltsmin10493236626640932206
[2024-05-31 03:25:09] [INFO ] Computing symmetric may disable matrix : 394 transitions.
[2024-05-31 03:25:09] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:25:09] [INFO ] Computing symmetric may enable matrix : 394 transitions.
[2024-05-31 03:25:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:25:09] [INFO ] Computing Do-Not-Accords matrix : 394 transitions.
[2024-05-31 03:25:09] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:25:09] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10493236626640932206
Running compilation step : cd /tmp/ltsmin10493236626640932206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1018 ms.
Running link step : cd /tmp/ltsmin10493236626640932206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10493236626640932206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6648040024952752686.hoa' '--buchi-type=spotba'
LTSmin run took 1875 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05b-LTLFireability-12 finished in 29215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||(p1&&X(p2)))))'
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 554 transition count 1121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 554 transition count 1121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 552 transition count 1119
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 552 transition count 1119
Applied a total of 18 rules in 35 ms. Remains 552 /561 variables (removed 9) and now considering 1119/1128 (removed 9) transitions.
// Phase 1: matrix 1119 rows 552 cols
[2024-05-31 03:25:12] [INFO ] Computed 6 invariants in 12 ms
[2024-05-31 03:25:12] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-31 03:25:12] [INFO ] Invariant cache hit.
[2024-05-31 03:25:13] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-05-31 03:25:13] [INFO ] Invariant cache hit.
[2024-05-31 03:25:13] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 552/561 places, 1119/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1070 ms. Remains : 552/561 places, 1119/1128 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 3}]], initial=5, aps=[p2:(EQ s510 1), p0:(NEQ s111 1), p1:(EQ s230 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-13 finished in 1338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((!p0||X(X(p1))))) U (X(X(p3))&&p2)))'
Support contains 8 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 1128/1128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 553 transition count 1120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 553 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 550 transition count 1117
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 549 transition count 1116
Applied a total of 24 rules in 49 ms. Remains 549 /561 variables (removed 12) and now considering 1116/1128 (removed 12) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-31 03:25:14] [INFO ] Computed 6 invariants in 17 ms
[2024-05-31 03:25:14] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-31 03:25:14] [INFO ] Invariant cache hit.
[2024-05-31 03:25:14] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-31 03:25:14] [INFO ] Invariant cache hit.
[2024-05-31 03:25:15] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/561 places, 1116/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1083 ms. Remains : 549/561 places, 1116/1128 transitions.
Stuttering acceptance computed with spot in 627 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=p2, acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=5 dest: 3}], [{ cond=(AND p2 p0 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s98 1) (EQ s548 1)), p0:(AND (EQ s98 1) (EQ s548 1)), p3:(AND (EQ s58 1) (EQ s186 1) (EQ s281 1) (EQ s398 1) (EQ s504 1)), p1:(EQ s459 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33171 reset in 314 ms.
Product exploration explored 100000 steps with 33274 reset in 269 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 106 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 8) seen :0
Finished Best-First random walk after 543 steps, including 0 resets, run visited all 8 properties in 4 ms. (steps per millisecond=135 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (AND p0 (NOT p3))), (F (AND p0 p2 (NOT p3))), (F (AND p2 (NOT p3))), (F p2), (F (AND p0 p2)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 265 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
[2024-05-31 03:25:18] [INFO ] Invariant cache hit.
[2024-05-31 03:25:18] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:18] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-05-31 03:25:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:19] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2024-05-31 03:25:19] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 81 ms.
[2024-05-31 03:25:20] [INFO ] Added : 79 causal constraints over 16 iterations in 852 ms. Result :sat
Could not prove EG (NOT p2)
[2024-05-31 03:25:20] [INFO ] Invariant cache hit.
[2024-05-31 03:25:20] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:20] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2024-05-31 03:25:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:21] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2024-05-31 03:25:21] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 70 ms.
[2024-05-31 03:25:22] [INFO ] Added : 80 causal constraints over 16 iterations in 859 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 8 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 10 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-31 03:25:22] [INFO ] Invariant cache hit.
[2024-05-31 03:25:22] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-31 03:25:22] [INFO ] Invariant cache hit.
[2024-05-31 03:25:23] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-05-31 03:25:23] [INFO ] Invariant cache hit.
[2024-05-31 03:25:23] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1008 ms. Remains : 549/549 places, 1116/1116 transitions.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 109 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Finished Best-First random walk after 1778 steps, including 2 resets, run visited all 8 properties in 6 ms. (steps per millisecond=296 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (AND p0 (NOT p3))), (F (AND p0 p2 (NOT p3))), (F (AND p2 (NOT p3))), (F p2), (F (AND p0 p2)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 357 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
[2024-05-31 03:25:25] [INFO ] Invariant cache hit.
[2024-05-31 03:25:25] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:26] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2024-05-31 03:25:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:26] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-05-31 03:25:26] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 63 ms.
[2024-05-31 03:25:27] [INFO ] Added : 79 causal constraints over 16 iterations in 846 ms. Result :sat
Could not prove EG (NOT p2)
[2024-05-31 03:25:27] [INFO ] Invariant cache hit.
[2024-05-31 03:25:27] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:28] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2024-05-31 03:25:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 03:25:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:28] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2024-05-31 03:25:29] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 60 ms.
[2024-05-31 03:25:29] [INFO ] Added : 80 causal constraints over 16 iterations in 839 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 33439 reset in 284 ms.
Product exploration explored 100000 steps with 33327 reset in 283 ms.
Applying partial POR strategy [false, false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Support contains 8 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 552 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Performed 321 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 321 rules applied. Total rules applied 322 place count 479 transition count 1036
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 327 place count 479 transition count 1031
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 327 place count 479 transition count 1036
Deduced a syphon composed of 331 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 479 transition count 1036
Discarding 272 places :
Symmetric choice reduction at 2 with 272 rule applications. Total rules 609 place count 207 transition count 764
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 2 with 272 rules applied. Total rules applied 881 place count 207 transition count 764
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 921 place count 207 transition count 764
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 972 place count 156 transition count 413
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 1023 place count 156 transition count 413
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1029 place count 156 transition count 407
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1045 place count 140 transition count 386
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 1061 place count 140 transition count 386
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1066 place count 135 transition count 381
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 1071 place count 135 transition count 381
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1079 place count 135 transition count 421
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1092 place count 122 transition count 395
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 1105 place count 122 transition count 395
Deduced a syphon composed of 52 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 1115 place count 122 transition count 385
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 1115 rules in 84 ms. Remains 122 /549 variables (removed 427) and now considering 385/1116 (removed 731) transitions.
[2024-05-31 03:25:31] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 03:25:31] [INFO ] Flow matrix only has 379 transitions (discarded 6 similar events)
// Phase 1: matrix 379 rows 122 cols
[2024-05-31 03:25:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 03:25:31] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/549 places, 385/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 122/549 places, 385/1116 transitions.
Built C files in :
/tmp/ltsmin6213959214965320400
[2024-05-31 03:25:31] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6213959214965320400
Running compilation step : cd /tmp/ltsmin6213959214965320400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2136 ms.
Running link step : cd /tmp/ltsmin6213959214965320400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6213959214965320400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1628251642594485342.hoa' '--buchi-type=spotba'
LTSmin run took 312 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05b-LTLFireability-15 finished in 20012 ms.
All properties solved by simple procedures.
Total runtime 125759 ms.

BK_STOP 1717125935051

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-05b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is StigmergyElection-PT-05b, 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 r417-tall-171690556000193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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