Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.5K May 30 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 30 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 30 15:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 30 15:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 25 13:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 25 13:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 13K May 30 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K May 30 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 30 15:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 30 15:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 227K May 29 12:20 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654772204140

Running Version 202205111006
[2022-06-09 10:56:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 10:56:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 10:56:46] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2022-06-09 10:56:46] [INFO ] Transformed 184 places.
[2022-06-09 10:56:46] [INFO ] Transformed 592 transitions.
[2022-06-09 10:56:46] [INFO ] Found NUPN structural information;
[2022-06-09 10:56:46] [INFO ] Parsed PT model containing 184 places and 592 transitions in 389 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 291 transitions
Reduce redundant transitions removed 291 transitions.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 301/301 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 148 transition count 260
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 148 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 148 transition count 256
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 90 place count 134 transition count 239
Iterating global reduction 1 with 14 rules applied. Total rules applied 104 place count 134 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 107 place count 134 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 131 transition count 233
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 131 transition count 233
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 128 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 128 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 125 transition count 227
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 125 transition count 227
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 122 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 122 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 134 place count 122 transition count 221
Applied a total of 134 rules in 84 ms. Remains 122 /184 variables (removed 62) and now considering 221/301 (removed 80) transitions.
[2022-06-09 10:56:46] [INFO ] Flow matrix only has 215 transitions (discarded 6 similar events)
// Phase 1: matrix 215 rows 122 cols
[2022-06-09 10:56:46] [INFO ] Computed 2 place invariants in 25 ms
[2022-06-09 10:56:47] [INFO ] Implicit Places using invariants in 339 ms returned []
[2022-06-09 10:56:47] [INFO ] Flow matrix only has 215 transitions (discarded 6 similar events)
// Phase 1: matrix 215 rows 122 cols
[2022-06-09 10:56:47] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 10:56:47] [INFO ] State equation strengthened by 114 read => feed constraints.
[2022-06-09 10:56:47] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2022-06-09 10:56:47] [INFO ] Flow matrix only has 215 transitions (discarded 6 similar events)
// Phase 1: matrix 215 rows 122 cols
[2022-06-09 10:56:47] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 10:56:47] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/184 places, 221/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/184 places, 221/301 transitions.
Support contains 23 out of 122 places after structural reductions.
[2022-06-09 10:56:48] [INFO ] Flatten gal took : 70 ms
[2022-06-09 10:56:48] [INFO ] Flatten gal took : 32 ms
[2022-06-09 10:56:48] [INFO ] Input system was already deterministic with 221 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-09 10:56:48] [INFO ] Flow matrix only has 215 transitions (discarded 6 similar events)
// Phase 1: matrix 215 rows 122 cols
[2022-06-09 10:56:48] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 10:56:48] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 10:56:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 10:56:49] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-06-09 10:56:49] [INFO ] State equation strengthened by 114 read => feed constraints.
[2022-06-09 10:56:49] [INFO ] After 33ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-06-09 10:56:49] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 4 ms to minimize.
[2022-06-09 10:56:49] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2022-06-09 10:56:49] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2022-06-09 10:56:49] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2022-06-09 10:56:49] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2022-06-09 10:56:49] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2022-06-09 10:56:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 639 ms
[2022-06-09 10:56:49] [INFO ] After 691ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-09 10:56:49] [INFO ] After 897ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 221/221 transitions.
Graph (complete) has 273 edges and 122 vertex of which 121 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 121 transition count 199
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 40 place count 111 transition count 191
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 40 place count 111 transition count 167
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 88 place count 87 transition count 167
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 75 transition count 153
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 75 transition count 153
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 120 place count 67 transition count 145
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 67 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 133 place count 67 transition count 140
Performed 20 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 173 place count 47 transition count 117
Drop transitions removed 5 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 181 place count 47 transition count 109
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 193 place count 35 transition count 97
Iterating global reduction 4 with 12 rules applied. Total rules applied 205 place count 35 transition count 97
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 235 place count 35 transition count 67
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 240 place count 30 transition count 62
Iterating global reduction 5 with 5 rules applied. Total rules applied 245 place count 30 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 30 transition count 61
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 250 place count 26 transition count 57
Iterating global reduction 6 with 4 rules applied. Total rules applied 254 place count 26 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 25 transition count 56
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 4 rules applied. Total rules applied 259 place count 24 transition count 53
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 262 place count 21 transition count 53
Performed 8 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 278 place count 13 transition count 19
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 284 place count 13 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 11 rules applied. Total rules applied 295 place count 6 transition count 9
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 299 place count 6 transition count 5
Applied a total of 299 rules in 65 ms. Remains 6 /122 variables (removed 116) and now considering 5/221 (removed 216) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/122 places, 5/221 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA StigmergyCommit-PT-04a-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 34 stabilizing places and 33 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(F(p0)))) U G(p1)))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 120 transition count 155
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 82 rules applied. Total rules applied 148 place count 55 transition count 138
Reduce places removed 5 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 2 with 15 rules applied. Total rules applied 163 place count 50 transition count 128
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 172 place count 45 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 174 place count 43 transition count 124
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 174 place count 43 transition count 119
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 184 place count 38 transition count 119
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 189 place count 33 transition count 112
Iterating global reduction 5 with 5 rules applied. Total rules applied 194 place count 33 transition count 112
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 209 place count 33 transition count 97
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 209 place count 33 transition count 94
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 215 place count 30 transition count 94
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 223 place count 26 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 227 place count 26 transition count 86
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 7 with 47 rules applied. Total rules applied 274 place count 26 transition count 39
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 7 with 10 rules applied. Total rules applied 284 place count 21 transition count 34
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 286 place count 21 transition count 34
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 289 place count 18 transition count 31
Applied a total of 289 rules in 35 ms. Remains 18 /122 variables (removed 104) and now considering 31/221 (removed 190) transitions.
[2022-06-09 10:56:50] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 18 cols
[2022-06-09 10:56:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:56:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-06-09 10:56:50] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 18 cols
[2022-06-09 10:56:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:56:50] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-06-09 10:56:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-06-09 10:56:50] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 10:56:50] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 18 cols
[2022-06-09 10:56:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 10:56:50] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/122 places, 31/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/122 places, 31/221 transitions.
Stuttering acceptance computed with spot in 366 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s4 0) (EQ s12 1)), p0:(OR (EQ s14 0) (EQ s9 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 0 reset in 280 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/18 stabilizing places and 4/31 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0)]
Knowledge based reduction with 8 factoid took 416 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 801 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:56:51] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 18 cols
[2022-06-09 10:56:51] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 10:56:51] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:56:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 10:56:51] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:56:51] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-06-09 10:56:51] [INFO ] After 8ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:56:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2022-06-09 10:56:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-06-09 10:56:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 52 ms
[2022-06-09 10:56:51] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-09 10:56:51] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (F (AND p1 (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 502 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (NOT p0)]
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2022-06-09 10:56:52] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 18 cols
[2022-06-09 10:56:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:56:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-06-09 10:56:52] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 18 cols
[2022-06-09 10:56:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 10:56:52] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-06-09 10:56:52] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-06-09 10:56:52] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 10:56:52] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 18 cols
[2022-06-09 10:56:52] [INFO ] Computed 1 place invariants in 7 ms
[2022-06-09 10:56:52] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 31/31 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/18 stabilizing places and 4/31 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p0), (NOT p0)]
Finished random walk after 178 steps, including 18 resets, run visited all 2 properties in 2 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Built C files in :
/tmp/ltsmin4435413954089914434
[2022-06-09 10:56:54] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2022-06-09 10:56:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:56:54] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2022-06-09 10:56:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:56:54] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2022-06-09 10:56:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:56:54] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4435413954089914434
Running compilation step : cd /tmp/ltsmin4435413954089914434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 336 ms.
Running link step : cd /tmp/ltsmin4435413954089914434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin4435413954089914434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2121994491330190575.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-02 finished in 4508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(F(G(X(p0))))))))'
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 221/221 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 120 transition count 150
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 88 rules applied. Total rules applied 159 place count 50 transition count 132
Reduce places removed 5 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 2 with 15 rules applied. Total rules applied 174 place count 45 transition count 122
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 182 place count 40 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 39 transition count 119
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 183 place count 39 transition count 115
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 191 place count 35 transition count 115
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 196 place count 30 transition count 108
Iterating global reduction 5 with 5 rules applied. Total rules applied 201 place count 30 transition count 108
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 232 place count 30 transition count 77
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 232 place count 30 transition count 74
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 238 place count 27 transition count 74
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 248 place count 22 transition count 69
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 253 place count 22 transition count 64
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 7 with 35 rules applied. Total rules applied 288 place count 22 transition count 29
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 7 with 10 rules applied. Total rules applied 298 place count 17 transition count 24
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 302 place count 13 transition count 20
Applied a total of 302 rules in 21 ms. Remains 13 /122 variables (removed 109) and now considering 20/221 (removed 201) transitions.
[2022-06-09 10:56:54] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 13 cols
[2022-06-09 10:56:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 10:56:54] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-06-09 10:56:54] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 13 cols
[2022-06-09 10:56:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:56:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-06-09 10:56:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-06-09 10:56:54] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 10:56:54] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 13 cols
[2022-06-09 10:56:54] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 10:56:54] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/122 places, 20/221 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/122 places, 20/221 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 64 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/13 stabilizing places and 2/20 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2022-06-09 10:56:55] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 13 cols
[2022-06-09 10:56:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 10:56:55] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-06-09 10:56:55] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 13 cols
[2022-06-09 10:56:55] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:56:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-06-09 10:56:55] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-06-09 10:56:55] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 10:56:55] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 13 cols
[2022-06-09 10:56:55] [INFO ] Computed 1 place invariants in 7 ms
[2022-06-09 10:56:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/13 places, 20/20 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/13 stabilizing places and 2/20 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 50 ms.
Product exploration explored 100000 steps with 0 reset in 63 ms.
Built C files in :
/tmp/ltsmin8269061362089668095
[2022-06-09 10:56:56] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2022-06-09 10:56:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:56:56] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2022-06-09 10:56:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:56:56] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2022-06-09 10:56:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:56:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8269061362089668095
Running compilation step : cd /tmp/ltsmin8269061362089668095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin8269061362089668095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8269061362089668095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13763656177928871501.hoa' '--buchi-type=spotba'
LTSmin run took 57 ms.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-06 finished in 1692 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !F(p1))||G(G(X(G(X(p2)))))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 221/221 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 114 transition count 211
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 114 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 114 transition count 210
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 109 transition count 205
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 109 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 109 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 107 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 107 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 106 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 106 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 105 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 105 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 105 transition count 198
Applied a total of 38 rules in 15 ms. Remains 105 /122 variables (removed 17) and now considering 198/221 (removed 23) transitions.
[2022-06-09 10:56:56] [INFO ] Flow matrix only has 192 transitions (discarded 6 similar events)
// Phase 1: matrix 192 rows 105 cols
[2022-06-09 10:56:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:56:56] [INFO ] Implicit Places using invariants in 95 ms returned []
[2022-06-09 10:56:56] [INFO ] Flow matrix only has 192 transitions (discarded 6 similar events)
// Phase 1: matrix 192 rows 105 cols
[2022-06-09 10:56:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:56:56] [INFO ] State equation strengthened by 107 read => feed constraints.
[2022-06-09 10:56:56] [INFO ] Implicit Places using invariants and state equation in 332 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 432 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/122 places, 198/221 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 90 transition count 184
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 90 transition count 184
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 90 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 85 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 85 transition count 174
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 80 transition count 169
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 80 transition count 169
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 75 transition count 164
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 75 transition count 164
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 71 transition count 160
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 71 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 68 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 68 transition count 157
Applied a total of 77 rules in 14 ms. Remains 68 /104 variables (removed 36) and now considering 157/198 (removed 41) transitions.
[2022-06-09 10:56:56] [INFO ] Flow matrix only has 151 transitions (discarded 6 similar events)
// Phase 1: matrix 151 rows 68 cols
[2022-06-09 10:56:56] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:56:56] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-06-09 10:56:56] [INFO ] Flow matrix only has 151 transitions (discarded 6 similar events)
// Phase 1: matrix 151 rows 68 cols
[2022-06-09 10:56:56] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 10:56:56] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-09 10:56:57] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 68/122 places, 157/221 transitions.
Finished structural reductions, in 2 iterations. Remains : 68/122 places, 157/221 transitions.
Stuttering acceptance computed with spot in 382 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), true, (AND (NOT p2) p1), (AND p1 (NOT p2)), p1, p1]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=p1, acceptance={} source=8 dest: 5}, { cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 9}, { cond=(AND p1 p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(OR (EQ s24 0) (EQ s66 1)), p0:(EQ s40 1), p2:(EQ s40 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-07 finished in 1026 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))||X(p1))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 221/221 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 117 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 117 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 117 transition count 214
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 114 transition count 211
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 114 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 113 transition count 209
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 113 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 112 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 112 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 111 transition count 207
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 111 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 111 transition count 206
Applied a total of 25 rules in 17 ms. Remains 111 /122 variables (removed 11) and now considering 206/221 (removed 15) transitions.
[2022-06-09 10:56:57] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
// Phase 1: matrix 200 rows 111 cols
[2022-06-09 10:56:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:56:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2022-06-09 10:56:57] [INFO ] Flow matrix only has 200 transitions (discarded 6 similar events)
// Phase 1: matrix 200 rows 111 cols
[2022-06-09 10:56:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:56:57] [INFO ] State equation strengthened by 110 read => feed constraints.
[2022-06-09 10:56:57] [INFO ] Implicit Places using invariants and state equation in 296 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 386 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/122 places, 206/221 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 97 transition count 193
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 97 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 97 transition count 188
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 92 transition count 183
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 92 transition count 183
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 87 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 87 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 82 transition count 173
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 82 transition count 173
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 77 transition count 168
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 77 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 73 transition count 164
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 73 transition count 164
Applied a total of 79 rules in 14 ms. Remains 73 /110 variables (removed 37) and now considering 164/206 (removed 42) transitions.
[2022-06-09 10:56:57] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
// Phase 1: matrix 158 rows 73 cols
[2022-06-09 10:56:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:56:57] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-06-09 10:56:57] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
// Phase 1: matrix 158 rows 73 cols
[2022-06-09 10:56:57] [INFO ] Computed 1 place invariants in 10 ms
[2022-06-09 10:56:57] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-09 10:56:58] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 73/122 places, 164/221 transitions.
Finished structural reductions, in 2 iterations. Remains : 73/122 places, 164/221 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s38 0) (EQ s49 1)), p1:(EQ s20 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-11 finished in 1347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0) U p0))))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 221/221 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 115 transition count 212
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 115 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 115 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 112 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 112 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 112 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 111 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 111 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 110 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 110 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 109 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 109 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 109 transition count 202
Applied a total of 30 rules in 20 ms. Remains 109 /122 variables (removed 13) and now considering 202/221 (removed 19) transitions.
[2022-06-09 10:56:58] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
// Phase 1: matrix 196 rows 109 cols
[2022-06-09 10:56:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:56:58] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-06-09 10:56:58] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
// Phase 1: matrix 196 rows 109 cols
[2022-06-09 10:56:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:56:58] [INFO ] State equation strengthened by 109 read => feed constraints.
[2022-06-09 10:56:59] [INFO ] Implicit Places using invariants and state equation in 281 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 376 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/122 places, 202/221 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 94 transition count 188
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 94 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 94 transition count 184
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 89 transition count 179
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 89 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 84 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 84 transition count 174
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 79 transition count 169
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 79 transition count 169
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 74 transition count 164
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 74 transition count 164
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 70 transition count 160
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 70 transition count 160
Applied a total of 80 rules in 17 ms. Remains 70 /108 variables (removed 38) and now considering 160/202 (removed 42) transitions.
[2022-06-09 10:56:59] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
// Phase 1: matrix 154 rows 70 cols
[2022-06-09 10:56:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:56:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-06-09 10:56:59] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
// Phase 1: matrix 154 rows 70 cols
[2022-06-09 10:56:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:56:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-09 10:56:59] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 70/122 places, 160/221 transitions.
Finished structural reductions, in 2 iterations. Remains : 70/122 places, 160/221 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s61 0) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-12 finished in 1050 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((!(G(!p0) U p0)||(p0 U p1))))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 221/221 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 116 transition count 214
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 116 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 116 transition count 213
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 113 transition count 210
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 113 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 209
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 111 transition count 207
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 111 transition count 207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 109 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 109 transition count 205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 107 transition count 203
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 107 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 107 transition count 201
Applied a total of 34 rules in 17 ms. Remains 107 /122 variables (removed 15) and now considering 201/221 (removed 20) transitions.
[2022-06-09 10:56:59] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
// Phase 1: matrix 195 rows 107 cols
[2022-06-09 10:56:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:56:59] [INFO ] Implicit Places using invariants in 73 ms returned []
[2022-06-09 10:56:59] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
// Phase 1: matrix 195 rows 107 cols
[2022-06-09 10:56:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:57:00] [INFO ] State equation strengthened by 107 read => feed constraints.
[2022-06-09 10:57:00] [INFO ] Implicit Places using invariants and state equation in 299 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 378 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/122 places, 201/221 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 189
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 94 transition count 184
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 90 transition count 180
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 90 transition count 180
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 86 transition count 176
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 86 transition count 176
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 82 transition count 172
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 82 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 78 transition count 168
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 78 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 74 transition count 164
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 74 transition count 164
Applied a total of 69 rules in 11 ms. Remains 74 /106 variables (removed 32) and now considering 164/201 (removed 37) transitions.
[2022-06-09 10:57:00] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
// Phase 1: matrix 158 rows 74 cols
[2022-06-09 10:57:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:57:00] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-06-09 10:57:00] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
// Phase 1: matrix 158 rows 74 cols
[2022-06-09 10:57:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:57:00] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-09 10:57:00] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 74/122 places, 164/221 transitions.
Finished structural reductions, in 2 iterations. Remains : 74/122 places, 164/221 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), true]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s55 0) (EQ s5 1)), p1:(OR (EQ s22 0) (EQ s66 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]]
Product exploration explored 100000 steps with 1 reset in 272 ms.
Product exploration explored 100000 steps with 0 reset in 324 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 158 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 30 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:57:01] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
// Phase 1: matrix 158 rows 74 cols
[2022-06-09 10:57:01] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 10:57:01] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:57:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 10:57:01] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:57:01] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-09 10:57:01] [INFO ] After 26ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:57:01] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2022-06-09 10:57:01] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2022-06-09 10:57:01] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2022-06-09 10:57:02] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2022-06-09 10:57:02] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2022-06-09 10:57:02] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2022-06-09 10:57:02] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2022-06-09 10:57:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 399 ms
[2022-06-09 10:57:02] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-09 10:57:02] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), true, (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 74 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 : 74/74 places, 164/164 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 73 transition count 141
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 51 transition count 139
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 50 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 49 transition count 137
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 50 place count 49 transition count 132
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 60 place count 44 transition count 132
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 92 place count 28 transition count 113
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 104 place count 28 transition count 101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 112 place count 24 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 116 place count 24 transition count 93
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 6 with 58 rules applied. Total rules applied 174 place count 24 transition count 35
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 184 place count 19 transition count 30
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 186 place count 19 transition count 30
Applied a total of 186 rules in 21 ms. Remains 19 /74 variables (removed 55) and now considering 30/164 (removed 134) transitions.
[2022-06-09 10:57:02] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 19 cols
[2022-06-09 10:57:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:57:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-06-09 10:57:02] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 19 cols
[2022-06-09 10:57:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:57:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-09 10:57:02] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-06-09 10:57:02] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 10:57:02] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 19 cols
[2022-06-09 10:57:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 10:57:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/74 places, 30/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/74 places, 30/164 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Finished random walk after 20 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 105 ms.
Built C files in :
/tmp/ltsmin12582373157881796873
[2022-06-09 10:57:03] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2022-06-09 10:57:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:57:03] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2022-06-09 10:57:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:57:03] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2022-06-09 10:57:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:57:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12582373157881796873
Running compilation step : cd /tmp/ltsmin12582373157881796873;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin12582373157881796873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12582373157881796873;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2761065540410508882.hoa' '--buchi-type=spotba'
LTSmin run took 153 ms.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-13 finished in 4011 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(F(p0)))||p1))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 221/221 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 115 transition count 212
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 115 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 115 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 111 transition count 207
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 111 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 109 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 109 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 107 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 107 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 106 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 106 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 106 transition count 200
Applied a total of 35 rules in 12 ms. Remains 106 /122 variables (removed 16) and now considering 200/221 (removed 21) transitions.
[2022-06-09 10:57:03] [INFO ] Flow matrix only has 194 transitions (discarded 6 similar events)
// Phase 1: matrix 194 rows 106 cols
[2022-06-09 10:57:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:57:03] [INFO ] Implicit Places using invariants in 127 ms returned []
[2022-06-09 10:57:03] [INFO ] Flow matrix only has 194 transitions (discarded 6 similar events)
// Phase 1: matrix 194 rows 106 cols
[2022-06-09 10:57:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 10:57:04] [INFO ] State equation strengthened by 108 read => feed constraints.
[2022-06-09 10:57:04] [INFO ] Implicit Places using invariants and state equation in 285 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 415 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/122 places, 200/221 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 91 transition count 186
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 91 transition count 186
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 91 transition count 181
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 86 transition count 176
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 86 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 81 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 81 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 76 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 76 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 71 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 71 transition count 161
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 67 transition count 157
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 67 transition count 157
Applied a total of 81 rules in 5 ms. Remains 67 /105 variables (removed 38) and now considering 157/200 (removed 43) transitions.
[2022-06-09 10:57:04] [INFO ] Flow matrix only has 151 transitions (discarded 6 similar events)
// Phase 1: matrix 151 rows 67 cols
[2022-06-09 10:57:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:57:04] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-06-09 10:57:04] [INFO ] Flow matrix only has 151 transitions (discarded 6 similar events)
// Phase 1: matrix 151 rows 67 cols
[2022-06-09 10:57:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 10:57:04] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-09 10:57:04] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 67/122 places, 157/221 transitions.
Finished structural reductions, in 2 iterations. Remains : 67/122 places, 157/221 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s55 0) (EQ s63 1)), p0:(EQ s36 0)], 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]]
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 1 reset in 56 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2760 steps, including 4 resets, run visited all 1 properties in 11 ms. (steps per millisecond=250 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 67 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 : 67/67 places, 157/157 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 66 transition count 141
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 51 transition count 141
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 30 place count 51 transition count 136
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 46 transition count 136
Performed 20 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 80 place count 26 transition count 113
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 117 place count 26 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 125 place count 22 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 129 place count 22 transition count 68
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 165 place count 22 transition count 32
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 175 place count 17 transition count 27
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 17 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 16 transition count 26
Applied a total of 178 rules in 25 ms. Remains 16 /67 variables (removed 51) and now considering 26/157 (removed 131) transitions.
[2022-06-09 10:57:05] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 16 cols
[2022-06-09 10:57:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 10:57:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-06-09 10:57:05] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 16 cols
[2022-06-09 10:57:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 10:57:05] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-06-09 10:57:05] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 10:57:05] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 16 cols
[2022-06-09 10:57:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 10:57:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/67 places, 26/157 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/67 places, 26/157 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 61 ms.
Built C files in :
/tmp/ltsmin10720675358304179240
[2022-06-09 10:57:05] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2022-06-09 10:57:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:57:05] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2022-06-09 10:57:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:57:05] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2022-06-09 10:57:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 10:57:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10720675358304179240
Running compilation step : cd /tmp/ltsmin10720675358304179240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 128 ms.
Running link step : cd /tmp/ltsmin10720675358304179240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10720675358304179240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11200279730440006881.hoa' '--buchi-type=spotba'
LTSmin run took 45 ms.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-15 finished in 2349 ms.
All properties solved by simple procedures.
Total runtime 20196 ms.

BK_STOP 1654772226296

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-04a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-04a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872500123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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