Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 9.5K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679349357256

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 21:56:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 21:56:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:56:01] [INFO ] Load time of PNML (sax parser for PT used): 536 ms
[2023-03-20 21:56:01] [INFO ] Transformed 256 places.
[2023-03-20 21:56:01] [INFO ] Transformed 2816 transitions.
[2023-03-20 21:56:01] [INFO ] Found NUPN structural information;
[2023-03-20 21:56:01] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 728 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 587/587 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 210 transition count 536
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 210 transition count 536
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 210 transition count 532
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 118 place count 188 transition count 507
Iterating global reduction 1 with 22 rules applied. Total rules applied 140 place count 188 transition count 507
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 145 place count 188 transition count 502
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 150 place count 183 transition count 497
Iterating global reduction 2 with 5 rules applied. Total rules applied 155 place count 183 transition count 497
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 178 transition count 492
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 178 transition count 492
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 169 place count 174 transition count 488
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 174 transition count 488
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 175 place count 172 transition count 486
Iterating global reduction 2 with 2 rules applied. Total rules applied 177 place count 172 transition count 486
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 179 place count 172 transition count 484
Applied a total of 179 rules in 103 ms. Remains 172 /256 variables (removed 84) and now considering 484/587 (removed 103) transitions.
[2023-03-20 21:56:01] [INFO ] Flow matrix only has 472 transitions (discarded 12 similar events)
// Phase 1: matrix 472 rows 172 cols
[2023-03-20 21:56:01] [INFO ] Computed 4 place invariants in 30 ms
[2023-03-20 21:56:02] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-20 21:56:02] [INFO ] Flow matrix only has 472 transitions (discarded 12 similar events)
[2023-03-20 21:56:02] [INFO ] Invariant cache hit.
[2023-03-20 21:56:02] [INFO ] State equation strengthened by 326 read => feed constraints.
[2023-03-20 21:56:03] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1665 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/256 places, 484/587 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 161 transition count 474
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 161 transition count 474
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 161 transition count 469
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 157 transition count 465
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 157 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 155 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 155 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 153 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 153 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 151 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 151 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 149 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 149 transition count 457
Applied a total of 49 rules in 31 ms. Remains 149 /171 variables (removed 22) and now considering 457/484 (removed 27) transitions.
[2023-03-20 21:56:03] [INFO ] Flow matrix only has 445 transitions (discarded 12 similar events)
// Phase 1: matrix 445 rows 149 cols
[2023-03-20 21:56:03] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-20 21:56:03] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-20 21:56:03] [INFO ] Flow matrix only has 445 transitions (discarded 12 similar events)
[2023-03-20 21:56:03] [INFO ] Invariant cache hit.
[2023-03-20 21:56:03] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:04] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/256 places, 457/587 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2431 ms. Remains : 149/256 places, 457/587 transitions.
Support contains 32 out of 149 places after structural reductions.
[2023-03-20 21:56:04] [INFO ] Flatten gal took : 141 ms
[2023-03-20 21:56:04] [INFO ] Flatten gal took : 83 ms
[2023-03-20 21:56:04] [INFO ] Input system was already deterministic with 457 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 781 ms. (steps per millisecond=12 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 21:56:05] [INFO ] Flow matrix only has 445 transitions (discarded 12 similar events)
[2023-03-20 21:56:05] [INFO ] Invariant cache hit.
[2023-03-20 21:56:05] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-20 21:56:05] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 21:56:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 21:56:06] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 21:56:06] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:06] [INFO ] After 92ms SMT Verify possible using 260 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 21:56:06] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 7 ms to minimize.
[2023-03-20 21:56:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-20 21:56:06] [INFO ] After 350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-20 21:56:06] [INFO ] After 734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 457/457 transitions.
Graph (complete) has 336 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 147 transition count 363
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 98 rules applied. Total rules applied 191 place count 72 transition count 340
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 14 rules applied. Total rules applied 205 place count 64 transition count 334
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 212 place count 61 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 213 place count 60 transition count 330
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 213 place count 60 transition count 323
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 227 place count 53 transition count 323
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 241 place count 39 transition count 307
Iterating global reduction 5 with 14 rules applied. Total rules applied 255 place count 39 transition count 307
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 319 place count 39 transition count 243
Performed 19 Post agglomeration using F-continuation condition with reduction of 167 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 39 rules applied. Total rules applied 358 place count 19 transition count 57
Drop transitions removed 8 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 6 with 33 rules applied. Total rules applied 391 place count 19 transition count 24
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 395 place count 17 transition count 21
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 397 place count 17 transition count 19
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 400 place count 17 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 401 place count 17 transition count 16
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 402 place count 17 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 403 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 404 place count 15 transition count 14
Applied a total of 404 rules in 102 ms. Remains 15 /149 variables (removed 134) and now considering 14/457 (removed 443) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 15/149 places, 14/457 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=11 )
Computed a total of 27 stabilizing places and 27 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U (X(X(p1)) U X(p0))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 457/457 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 126 transition count 431
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 126 transition count 431
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 126 transition count 423
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 116 transition count 411
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 116 transition count 411
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 116 transition count 409
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 83 place count 109 transition count 402
Iterating global reduction 2 with 7 rules applied. Total rules applied 90 place count 109 transition count 402
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 105 transition count 398
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 105 transition count 398
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 102 transition count 395
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 102 transition count 395
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 100 transition count 393
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 100 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 100 transition count 392
Applied a total of 109 rules in 30 ms. Remains 100 /149 variables (removed 49) and now considering 392/457 (removed 65) transitions.
[2023-03-20 21:56:07] [INFO ] Flow matrix only has 384 transitions (discarded 8 similar events)
// Phase 1: matrix 384 rows 100 cols
[2023-03-20 21:56:07] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-20 21:56:07] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-20 21:56:07] [INFO ] Flow matrix only has 384 transitions (discarded 8 similar events)
[2023-03-20 21:56:07] [INFO ] Invariant cache hit.
[2023-03-20 21:56:07] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:07] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2023-03-20 21:56:07] [INFO ] Flow matrix only has 384 transitions (discarded 8 similar events)
[2023-03-20 21:56:07] [INFO ] Invariant cache hit.
[2023-03-20 21:56:08] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/149 places, 392/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 976 ms. Remains : 100/149 places, 392/457 transitions.
Stuttering acceptance computed with spot in 413 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (EQ s29 0) (EQ s49 1)), p1:(OR (EQ s85 0) (EQ s21 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 623 ms.
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-05 finished in 2563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 457/457 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 148 transition count 386
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 82 rules applied. Total rules applied 152 place count 78 transition count 374
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 161 place count 75 transition count 368
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 168 place count 72 transition count 364
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 170 place count 71 transition count 363
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 170 place count 71 transition count 354
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 188 place count 62 transition count 354
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 195 place count 55 transition count 343
Iterating global reduction 5 with 7 rules applied. Total rules applied 202 place count 55 transition count 343
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 217 place count 55 transition count 328
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 217 place count 55 transition count 326
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 221 place count 53 transition count 326
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 223 place count 51 transition count 322
Iterating global reduction 6 with 2 rules applied. Total rules applied 225 place count 51 transition count 322
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 273 place count 51 transition count 274
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 305 place count 35 transition count 254
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 7 with 71 rules applied. Total rules applied 376 place count 35 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 380 place count 33 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 382 place count 33 transition count 179
Drop transitions removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 9 with 131 rules applied. Total rules applied 513 place count 33 transition count 48
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 527 place count 26 transition count 41
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 530 place count 26 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 531 place count 26 transition count 40
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 536 place count 21 transition count 35
Applied a total of 536 rules in 98 ms. Remains 21 /149 variables (removed 128) and now considering 35/457 (removed 422) transitions.
[2023-03-20 21:56:09] [INFO ] Flow matrix only has 26 transitions (discarded 9 similar events)
// Phase 1: matrix 26 rows 21 cols
[2023-03-20 21:56:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-20 21:56:09] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 21:56:09] [INFO ] Flow matrix only has 26 transitions (discarded 9 similar events)
[2023-03-20 21:56:09] [INFO ] Invariant cache hit.
[2023-03-20 21:56:09] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-20 21:56:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 21:56:09] [INFO ] Flow matrix only has 26 transitions (discarded 9 similar events)
[2023-03-20 21:56:09] [INFO ] Invariant cache hit.
[2023-03-20 21:56:09] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/149 places, 35/457 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 21/149 places, 35/457 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s2 1)), p1:(AND (EQ s18 1) (OR (EQ s6 0) (EQ s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-06 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 457/457 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 148 transition count 385
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 84 rules applied. Total rules applied 155 place count 77 transition count 372
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 164 place count 74 transition count 366
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 171 place count 71 transition count 362
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 173 place count 70 transition count 361
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 173 place count 70 transition count 352
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 191 place count 61 transition count 352
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 200 place count 52 transition count 339
Iterating global reduction 5 with 9 rules applied. Total rules applied 209 place count 52 transition count 339
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 225 place count 52 transition count 323
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 225 place count 52 transition count 321
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 229 place count 50 transition count 321
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 231 place count 48 transition count 317
Iterating global reduction 6 with 2 rules applied. Total rules applied 233 place count 48 transition count 317
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 281 place count 48 transition count 269
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 313 place count 32 transition count 249
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 7 with 70 rules applied. Total rules applied 383 place count 32 transition count 179
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 387 place count 30 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 389 place count 30 transition count 175
Drop transitions removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 9 with 131 rules applied. Total rules applied 520 place count 30 transition count 44
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 534 place count 23 transition count 37
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 536 place count 23 transition count 37
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 541 place count 18 transition count 32
Applied a total of 541 rules in 82 ms. Remains 18 /149 variables (removed 131) and now considering 32/457 (removed 425) transitions.
[2023-03-20 21:56:10] [INFO ] Flow matrix only has 24 transitions (discarded 8 similar events)
// Phase 1: matrix 24 rows 18 cols
[2023-03-20 21:56:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 21:56:10] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 21:56:10] [INFO ] Flow matrix only has 24 transitions (discarded 8 similar events)
[2023-03-20 21:56:10] [INFO ] Invariant cache hit.
[2023-03-20 21:56:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 21:56:10] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-20 21:56:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 21:56:10] [INFO ] Flow matrix only has 24 transitions (discarded 8 similar events)
[2023-03-20 21:56:10] [INFO ] Invariant cache hit.
[2023-03-20 21:56:10] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/149 places, 32/457 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 18/149 places, 32/457 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-08 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 (EQ s17 0) (EQ s2 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 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-08 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(p1)))||G(p0)))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 457/457 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 126 transition count 431
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 126 transition count 431
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 53 place count 126 transition count 424
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 115 transition count 412
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 115 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 77 place count 115 transition count 410
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 83 place count 109 transition count 404
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 109 transition count 404
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 94 place count 104 transition count 399
Iterating global reduction 2 with 5 rules applied. Total rules applied 99 place count 104 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 104 transition count 398
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 100 transition count 394
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 100 transition count 394
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 97 transition count 391
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 97 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 97 transition count 390
Applied a total of 115 rules in 25 ms. Remains 97 /149 variables (removed 52) and now considering 390/457 (removed 67) transitions.
[2023-03-20 21:56:10] [INFO ] Flow matrix only has 381 transitions (discarded 9 similar events)
// Phase 1: matrix 381 rows 97 cols
[2023-03-20 21:56:10] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-20 21:56:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-20 21:56:10] [INFO ] Flow matrix only has 381 transitions (discarded 9 similar events)
[2023-03-20 21:56:10] [INFO ] Invariant cache hit.
[2023-03-20 21:56:10] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:10] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-20 21:56:10] [INFO ] Flow matrix only has 381 transitions (discarded 9 similar events)
[2023-03-20 21:56:10] [INFO ] Invariant cache hit.
[2023-03-20 21:56:11] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/149 places, 390/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 835 ms. Remains : 97/149 places, 390/457 transitions.
Stuttering acceptance computed with spot in 380 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(AND (EQ s78 0) (OR (EQ s26 0) (EQ s43 1))), p0:(OR (EQ s86 0) (EQ s94 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 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 191 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06a-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-10 finished in 1825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 457/457 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 125 transition count 430
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 125 transition count 430
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 125 transition count 423
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 67 place count 113 transition count 410
Iterating global reduction 1 with 12 rules applied. Total rules applied 79 place count 113 transition count 410
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 113 transition count 408
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 89 place count 105 transition count 400
Iterating global reduction 2 with 8 rules applied. Total rules applied 97 place count 105 transition count 400
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 99 transition count 394
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 99 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 99 transition count 393
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 95 transition count 389
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 95 transition count 389
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 121 place count 92 transition count 386
Iterating global reduction 3 with 3 rules applied. Total rules applied 124 place count 92 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 92 transition count 385
Applied a total of 125 rules in 18 ms. Remains 92 /149 variables (removed 57) and now considering 385/457 (removed 72) transitions.
[2023-03-20 21:56:12] [INFO ] Flow matrix only has 376 transitions (discarded 9 similar events)
// Phase 1: matrix 376 rows 92 cols
[2023-03-20 21:56:12] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-20 21:56:12] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-20 21:56:12] [INFO ] Flow matrix only has 376 transitions (discarded 9 similar events)
[2023-03-20 21:56:12] [INFO ] Invariant cache hit.
[2023-03-20 21:56:12] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:12] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-20 21:56:12] [INFO ] Flow matrix only has 376 transitions (discarded 9 similar events)
[2023-03-20 21:56:12] [INFO ] Invariant cache hit.
[2023-03-20 21:56:12] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/149 places, 385/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 92/149 places, 385/457 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s5 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 53 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-11 finished in 753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G((p1 U X(p1)))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 457/457 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 126 transition count 431
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 126 transition count 431
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 53 place count 126 transition count 424
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 115 transition count 411
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 115 transition count 411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 115 transition count 410
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 106 transition count 401
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 106 transition count 401
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 100 transition count 395
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 100 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 100 transition count 394
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 96 transition count 390
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 96 transition count 390
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 93 transition count 387
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 93 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 93 transition count 386
Applied a total of 122 rules in 22 ms. Remains 93 /149 variables (removed 56) and now considering 386/457 (removed 71) transitions.
[2023-03-20 21:56:12] [INFO ] Flow matrix only has 378 transitions (discarded 8 similar events)
// Phase 1: matrix 378 rows 93 cols
[2023-03-20 21:56:12] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-20 21:56:13] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-20 21:56:13] [INFO ] Flow matrix only has 378 transitions (discarded 8 similar events)
[2023-03-20 21:56:13] [INFO ] Invariant cache hit.
[2023-03-20 21:56:13] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:13] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-20 21:56:13] [INFO ] Flow matrix only has 378 transitions (discarded 8 similar events)
[2023-03-20 21:56:13] [INFO ] Invariant cache hit.
[2023-03-20 21:56:13] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/149 places, 386/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 970 ms. Remains : 93/149 places, 386/457 transitions.
Stuttering acceptance computed with spot in 412 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 3}, { cond=(NOT p1), acceptance={} source=7 dest: 4}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=6, aps=[p0:(OR (EQ s54 0) (EQ s71 1)), p1:(OR (EQ s58 0) (EQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Product exploration explored 100000 steps with 33333 reset in 263 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 (NOT p0)))))
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-12 finished in 1999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 457/457 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 124 transition count 428
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 124 transition count 428
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 58 place count 124 transition count 420
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 113 transition count 407
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 113 transition count 407
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 113 transition count 405
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 105 transition count 397
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 105 transition count 397
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 100 transition count 392
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 100 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 100 transition count 391
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 97 transition count 388
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 97 transition count 388
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 94 transition count 385
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 94 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 94 transition count 384
Applied a total of 122 rules in 18 ms. Remains 94 /149 variables (removed 55) and now considering 384/457 (removed 73) transitions.
[2023-03-20 21:56:14] [INFO ] Flow matrix only has 376 transitions (discarded 8 similar events)
// Phase 1: matrix 376 rows 94 cols
[2023-03-20 21:56:14] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-20 21:56:14] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-20 21:56:14] [INFO ] Flow matrix only has 376 transitions (discarded 8 similar events)
[2023-03-20 21:56:14] [INFO ] Invariant cache hit.
[2023-03-20 21:56:15] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:15] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-20 21:56:15] [INFO ] Flow matrix only has 376 transitions (discarded 8 similar events)
[2023-03-20 21:56:15] [INFO ] Invariant cache hit.
[2023-03-20 21:56:15] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/149 places, 384/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 828 ms. Remains : 94/149 places, 384/457 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s38 0) (NEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-13 finished in 949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (G(!p0)||(!p0&&G(p1))))))'
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 457/457 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 148 transition count 387
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 79 rules applied. Total rules applied 148 place count 79 transition count 377
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 154 place count 77 transition count 373
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 159 place count 75 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 74 transition count 370
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 160 place count 74 transition count 361
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 178 place count 65 transition count 361
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 186 place count 57 transition count 349
Iterating global reduction 5 with 8 rules applied. Total rules applied 194 place count 57 transition count 349
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 209 place count 57 transition count 334
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 209 place count 57 transition count 332
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 213 place count 55 transition count 332
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 215 place count 53 transition count 328
Iterating global reduction 6 with 2 rules applied. Total rules applied 217 place count 53 transition count 328
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 265 place count 53 transition count 280
Performed 17 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 299 place count 36 transition count 256
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 7 with 70 rules applied. Total rules applied 369 place count 36 transition count 186
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 375 place count 33 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 378 place count 33 transition count 180
Drop transitions removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 9 with 131 rules applied. Total rules applied 509 place count 33 transition count 49
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 523 place count 26 transition count 42
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 526 place count 26 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 527 place count 26 transition count 41
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 531 place count 22 transition count 37
Applied a total of 531 rules in 79 ms. Remains 22 /149 variables (removed 127) and now considering 37/457 (removed 420) transitions.
[2023-03-20 21:56:15] [INFO ] Flow matrix only has 28 transitions (discarded 9 similar events)
// Phase 1: matrix 28 rows 22 cols
[2023-03-20 21:56:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-20 21:56:15] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-20 21:56:15] [INFO ] Flow matrix only has 28 transitions (discarded 9 similar events)
[2023-03-20 21:56:15] [INFO ] Invariant cache hit.
[2023-03-20 21:56:16] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-20 21:56:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 21:56:16] [INFO ] Flow matrix only has 28 transitions (discarded 9 similar events)
[2023-03-20 21:56:16] [INFO ] Invariant cache hit.
[2023-03-20 21:56:16] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/149 places, 37/457 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 22/149 places, 37/457 transitions.
Stuttering acceptance computed with spot in 97 ms :[p0, (AND (NOT p1) p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s6 0) (EQ s14 1)), p0:(OR (EQ s10 0) (EQ s15 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-14 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(!p1)||(!p1&&F((G(F(p2))||(F(p2)&&X(!p3)))))))'
Support contains 7 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 457/457 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 130 transition count 434
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 130 transition count 434
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 130 transition count 428
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 121 transition count 417
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 121 transition count 417
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 121 transition count 415
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 116 transition count 410
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 116 transition count 410
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 113 transition count 407
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 113 transition count 407
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 110 transition count 404
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 110 transition count 404
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 108 transition count 402
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 108 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 108 transition count 401
Applied a total of 91 rules in 21 ms. Remains 108 /149 variables (removed 41) and now considering 401/457 (removed 56) transitions.
[2023-03-20 21:56:16] [INFO ] Flow matrix only has 393 transitions (discarded 8 similar events)
// Phase 1: matrix 393 rows 108 cols
[2023-03-20 21:56:16] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-20 21:56:16] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-20 21:56:16] [INFO ] Flow matrix only has 393 transitions (discarded 8 similar events)
[2023-03-20 21:56:16] [INFO ] Invariant cache hit.
[2023-03-20 21:56:16] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:16] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-20 21:56:16] [INFO ] Flow matrix only has 393 transitions (discarded 8 similar events)
[2023-03-20 21:56:16] [INFO ] Invariant cache hit.
[2023-03-20 21:56:17] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/149 places, 401/457 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1018 ms. Remains : 108/149 places, 401/457 transitions.
Stuttering acceptance computed with spot in 577 ms :[(AND (NOT p0) p1), true, (NOT p0), (AND (NOT p2) p1), (AND p1 (NOT p2) p3), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2) p3 (NOT p0)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p3 (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=4 dest: 7}, { cond=(AND p1 p3), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=6 dest: 8}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=6 dest: 9}, { cond=(AND p0 p1 p3), acceptance={} source=6 dest: 10}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) p3), acceptance={} source=8 dest: 7}, { cond=p3, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) p3), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=10 dest: 9}, { cond=(AND p0 p3), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (EQ s51 0) (EQ s55 1)), p1:(AND (EQ s103 1) (OR (EQ s20 0) (EQ s87 1))), p2:(NEQ s103 1), p3:(OR (EQ s78 0) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 506 reset in 325 ms.
Product exploration explored 100000 steps with 49 reset in 529 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/108 stabilizing places and 16/401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND p1 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p3)), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 p3))), (X (AND (NOT p1) p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p3)), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X p0)), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 50 factoid took 3477 ms. Reduced automaton from 11 states, 36 edges and 4 AP (stutter sensitive) to 9 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 540 ms :[(AND p1 (NOT p2) p3 (NOT p0)), (AND (NOT p2) p1), (AND p1 (NOT p2) p3), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2) p3 (NOT p0)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p3 (NOT p0))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 828 ms. (steps per millisecond=12 ) properties (out of 27) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :2
Running SMT prover for 11 properties.
[2023-03-20 21:56:24] [INFO ] Flow matrix only has 393 transitions (discarded 8 similar events)
[2023-03-20 21:56:24] [INFO ] Invariant cache hit.
[2023-03-20 21:56:24] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 21:56:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-20 21:56:24] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 21:56:24] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:25] [INFO ] After 414ms SMT Verify possible using 260 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 21:56:25] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 2 ms to minimize.
[2023-03-20 21:56:25] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 2 ms to minimize.
[2023-03-20 21:56:25] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 2 ms to minimize.
[2023-03-20 21:56:26] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 1 ms to minimize.
[2023-03-20 21:56:26] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2023-03-20 21:56:26] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2023-03-20 21:56:26] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2023-03-20 21:56:26] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2023-03-20 21:56:26] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2023-03-20 21:56:26] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-20 21:56:27] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2023-03-20 21:56:27] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2023-03-20 21:56:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 2044 ms
[2023-03-20 21:56:27] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2023-03-20 21:56:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 114 ms
[2023-03-20 21:56:27] [INFO ] After 2687ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :0
[2023-03-20 21:56:27] [INFO ] After 3288ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 11 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND p1 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p3)), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 p3))), (X (AND (NOT p1) p3)), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p3)), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X p0)), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p2) p3 (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) p3))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND p1 (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (AND p1 p3 (NOT p0)))), (G (NOT (AND p1 (NOT p2) p3 (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) p3 p0))), (G (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) p3)), (F (NOT (AND p3 p0))), (F (NOT (AND (NOT p1) p3))), (F (AND (NOT p2) p3 p0)), (F (AND p3 (NOT p0))), (F (AND p1 p3)), (F (AND p1 (NOT p2))), (F (AND (NOT p2) p0)), (F (NOT p3)), (F (AND p1 (NOT p2) p0)), (F (NOT (AND (NOT p1) p3 p0))), (F (AND (NOT p2) p3)), (F (NOT p2)), (F (AND p1 p3 p0)), (F (AND p1 (NOT p2) p3 p0)), (F (AND (NOT p1) p3 (NOT p0)))]
Knowledge based reduction with 61 factoid took 4559 ms. Reduced automaton from 9 states, 28 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND p3 (NOT p2) (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 182 ms :[(AND p3 (NOT p2) (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (NOT p2)]
Support contains 5 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-20 21:56:32] [INFO ] Flow matrix only has 393 transitions (discarded 8 similar events)
[2023-03-20 21:56:32] [INFO ] Invariant cache hit.
[2023-03-20 21:56:32] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-20 21:56:32] [INFO ] Flow matrix only has 393 transitions (discarded 8 similar events)
[2023-03-20 21:56:32] [INFO ] Invariant cache hit.
[2023-03-20 21:56:32] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:32] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2023-03-20 21:56:32] [INFO ] Flow matrix only has 393 transitions (discarded 8 similar events)
[2023-03-20 21:56:32] [INFO ] Invariant cache hit.
[2023-03-20 21:56:33] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 855 ms. Remains : 108/108 places, 401/401 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/108 stabilizing places and 16/401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p3 p2 p0), (X (AND p0 p3)), (X (NOT (AND (NOT p0) p3))), (X (X p3)), (X (X (AND p0 p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 486 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND p3 (NOT p2) (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (NOT p2)]
Finished random walk after 2666 steps, including 1 resets, run visited all 5 properties in 49 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p3 p2 p0), (X (AND p0 p3)), (X (NOT (AND (NOT p0) p3))), (X (X p3)), (X (X (AND p0 p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p3 p0))), (F (NOT p3)), (F (AND p3 (NOT p0))), (F (AND p3 (NOT p2)))]
Knowledge based reduction with 8 factoid took 682 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND p3 (NOT p2) (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 196 ms :[(AND p3 (NOT p2) (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 207 ms :[(AND p3 (NOT p2) (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (NOT p2)]
Product exploration explored 100000 steps with 62 reset in 185 ms.
Product exploration explored 100000 steps with 38 reset in 172 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 188 ms :[(AND p3 (NOT p2) (NOT p0)), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (NOT p2)]
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 401/401 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 108 transition count 401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 108 transition count 399
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 37 place count 108 transition count 405
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 108 transition count 405
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 71 place count 82 transition count 379
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 97 place count 82 transition count 379
Performed 33 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 130 place count 82 transition count 384
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 211 place count 82 transition count 303
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 234 place count 59 transition count 280
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 23 rules applied. Total rules applied 257 place count 59 transition count 280
Deduced a syphon composed of 27 places in 0 ms
Drop transitions removed 200 transitions
Redundant transition composition rules discarded 200 transitions
Iterating global reduction 3 with 200 rules applied. Total rules applied 457 place count 59 transition count 80
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 464 place count 59 transition count 80
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 477 place count 46 transition count 67
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 490 place count 46 transition count 67
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 490 rules in 100 ms. Remains 46 /108 variables (removed 62) and now considering 67/401 (removed 334) transitions.
[2023-03-20 21:56:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 21:56:36] [INFO ] Flow matrix only has 60 transitions (discarded 7 similar events)
// Phase 1: matrix 60 rows 46 cols
[2023-03-20 21:56:36] [INFO ] Computed 1 place invariants in 10 ms
[2023-03-20 21:56:36] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/108 places, 67/401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 46/108 places, 67/401 transitions.
Built C files in :
/tmp/ltsmin1831817647421142249
[2023-03-20 21:56:36] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1831817647421142249
Running compilation step : cd /tmp/ltsmin1831817647421142249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1433 ms.
Running link step : cd /tmp/ltsmin1831817647421142249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1831817647421142249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17198090705684764539.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 401/401 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 106 transition count 399
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 106 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 104 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 104 transition count 397
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 102 transition count 395
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 102 transition count 395
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 100 transition count 393
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 100 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 100 transition count 392
Applied a total of 17 rules in 10 ms. Remains 100 /108 variables (removed 8) and now considering 392/401 (removed 9) transitions.
[2023-03-20 21:56:51] [INFO ] Flow matrix only has 384 transitions (discarded 8 similar events)
// Phase 1: matrix 384 rows 100 cols
[2023-03-20 21:56:51] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-20 21:56:51] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-20 21:56:51] [INFO ] Flow matrix only has 384 transitions (discarded 8 similar events)
[2023-03-20 21:56:51] [INFO ] Invariant cache hit.
[2023-03-20 21:56:51] [INFO ] State equation strengthened by 260 read => feed constraints.
[2023-03-20 21:56:51] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-20 21:56:51] [INFO ] Flow matrix only has 384 transitions (discarded 8 similar events)
[2023-03-20 21:56:51] [INFO ] Invariant cache hit.
[2023-03-20 21:56:52] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/108 places, 392/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 871 ms. Remains : 100/108 places, 392/401 transitions.
Built C files in :
/tmp/ltsmin8672036336402881634
[2023-03-20 21:56:52] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8672036336402881634
Running compilation step : cd /tmp/ltsmin8672036336402881634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1499 ms.
Running link step : cd /tmp/ltsmin8672036336402881634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8672036336402881634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17598620826224089904.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 21:57:07] [INFO ] Flatten gal took : 44 ms
[2023-03-20 21:57:07] [INFO ] Flatten gal took : 40 ms
[2023-03-20 21:57:07] [INFO ] Time to serialize gal into /tmp/LTL15318697820835424275.gal : 12 ms
[2023-03-20 21:57:07] [INFO ] Time to serialize properties into /tmp/LTL16851739228097961681.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15318697820835424275.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12939524226630598672.hoa' '-atoms' '/tmp/LTL16851739228097961681.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16851739228097961681.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12939524226630598672.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t8, t10, t11, t13, t17, t18, t20, t22, t23, t25, t30, t31, t33, t35, t36, t38, t4...458
47 unique states visited
0 strongly connected components in search stack
92 transitions explored
46 items max in DFS search stack
871 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.86326,201680,1,0,780,445421,812,257,11721,442096,1621
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-15 finished in 61010 ms.
All properties solved by simple procedures.
Total runtime 76536 ms.

BK_STOP 1679349438296

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-06a"
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-5348"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-06a, 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 r453-smll-167912645500459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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