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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.3K May 30 15:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 15:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 30 15:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 30 15:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 25 13:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 25 13:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 15K May 30 15:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K May 30 15:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 30 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 30 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:05 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 50M May 29 12:20 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654875982298

Running Version 202205111006
[2022-06-10 15:46:24] [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-10 15:46:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 15:46:27] [INFO ] Load time of PNML (sax parser for PT used): 3007 ms
[2022-06-10 15:46:27] [INFO ] Transformed 142 places.
[2022-06-10 15:46:27] [INFO ] Transformed 50162 transitions.
[2022-06-10 15:46:27] [INFO ] Found NUPN structural information;
[2022-06-10 15:46:27] [INFO ] Parsed PT model containing 142 places and 50162 transitions in 3574 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyElection-PT-10a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 130 transition count 2219
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 130 transition count 2219
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 124 transition count 2207
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 124 transition count 2207
Applied a total of 36 rules in 90 ms. Remains 124 /142 variables (removed 18) and now considering 2207/2238 (removed 31) transitions.
[2022-06-10 15:46:28] [INFO ] Flow matrix only has 2189 transitions (discarded 18 similar events)
// Phase 1: matrix 2189 rows 124 cols
[2022-06-10 15:46:28] [INFO ] Computed 6 place invariants in 89 ms
[2022-06-10 15:46:29] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2022-06-10 15:46:29] [INFO ] Flow matrix only has 2189 transitions (discarded 18 similar events)
// Phase 1: matrix 2189 rows 124 cols
[2022-06-10 15:46:29] [INFO ] Computed 6 place invariants in 17 ms
[2022-06-10 15:46:30] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:46:31] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
[2022-06-10 15:46:31] [INFO ] Flow matrix only has 2189 transitions (discarded 18 similar events)
// Phase 1: matrix 2189 rows 124 cols
[2022-06-10 15:46:31] [INFO ] Computed 6 place invariants in 15 ms
[2022-06-10 15:46:33] [INFO ] Dead Transitions using invariants and state equation in 2451 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/142 places, 2207/2238 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/142 places, 2207/2238 transitions.
Support contains 28 out of 124 places after structural reductions.
[2022-06-10 15:46:34] [INFO ] Flatten gal took : 495 ms
[2022-06-10 15:46:34] [INFO ] Flatten gal took : 298 ms
[2022-06-10 15:46:35] [INFO ] Input system was already deterministic with 2207 transitions.
Support contains 27 out of 124 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1716 ms. (steps per millisecond=5 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-10 15:46:37] [INFO ] Flow matrix only has 2189 transitions (discarded 18 similar events)
// Phase 1: matrix 2189 rows 124 cols
[2022-06-10 15:46:37] [INFO ] Computed 6 place invariants in 22 ms
[2022-06-10 15:46:37] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-06-10 15:46:37] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 15:46:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-10 15:46:38] [INFO ] After 929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 15:46:39] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:46:40] [INFO ] After 561ms SMT Verify possible using 2095 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 15:46:41] [INFO ] Deduced a trap composed of 11 places in 1370 ms of which 3 ms to minimize.
[2022-06-10 15:46:42] [INFO ] Deduced a trap composed of 12 places in 1082 ms of which 1 ms to minimize.
[2022-06-10 15:46:43] [INFO ] Deduced a trap composed of 13 places in 972 ms of which 2 ms to minimize.
[2022-06-10 15:46:44] [INFO ] Deduced a trap composed of 11 places in 937 ms of which 1 ms to minimize.
[2022-06-10 15:46:45] [INFO ] Deduced a trap composed of 10 places in 873 ms of which 2 ms to minimize.
[2022-06-10 15:46:46] [INFO ] Deduced a trap composed of 12 places in 494 ms of which 0 ms to minimize.
[2022-06-10 15:46:46] [INFO ] Deduced a trap composed of 12 places in 409 ms of which 2 ms to minimize.
[2022-06-10 15:46:47] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 1 ms to minimize.
[2022-06-10 15:46:47] [INFO ] Deduced a trap composed of 10 places in 495 ms of which 0 ms to minimize.
[2022-06-10 15:46:48] [INFO ] Deduced a trap composed of 12 places in 354 ms of which 1 ms to minimize.
[2022-06-10 15:46:48] [INFO ] Deduced a trap composed of 13 places in 325 ms of which 1 ms to minimize.
[2022-06-10 15:46:49] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 1 ms to minimize.
[2022-06-10 15:46:49] [INFO ] Deduced a trap composed of 10 places in 428 ms of which 1 ms to minimize.
[2022-06-10 15:46:50] [INFO ] Deduced a trap composed of 12 places in 377 ms of which 2 ms to minimize.
[2022-06-10 15:46:50] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 2 ms to minimize.
[2022-06-10 15:46:50] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2022-06-10 15:46:51] [INFO ] Deduced a trap composed of 12 places in 568 ms of which 0 ms to minimize.
[2022-06-10 15:46:51] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 1 ms to minimize.
[2022-06-10 15:46:52] [INFO ] Deduced a trap composed of 12 places in 408 ms of which 1 ms to minimize.
[2022-06-10 15:46:52] [INFO ] Deduced a trap composed of 12 places in 464 ms of which 1 ms to minimize.
[2022-06-10 15:46:53] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 1 ms to minimize.
[2022-06-10 15:46:53] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2022-06-10 15:46:53] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 13432 ms
[2022-06-10 15:46:53] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 1 ms to minimize.
[2022-06-10 15:46:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 297 ms
[2022-06-10 15:46:53] [INFO ] After 14370ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-06-10 15:46:54] [INFO ] After 16257ms 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 7 ms.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 124/124 places, 2207/2207 transitions.
Graph (complete) has 482 edges and 124 vertex of which 120 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.40 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 120 transition count 2167
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 27 rules applied. Total rules applied 64 place count 108 transition count 2152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 105 transition count 2152
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 67 place count 105 transition count 2132
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 107 place count 85 transition count 2132
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 121 place count 71 transition count 2117
Iterating global reduction 3 with 14 rules applied. Total rules applied 135 place count 71 transition count 2117
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 148 place count 58 transition count 2104
Iterating global reduction 3 with 13 rules applied. Total rules applied 161 place count 58 transition count 2104
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 184 place count 58 transition count 2081
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 218 place count 41 transition count 2063
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 235 place count 24 transition count 2046
Iterating global reduction 4 with 17 rules applied. Total rules applied 252 place count 24 transition count 2046
Ensure Unique test removed 1009 transitions
Reduce isomorphic transitions removed 1009 transitions.
Iterating post reduction 4 with 1009 rules applied. Total rules applied 1261 place count 24 transition count 1037
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1262 place count 24 transition count 1036
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1263 place count 24 transition count 1036
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1264 place count 23 transition count 1035
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1265 place count 22 transition count 1035
Performed 10 Post agglomeration using F-continuation condition with reduction of 1012 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 29 rules applied. Total rules applied 1294 place count 3 transition count 13
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 2 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 11 rules applied. Total rules applied 1305 place count 2 transition count 3
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1307 place count 2 transition count 1
Applied a total of 1307 rules in 1475 ms. Remains 2 /124 variables (removed 122) and now considering 1/2207 (removed 2206) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/124 places, 1/2207 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA StigmergyElection-PT-10a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 21 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(p1 U p2)||p0))&&(p2 U p3)))'
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2207/2207 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 117 transition count 2197
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 117 transition count 2197
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 115 transition count 2193
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 115 transition count 2193
Applied a total of 18 rules in 40 ms. Remains 115 /124 variables (removed 9) and now considering 2193/2207 (removed 14) transitions.
[2022-06-10 15:46:55] [INFO ] Flow matrix only has 2181 transitions (discarded 12 similar events)
// Phase 1: matrix 2181 rows 115 cols
[2022-06-10 15:46:55] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-10 15:46:56] [INFO ] Implicit Places using invariants in 896 ms returned []
[2022-06-10 15:46:56] [INFO ] Flow matrix only has 2181 transitions (discarded 12 similar events)
// Phase 1: matrix 2181 rows 115 cols
[2022-06-10 15:46:56] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 15:46:57] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:46:58] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 2171 ms to find 0 implicit places.
[2022-06-10 15:46:58] [INFO ] Flow matrix only has 2181 transitions (discarded 12 similar events)
// Phase 1: matrix 2181 rows 115 cols
[2022-06-10 15:46:58] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 15:46:59] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/124 places, 2193/2207 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/124 places, 2193/2207 transitions.
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p3) (AND (NOT p0) p2)), true, (AND (NOT p0) p2), (NOT p3), p2]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(OR (EQ s79 0) (EQ s87 1)), p2:(EQ s72 1), p0:(OR (EQ s72 1) (EQ s79 0) (EQ s87 1)), p1:(OR (EQ s91 0) (EQ s101 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 50000 reset in 993 ms.
Product exploration explored 100000 steps with 50000 reset in 511 ms.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Detected a total of 22/115 stabilizing places and 21/2193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0) p1)))
Knowledge based reduction with 9 factoid took 290 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-10a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLCardinality-02 finished in 5923 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(X(X(G(X(p0)))))))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2207/2207 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 122 transition count 2172
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 88 transition count 2170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 86 transition count 2170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 73 place count 86 transition count 2160
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 93 place count 76 transition count 2160
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 108 place count 61 transition count 2141
Iterating global reduction 3 with 15 rules applied. Total rules applied 123 place count 61 transition count 2141
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 186 place count 61 transition count 2078
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 186 place count 61 transition count 2073
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 196 place count 56 transition count 2073
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 199 place count 53 transition count 2067
Iterating global reduction 4 with 3 rules applied. Total rules applied 202 place count 53 transition count 2067
Ensure Unique test removed 448 transitions
Reduce isomorphic transitions removed 448 transitions.
Iterating post reduction 4 with 448 rules applied. Total rules applied 650 place count 53 transition count 1619
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 670 place count 43 transition count 1609
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 677 place count 43 transition count 1602
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 6 with 1482 rules applied. Total rules applied 2159 place count 43 transition count 120
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2179 place count 33 transition count 110
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 2187 place count 25 transition count 102
Applied a total of 2187 rules in 1428 ms. Remains 25 /124 variables (removed 99) and now considering 102/2207 (removed 2105) transitions.
[2022-06-10 15:47:03] [INFO ] Flow matrix only has 92 transitions (discarded 10 similar events)
// Phase 1: matrix 92 rows 25 cols
[2022-06-10 15:47:03] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-10 15:47:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2022-06-10 15:47:03] [INFO ] Flow matrix only has 92 transitions (discarded 10 similar events)
// Phase 1: matrix 92 rows 25 cols
[2022-06-10 15:47:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-10 15:47:03] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-10 15:47:03] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-06-10 15:47:03] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 15:47:03] [INFO ] Flow matrix only has 92 transitions (discarded 10 similar events)
// Phase 1: matrix 92 rows 25 cols
[2022-06-10 15:47:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-10 15:47:03] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/124 places, 102/2207 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/124 places, 102/2207 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s18 0) (EQ s12 1)) (AND (EQ s5 0) (EQ s19 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-03 finished in 1721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F(p1)))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2207/2207 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 118 transition count 2198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 118 transition count 2198
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 115 transition count 2192
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 115 transition count 2192
Applied a total of 18 rules in 27 ms. Remains 115 /124 variables (removed 9) and now considering 2192/2207 (removed 15) transitions.
[2022-06-10 15:47:03] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
// Phase 1: matrix 2180 rows 115 cols
[2022-06-10 15:47:03] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-10 15:47:04] [INFO ] Implicit Places using invariants in 783 ms returned []
[2022-06-10 15:47:04] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
// Phase 1: matrix 2180 rows 115 cols
[2022-06-10 15:47:04] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-10 15:47:04] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:47:06] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
[2022-06-10 15:47:06] [INFO ] Flow matrix only has 2180 transitions (discarded 12 similar events)
// Phase 1: matrix 2180 rows 115 cols
[2022-06-10 15:47:06] [INFO ] Computed 3 place invariants in 15 ms
[2022-06-10 15:47:07] [INFO ] Dead Transitions using invariants and state equation in 1558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/124 places, 2192/2207 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/124 places, 2192/2207 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s63 0) (EQ s65 1)), p1:(OR (EQ s58 0) (EQ s3 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 419 ms.
Product exploration explored 100000 steps with 33333 reset in 452 ms.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-10a-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLCardinality-04 finished in 5562 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2207/2207 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 122 transition count 2166
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 82 transition count 2166
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 81 place count 82 transition count 2158
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 97 place count 74 transition count 2158
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 110 place count 61 transition count 2141
Iterating global reduction 2 with 13 rules applied. Total rules applied 123 place count 61 transition count 2141
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 250 place count 61 transition count 2014
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 250 place count 61 transition count 2008
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 262 place count 55 transition count 2008
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 265 place count 52 transition count 2002
Iterating global reduction 3 with 3 rules applied. Total rules applied 268 place count 52 transition count 2002
Ensure Unique test removed 896 transitions
Reduce isomorphic transitions removed 896 transitions.
Iterating post reduction 3 with 896 rules applied. Total rules applied 1164 place count 52 transition count 1106
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1182 place count 43 transition count 1097
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1191 place count 43 transition count 1088
Drop transitions removed 1002 transitions
Redundant transition composition rules discarded 1002 transitions
Iterating global reduction 5 with 1002 rules applied. Total rules applied 2193 place count 43 transition count 86
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2213 place count 33 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2214 place count 33 transition count 76
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 2224 place count 23 transition count 66
Applied a total of 2224 rules in 306 ms. Remains 23 /124 variables (removed 101) and now considering 66/2207 (removed 2141) transitions.
[2022-06-10 15:47:09] [INFO ] Flow matrix only has 54 transitions (discarded 12 similar events)
// Phase 1: matrix 54 rows 23 cols
[2022-06-10 15:47:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 15:47:09] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-06-10 15:47:09] [INFO ] Flow matrix only has 54 transitions (discarded 12 similar events)
// Phase 1: matrix 54 rows 23 cols
[2022-06-10 15:47:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 15:47:09] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2022-06-10 15:47:09] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 15:47:09] [INFO ] Flow matrix only has 54 transitions (discarded 12 similar events)
// Phase 1: matrix 54 rows 23 cols
[2022-06-10 15:47:09] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 15:47:09] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/124 places, 66/2207 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/124 places, 66/2207 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-05 finished in 605 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2207/2207 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 117 transition count 2196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 117 transition count 2196
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 114 transition count 2190
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 114 transition count 2190
Applied a total of 20 rules in 29 ms. Remains 114 /124 variables (removed 10) and now considering 2190/2207 (removed 17) transitions.
[2022-06-10 15:47:09] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2022-06-10 15:47:09] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-10 15:47:10] [INFO ] Implicit Places using invariants in 625 ms returned []
[2022-06-10 15:47:10] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2022-06-10 15:47:10] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-10 15:47:10] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:47:11] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
[2022-06-10 15:47:11] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2022-06-10 15:47:11] [INFO ] Computed 3 place invariants in 13 ms
[2022-06-10 15:47:12] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/124 places, 2190/2207 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/124 places, 2190/2207 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s11 0) (NEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10261 reset in 1546 ms.
Product exploration explored 100000 steps with 10222 reset in 1370 ms.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2022-06-10 15:47:16] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2022-06-10 15:47:16] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-10 15:47:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 15:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 15:47:17] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2022-06-10 15:47:18] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:47:18] [INFO ] [Real]Added 2095 Read/Feed constraints in 344 ms returned sat
[2022-06-10 15:47:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 15:47:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-10 15:47:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 15:47:20] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2022-06-10 15:47:20] [INFO ] [Nat]Added 2095 Read/Feed constraints in 509 ms returned sat
[2022-06-10 15:47:21] [INFO ] Computed and/alt/rep : 100/140/100 causal constraints (skipped 2077 transitions) in 1062 ms.
[2022-06-10 15:47:22] [INFO ] Added : 20 causal constraints over 4 iterations in 1828 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 2190/2190 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 112 transition count 2150
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 73 transition count 2150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 63 transition count 2140
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 63 transition count 2140
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1122 place count 63 transition count 1117
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1122 place count 63 transition count 1107
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1142 place count 53 transition count 1107
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1160 place count 44 transition count 1098
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1169 place count 44 transition count 1089
Drop transitions removed 1002 transitions
Redundant transition composition rules discarded 1002 transitions
Iterating global reduction 4 with 1002 rules applied. Total rules applied 2171 place count 44 transition count 87
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 2191 place count 34 transition count 77
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2192 place count 34 transition count 77
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 2201 place count 25 transition count 68
Applied a total of 2201 rules in 396 ms. Remains 25 /114 variables (removed 89) and now considering 68/2190 (removed 2122) transitions.
[2022-06-10 15:47:23] [INFO ] Flow matrix only has 56 transitions (discarded 12 similar events)
// Phase 1: matrix 56 rows 25 cols
[2022-06-10 15:47:23] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 15:47:23] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-06-10 15:47:23] [INFO ] Flow matrix only has 56 transitions (discarded 12 similar events)
// Phase 1: matrix 56 rows 25 cols
[2022-06-10 15:47:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 15:47:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-10 15:47:23] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-06-10 15:47:23] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 15:47:23] [INFO ] Flow matrix only has 56 transitions (discarded 12 similar events)
// Phase 1: matrix 56 rows 25 cols
[2022-06-10 15:47:23] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 15:47:23] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/114 places, 68/2190 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/114 places, 68/2190 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 : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-10a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLCardinality-07 finished in 13781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 2207/2207 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 122 transition count 2168
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 84 transition count 2168
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 77 place count 84 transition count 2159
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 95 place count 75 transition count 2159
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 110 place count 60 transition count 2140
Iterating global reduction 2 with 15 rules applied. Total rules applied 125 place count 60 transition count 2140
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 252 place count 60 transition count 2013
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 252 place count 60 transition count 2007
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 264 place count 54 transition count 2007
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 267 place count 51 transition count 2001
Iterating global reduction 3 with 3 rules applied. Total rules applied 270 place count 51 transition count 2001
Ensure Unique test removed 896 transitions
Reduce isomorphic transitions removed 896 transitions.
Iterating post reduction 3 with 896 rules applied. Total rules applied 1166 place count 51 transition count 1105
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1186 place count 41 transition count 1095
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1195 place count 41 transition count 1086
Drop transitions removed 970 transitions
Redundant transition composition rules discarded 970 transitions
Iterating global reduction 5 with 970 rules applied. Total rules applied 2165 place count 41 transition count 116
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2185 place count 31 transition count 106
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 5 with 9 rules applied. Total rules applied 2194 place count 22 transition count 97
Applied a total of 2194 rules in 300 ms. Remains 22 /124 variables (removed 102) and now considering 97/2207 (removed 2110) transitions.
[2022-06-10 15:47:23] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
// Phase 1: matrix 87 rows 22 cols
[2022-06-10 15:47:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-10 15:47:23] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-06-10 15:47:23] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
// Phase 1: matrix 87 rows 22 cols
[2022-06-10 15:47:23] [INFO ] Computed 1 place invariants in 10 ms
[2022-06-10 15:47:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-10 15:47:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-06-10 15:47:23] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 15:47:23] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
// Phase 1: matrix 87 rows 22 cols
[2022-06-10 15:47:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-10 15:47:23] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/124 places, 97/2207 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/124 places, 97/2207 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-08 finished in 656 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((X(p1)||p0)&&p2))&&p3)))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2207/2207 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 117 transition count 2196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 117 transition count 2196
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 114 transition count 2190
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 114 transition count 2190
Applied a total of 20 rules in 27 ms. Remains 114 /124 variables (removed 10) and now considering 2190/2207 (removed 17) transitions.
[2022-06-10 15:47:24] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2022-06-10 15:47:24] [INFO ] Computed 3 place invariants in 20 ms
[2022-06-10 15:47:24] [INFO ] Implicit Places using invariants in 893 ms returned []
[2022-06-10 15:47:24] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2022-06-10 15:47:24] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-10 15:47:25] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:47:26] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 2018 ms to find 0 implicit places.
[2022-06-10 15:47:26] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2022-06-10 15:47:26] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-10 15:47:27] [INFO ] Dead Transitions using invariants and state equation in 1464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/124 places, 2190/2207 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/124 places, 2190/2207 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(EQ s23 0), p0:(OR (EQ s101 0) (EQ s51 1) (EQ s23 1)), p3:(OR (EQ s101 0) (EQ s51 1)), p1:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-09 finished in 3747 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(G(X(G((p0 U X(p1)))))))))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2207/2207 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 117 transition count 2196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 117 transition count 2196
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 114 transition count 2190
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 114 transition count 2190
Applied a total of 20 rules in 31 ms. Remains 114 /124 variables (removed 10) and now considering 2190/2207 (removed 17) transitions.
[2022-06-10 15:47:27] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2022-06-10 15:47:27] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-10 15:47:28] [INFO ] Implicit Places using invariants in 968 ms returned []
[2022-06-10 15:47:28] [INFO ] Flow matrix only has 2178 transitions (discarded 12 similar events)
// Phase 1: matrix 2178 rows 114 cols
[2022-06-10 15:47:28] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-10 15:47:29] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:47:31] [INFO ] Implicit Places using invariants and state equation in 2588 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3563 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/124 places, 2190/2207 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 95 transition count 2172
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 95 transition count 2172
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 85 transition count 2162
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 85 transition count 2162
Applied a total of 56 rules in 40 ms. Remains 85 /113 variables (removed 28) and now considering 2162/2190 (removed 28) transitions.
[2022-06-10 15:47:31] [INFO ] Flow matrix only has 2150 transitions (discarded 12 similar events)
// Phase 1: matrix 2150 rows 85 cols
[2022-06-10 15:47:31] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 15:47:32] [INFO ] Implicit Places using invariants in 951 ms returned []
[2022-06-10 15:47:32] [INFO ] Flow matrix only has 2150 transitions (discarded 12 similar events)
// Phase 1: matrix 2150 rows 85 cols
[2022-06-10 15:47:32] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 15:47:33] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2022-06-10 15:47:33] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 85/124 places, 2162/2207 transitions.
Finished structural reductions, in 2 iterations. Remains : 85/124 places, 2162/2207 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NOT (OR (EQ s78 0) (EQ s12 1))) (EQ s47 1)), p1:(EQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-10a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLCardinality-10 finished in 5903 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(p0)))||F(X(F(p1)))))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 2207/2207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 2200
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 118 transition count 2198
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 118 transition count 2198
Applied a total of 12 rules in 30 ms. Remains 118 /124 variables (removed 6) and now considering 2198/2207 (removed 9) transitions.
[2022-06-10 15:47:33] [INFO ] Flow matrix only has 2184 transitions (discarded 14 similar events)
// Phase 1: matrix 2184 rows 118 cols
[2022-06-10 15:47:33] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-10 15:47:34] [INFO ] Implicit Places using invariants in 987 ms returned []
[2022-06-10 15:47:34] [INFO ] Flow matrix only has 2184 transitions (discarded 14 similar events)
// Phase 1: matrix 2184 rows 118 cols
[2022-06-10 15:47:34] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-10 15:47:35] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:47:36] [INFO ] Implicit Places using invariants and state equation in 2084 ms returned []
Implicit Place search using SMT with State Equation took 3079 ms to find 0 implicit places.
[2022-06-10 15:47:36] [INFO ] Flow matrix only has 2184 transitions (discarded 14 similar events)
// Phase 1: matrix 2184 rows 118 cols
[2022-06-10 15:47:36] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-10 15:47:38] [INFO ] Dead Transitions using invariants and state equation in 1618 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 2198/2207 transitions.
Finished structural reductions, in 1 iterations. Remains : 118/124 places, 2198/2207 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-10a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(OR (EQ s53 0) (EQ s18 1)), p0:(OR (EQ s36 0) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 522 ms.
Product exploration explored 100000 steps with 25000 reset in 634 ms.
Computed a total of 22 stabilizing places and 21 stable transitions
Computed a total of 22 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1381 ms. (steps per millisecond=7 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 15:47:41] [INFO ] Flow matrix only has 2184 transitions (discarded 14 similar events)
// Phase 1: matrix 2184 rows 118 cols
[2022-06-10 15:47:41] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-10 15:47:41] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 15:47:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 15:47:42] [INFO ] After 813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 15:47:42] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2022-06-10 15:47:43] [INFO ] After 748ms SMT Verify possible using 2095 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 15:47:44] [INFO ] Deduced a trap composed of 12 places in 1020 ms of which 1 ms to minimize.
[2022-06-10 15:47:45] [INFO ] Deduced a trap composed of 10 places in 748 ms of which 1 ms to minimize.
[2022-06-10 15:47:46] [INFO ] Deduced a trap composed of 10 places in 630 ms of which 0 ms to minimize.
[2022-06-10 15:47:46] [INFO ] Deduced a trap composed of 10 places in 667 ms of which 1 ms to minimize.
[2022-06-10 15:47:47] [INFO ] Deduced a trap composed of 12 places in 546 ms of which 2 ms to minimize.
[2022-06-10 15:47:48] [INFO ] Deduced a trap composed of 10 places in 620 ms of which 1 ms to minimize.
[2022-06-10 15:47:48] [INFO ] Deduced a trap composed of 10 places in 548 ms of which 1 ms to minimize.
[2022-06-10 15:47:49] [INFO ] Deduced a trap composed of 13 places in 529 ms of which 0 ms to minimize.
[2022-06-10 15:47:50] [INFO ] Deduced a trap composed of 13 places in 867 ms of which 1 ms to minimize.
[2022-06-10 15:47:51] [INFO ] Deduced a trap composed of 12 places in 752 ms of which 2 ms to minimize.
[2022-06-10 15:47:52] [INFO ] Deduced a trap composed of 12 places in 606 ms of which 1 ms to minimize.
[2022-06-10 15:47:52] [INFO ] Deduced a trap composed of 12 places in 621 ms of which 1 ms to minimize.
[2022-06-10 15:47:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 9219 ms
[2022-06-10 15:47:52] [INFO ] After 10161ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-10 15:47:52] [INFO ] After 11174ms 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), true, (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyElection-PT-10a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLCardinality-15 finished in 19242 ms.
All properties solved by simple procedures.
Total runtime 88886 ms.

BK_STOP 1654876073095

--------------------
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="StigmergyElection-PT-10a"
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 StigmergyElection-PT-10a, 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-165463872800379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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