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-167912645400404.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-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645400404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 10:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 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 231K 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-02b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679329640221

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-20 16:27:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 16:27:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 16:27:23] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-20 16:27:23] [INFO ] Transformed 928 places.
[2023-03-20 16:27:23] [INFO ] Transformed 1040 transitions.
[2023-03-20 16:27:23] [INFO ] Found NUPN structural information;
[2023-03-20 16:27:23] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyCommit-PT-02b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 854 transition count 966
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 854 transition count 966
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 192 place count 810 transition count 922
Iterating global reduction 0 with 44 rules applied. Total rules applied 236 place count 810 transition count 922
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 259 place count 787 transition count 899
Iterating global reduction 0 with 23 rules applied. Total rules applied 282 place count 787 transition count 899
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 767 transition count 879
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 767 transition count 879
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 337 place count 752 transition count 864
Iterating global reduction 0 with 15 rules applied. Total rules applied 352 place count 752 transition count 864
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 367 place count 737 transition count 849
Iterating global reduction 0 with 15 rules applied. Total rules applied 382 place count 737 transition count 849
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 397 place count 722 transition count 834
Iterating global reduction 0 with 15 rules applied. Total rules applied 412 place count 722 transition count 834
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 427 place count 707 transition count 819
Iterating global reduction 0 with 15 rules applied. Total rules applied 442 place count 707 transition count 819
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 453 place count 696 transition count 808
Iterating global reduction 0 with 11 rules applied. Total rules applied 464 place count 696 transition count 808
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 471 place count 689 transition count 801
Iterating global reduction 0 with 7 rules applied. Total rules applied 478 place count 689 transition count 801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 479 place count 689 transition count 800
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 481 place count 687 transition count 798
Iterating global reduction 1 with 2 rules applied. Total rules applied 483 place count 687 transition count 798
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 485 place count 685 transition count 796
Iterating global reduction 1 with 2 rules applied. Total rules applied 487 place count 685 transition count 796
Applied a total of 487 rules in 749 ms. Remains 685 /928 variables (removed 243) and now considering 796/1040 (removed 244) transitions.
// Phase 1: matrix 796 rows 685 cols
[2023-03-20 16:27:24] [INFO ] Computed 4 place invariants in 32 ms
[2023-03-20 16:27:25] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-20 16:27:25] [INFO ] Invariant cache hit.
[2023-03-20 16:27:25] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2023-03-20 16:27:25] [INFO ] Invariant cache hit.
[2023-03-20 16:27:26] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 685/928 places, 796/1040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2611 ms. Remains : 685/928 places, 796/1040 transitions.
Support contains 34 out of 685 places after structural reductions.
[2023-03-20 16:27:27] [INFO ] Flatten gal took : 126 ms
[2023-03-20 16:27:27] [INFO ] Flatten gal took : 60 ms
[2023-03-20 16:27:27] [INFO ] Input system was already deterministic with 796 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 709 ms. (steps per millisecond=14 ) properties (out of 29) seen :6
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-20 16:27:28] [INFO ] Invariant cache hit.
[2023-03-20 16:27:28] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-20 16:27:30] [INFO ] After 1016ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10 real:13
[2023-03-20 16:27:30] [INFO ] Deduced a trap composed of 320 places in 467 ms of which 10 ms to minimize.
[2023-03-20 16:27:31] [INFO ] Deduced a trap composed of 321 places in 348 ms of which 2 ms to minimize.
[2023-03-20 16:27:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1017 ms
[2023-03-20 16:27:31] [INFO ] Deduced a trap composed of 325 places in 309 ms of which 1 ms to minimize.
[2023-03-20 16:27:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2023-03-20 16:27:32] [INFO ] Deduced a trap composed of 324 places in 442 ms of which 3 ms to minimize.
[2023-03-20 16:27:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 609 ms
[2023-03-20 16:27:33] [INFO ] After 3950ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :6 real:17
Attempting to minimize the solution found.
Minimization took 327 ms.
[2023-03-20 16:27:33] [INFO ] After 5097ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:18
[2023-03-20 16:27:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2023-03-20 16:27:36] [INFO ] After 1700ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :22
[2023-03-20 16:27:36] [INFO ] Deduced a trap composed of 320 places in 558 ms of which 1 ms to minimize.
[2023-03-20 16:27:37] [INFO ] Deduced a trap composed of 321 places in 365 ms of which 1 ms to minimize.
[2023-03-20 16:27:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1086 ms
[2023-03-20 16:27:38] [INFO ] Deduced a trap composed of 325 places in 495 ms of which 2 ms to minimize.
[2023-03-20 16:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 592 ms
[2023-03-20 16:27:38] [INFO ] Deduced a trap composed of 324 places in 369 ms of which 1 ms to minimize.
[2023-03-20 16:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 463 ms
[2023-03-20 16:27:39] [INFO ] Deduced a trap composed of 320 places in 392 ms of which 2 ms to minimize.
[2023-03-20 16:27:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 482 ms
[2023-03-20 16:27:40] [INFO ] Deduced a trap composed of 322 places in 402 ms of which 1 ms to minimize.
[2023-03-20 16:27:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 495 ms
[2023-03-20 16:27:40] [INFO ] After 6370ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :22
Attempting to minimize the solution found.
Minimization took 1024 ms.
[2023-03-20 16:27:41] [INFO ] After 8568ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :22
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 15 properties in 198 ms.
Support contains 9 out of 685 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 796/796 transitions.
Graph (trivial) has 663 edges and 685 vertex of which 50 / 685 are part of one of the 8 SCC in 10 ms
Free SCC test removed 42 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 938 edges and 643 vertex of which 641 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 466 transitions
Trivial Post-agglo rules discarded 466 transitions
Performed 466 trivial Post agglomeration. Transition count delta: 466
Iterating post reduction 0 with 468 rules applied. Total rules applied 470 place count 641 transition count 272
Reduce places removed 466 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 475 rules applied. Total rules applied 945 place count 175 transition count 263
Reduce places removed 4 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 10 rules applied. Total rules applied 955 place count 171 transition count 257
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 961 place count 165 transition count 257
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 961 place count 165 transition count 220
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1035 place count 128 transition count 220
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1036 place count 128 transition count 219
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1042 place count 122 transition count 213
Iterating global reduction 5 with 6 rules applied. Total rules applied 1048 place count 122 transition count 213
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1051 place count 119 transition count 210
Iterating global reduction 5 with 3 rules applied. Total rules applied 1054 place count 119 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1055 place count 118 transition count 209
Iterating global reduction 5 with 1 rules applied. Total rules applied 1056 place count 118 transition count 209
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1057 place count 117 transition count 208
Iterating global reduction 5 with 1 rules applied. Total rules applied 1058 place count 117 transition count 208
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 1104 place count 94 transition count 185
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1111 place count 94 transition count 178
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 1131 place count 74 transition count 121
Iterating global reduction 6 with 20 rules applied. Total rules applied 1151 place count 74 transition count 121
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1161 place count 74 transition count 111
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1171 place count 64 transition count 101
Iterating global reduction 7 with 10 rules applied. Total rules applied 1181 place count 64 transition count 101
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1187 place count 58 transition count 95
Iterating global reduction 7 with 6 rules applied. Total rules applied 1193 place count 58 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1196 place count 58 transition count 92
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 1202 place count 55 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
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 1208 place count 52 transition count 102
Free-agglomeration rule applied 18 times with reduction of 3 identical transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1226 place count 52 transition count 81
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1250 place count 34 transition count 75
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1265 place count 34 transition count 60
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1270 place count 34 transition count 60
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1271 place count 34 transition count 59
Applied a total of 1271 rules in 204 ms. Remains 34 /685 variables (removed 651) and now considering 59/796 (removed 737) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 34/685 places, 59/796 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 59 rows 34 cols
[2023-03-20 16:27:42] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 16:27:42] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-20 16:27:42] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 16:27:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 16:27:42] [INFO ] After 8ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 16:27:42] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 16:27:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 16:27:43] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 16:27:43] [INFO ] After 8ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 16:27:43] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 16:27:43] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 125 stabilizing places and 131 stable transitions
FORMULA StigmergyCommit-PT-02b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 3 out of 685 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Graph (trivial) has 674 edges and 685 vertex of which 53 / 685 are part of one of the 9 SCC in 3 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 468 transitions
Trivial Post-agglo rules discarded 468 transitions
Performed 468 trivial Post agglomeration. Transition count delta: 468
Iterating post reduction 0 with 468 rules applied. Total rules applied 469 place count 640 transition count 277
Reduce places removed 468 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 477 rules applied. Total rules applied 946 place count 172 transition count 268
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 953 place count 168 transition count 265
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 956 place count 165 transition count 265
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 956 place count 165 transition count 229
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1028 place count 129 transition count 229
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1036 place count 121 transition count 221
Iterating global reduction 4 with 8 rules applied. Total rules applied 1044 place count 121 transition count 221
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1047 place count 118 transition count 218
Iterating global reduction 4 with 3 rules applied. Total rules applied 1050 place count 118 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1051 place count 117 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 1052 place count 117 transition count 217
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1053 place count 116 transition count 216
Iterating global reduction 4 with 1 rules applied. Total rules applied 1054 place count 116 transition count 216
Performed 23 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1100 place count 93 transition count 190
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1119 place count 74 transition count 136
Iterating global reduction 4 with 19 rules applied. Total rules applied 1138 place count 74 transition count 136
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1147 place count 74 transition count 127
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1157 place count 64 transition count 114
Iterating global reduction 5 with 10 rules applied. Total rules applied 1167 place count 64 transition count 114
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1177 place count 54 transition count 101
Iterating global reduction 5 with 10 rules applied. Total rules applied 1187 place count 54 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1191 place count 54 transition count 97
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1205 place count 47 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1206 place count 46 transition count 103
Iterating global reduction 6 with 1 rules applied. Total rules applied 1207 place count 46 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1208 place count 46 transition count 102
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1211 place count 46 transition count 99
Applied a total of 1211 rules in 120 ms. Remains 46 /685 variables (removed 639) and now considering 99/796 (removed 697) transitions.
[2023-03-20 16:27:43] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
// Phase 1: matrix 95 rows 46 cols
[2023-03-20 16:27:43] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-20 16:27:43] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-20 16:27:43] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
[2023-03-20 16:27:43] [INFO ] Invariant cache hit.
[2023-03-20 16:27:43] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-20 16:27:44] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-20 16:27:44] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 16:27:44] [INFO ] Flow matrix only has 95 transitions (discarded 4 similar events)
[2023-03-20 16:27:44] [INFO ] Invariant cache hit.
[2023-03-20 16:27:44] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/685 places, 99/796 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 461 ms. Remains : 46/685 places, 99/796 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s39 1) (EQ s33 0) (EQ s12 0))], 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 4 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-00 finished in 832 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(F(p0)))'
Support contains 3 out of 685 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 674 transition count 785
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 674 transition count 785
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 665 transition count 776
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 665 transition count 776
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 665 transition count 775
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 658 transition count 768
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 658 transition count 768
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 651 transition count 761
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 651 transition count 761
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 646 transition count 756
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 646 transition count 756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 641 transition count 751
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 641 transition count 751
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 94 place count 636 transition count 746
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 636 transition count 746
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 631 transition count 741
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 631 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 631 transition count 740
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 628 transition count 737
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 628 transition count 737
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 119 place count 625 transition count 734
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 625 transition count 734
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 125 place count 622 transition count 731
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 622 transition count 731
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 619 transition count 728
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 619 transition count 728
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 616 transition count 725
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 616 transition count 725
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 613 transition count 722
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 613 transition count 722
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 610 transition count 719
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 610 transition count 719
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 607 transition count 716
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 607 transition count 716
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 604 transition count 713
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 604 transition count 713
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 167 place count 601 transition count 710
Iterating global reduction 2 with 3 rules applied. Total rules applied 170 place count 601 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 171 place count 601 transition count 709
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 599 transition count 707
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 599 transition count 707
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 597 transition count 705
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 597 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 181 place count 596 transition count 703
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 596 transition count 702
Applied a total of 183 rules in 894 ms. Remains 596 /685 variables (removed 89) and now considering 702/796 (removed 94) transitions.
// Phase 1: matrix 702 rows 596 cols
[2023-03-20 16:27:45] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-20 16:27:45] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-20 16:27:45] [INFO ] Invariant cache hit.
[2023-03-20 16:27:46] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-20 16:27:46] [INFO ] Invariant cache hit.
[2023-03-20 16:27:46] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/685 places, 702/796 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2568 ms. Remains : 596/685 places, 702/796 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s155 1) (EQ s349 1) (EQ s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-01 finished in 2667 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&&G(p1)))||X((G(p2) U p3))))'
Support contains 3 out of 685 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 674 transition count 785
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 674 transition count 785
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 665 transition count 776
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 665 transition count 776
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 665 transition count 775
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 658 transition count 768
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 658 transition count 768
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 651 transition count 761
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 651 transition count 761
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 646 transition count 756
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 646 transition count 756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 641 transition count 751
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 641 transition count 751
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 94 place count 636 transition count 746
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 636 transition count 746
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 631 transition count 741
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 631 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 631 transition count 740
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 628 transition count 737
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 628 transition count 737
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 119 place count 625 transition count 734
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 625 transition count 734
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 125 place count 622 transition count 731
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 622 transition count 731
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 619 transition count 728
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 619 transition count 728
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 616 transition count 725
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 616 transition count 725
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 142 place count 614 transition count 723
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 614 transition count 723
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 612 transition count 721
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 612 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 610 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 610 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 608 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 608 transition count 717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 606 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 606 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 606 transition count 714
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 605 transition count 713
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 605 transition count 713
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 604 transition count 712
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 604 transition count 712
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 603 transition count 711
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 603 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 603 transition count 710
Applied a total of 168 rules in 519 ms. Remains 603 /685 variables (removed 82) and now considering 710/796 (removed 86) transitions.
// Phase 1: matrix 710 rows 603 cols
[2023-03-20 16:27:47] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-20 16:27:47] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-20 16:27:47] [INFO ] Invariant cache hit.
[2023-03-20 16:27:48] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2023-03-20 16:27:48] [INFO ] Invariant cache hit.
[2023-03-20 16:27:49] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 603/685 places, 710/796 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2123 ms. Remains : 603/685 places, 710/796 transitions.
Stuttering acceptance computed with spot in 433 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s458 0), p1:(OR (EQ s539 0) (EQ s602 0)), p3:(EQ s458 1), p2:(AND (EQ s539 1) (EQ s602 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1631 reset in 384 ms.
Product exploration explored 100000 steps with 223 reset in 327 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)))), (X (AND p0 p1 (NOT p3) (NOT p2))), (X (AND p1 (NOT p3) (NOT p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (AND p0 p1 (NOT p3) (NOT p2)))), (X (X (AND p1 (NOT p3) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p3) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 1734 ms. Reduced automaton from 7 states, 26 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 163 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 16:27:52] [INFO ] Invariant cache hit.
[2023-03-20 16:27:52] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 16:27:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-20 16:27:53] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 16:27:53] [INFO ] Deduced a trap composed of 298 places in 455 ms of which 1 ms to minimize.
[2023-03-20 16:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 572 ms
[2023-03-20 16:27:54] [INFO ] After 1118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 16:27:54] [INFO ] After 1354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)))), (X (AND p0 p1 (NOT p3) (NOT p2))), (X (AND p1 (NOT p3) (NOT p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (AND p0 p1 (NOT p3) (NOT p2)))), (X (X (AND p1 (NOT p3) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p3) p2))))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p0))), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 28 factoid took 1569 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 710/710 transitions.
Applied a total of 0 rules in 22 ms. Remains 603 /603 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2023-03-20 16:27:55] [INFO ] Invariant cache hit.
[2023-03-20 16:27:56] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-20 16:27:56] [INFO ] Invariant cache hit.
[2023-03-20 16:27:56] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
[2023-03-20 16:27:56] [INFO ] Invariant cache hit.
[2023-03-20 16:27:57] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1682 ms. Remains : 603/603 places, 710/710 transitions.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 166 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 471206 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 471206 steps, saw 104844 distinct states, run finished after 3004 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 16:28:01] [INFO ] Invariant cache hit.
[2023-03-20 16:28:01] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 16:28:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-20 16:28:02] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 16:28:02] [INFO ] After 904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-20 16:28:02] [INFO ] After 1312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 7 ms.
Support contains 2 out of 603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 710/710 transitions.
Graph (trivial) has 598 edges and 603 vertex of which 51 / 603 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 832 edges and 561 vertex of which 558 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 423 rules applied. Total rules applied 425 place count 558 transition count 230
Reduce places removed 420 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 429 rules applied. Total rules applied 854 place count 138 transition count 221
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 859 place count 135 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 861 place count 133 transition count 219
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 861 place count 133 transition count 186
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 927 place count 100 transition count 186
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 928 place count 100 transition count 185
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 972 place count 78 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 978 place count 78 transition count 157
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 997 place count 59 transition count 101
Iterating global reduction 6 with 19 rules applied. Total rules applied 1016 place count 59 transition count 101
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1026 place count 59 transition count 91
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1035 place count 50 transition count 82
Iterating global reduction 7 with 9 rules applied. Total rules applied 1044 place count 50 transition count 82
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1050 place count 44 transition count 76
Iterating global reduction 7 with 6 rules applied. Total rules applied 1056 place count 44 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1059 place count 44 transition count 73
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 1065 place count 41 transition count 70
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1073 place count 37 transition count 90
Free-agglomeration rule applied 16 times with reduction of 10 identical transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1089 place count 37 transition count 64
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 1118 place count 21 transition count 51
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1126 place count 21 transition count 43
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1128 place count 21 transition count 43
Applied a total of 1128 rules in 63 ms. Remains 21 /603 variables (removed 582) and now considering 43/710 (removed 667) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 21/603 places, 43/710 transitions.
Finished random walk after 61 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 5 factoid took 475 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1635 reset in 170 ms.
Product exploration explored 100000 steps with 1631 reset in 188 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 603/603 places, 710/710 transitions.
Graph (trivial) has 595 edges and 603 vertex of which 44 / 603 are part of one of the 8 SCC in 2 ms
Free SCC test removed 36 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Performed 418 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 418 rules applied. Total rules applied 419 place count 567 transition count 669
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 427 place count 567 transition count 662
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 427 place count 567 transition count 665
Deduced a syphon composed of 444 places in 1 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 452 place count 567 transition count 665
Discarding 374 places :
Symmetric choice reduction at 2 with 374 rule applications. Total rules 826 place count 193 transition count 291
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 2 with 374 rules applied. Total rules applied 1200 place count 193 transition count 291
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 1234 place count 193 transition count 301
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 1290 place count 137 transition count 206
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 1346 place count 137 transition count 206
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1359 place count 137 transition count 193
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1383 place count 113 transition count 167
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 24 rules applied. Total rules applied 1407 place count 113 transition count 167
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1415 place count 105 transition count 159
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1423 place count 105 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1426 place count 105 transition count 156
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1432 place count 99 transition count 150
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1438 place count 99 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1439 place count 99 transition count 151
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1440 place count 98 transition count 149
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1441 place count 98 transition count 149
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1448 place count 98 transition count 187
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1456 place count 90 transition count 171
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1464 place count 90 transition count 171
Deduced a syphon composed of 45 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1470 place count 90 transition count 165
Deduced a syphon composed of 45 places in 0 ms
Applied a total of 1470 rules in 144 ms. Remains 90 /603 variables (removed 513) and now considering 165/710 (removed 545) transitions.
[2023-03-20 16:28:04] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-20 16:28:04] [INFO ] Flow matrix only has 161 transitions (discarded 4 similar events)
// Phase 1: matrix 161 rows 90 cols
[2023-03-20 16:28:04] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-20 16:28:05] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/603 places, 165/710 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 90/603 places, 165/710 transitions.
Built C files in :
/tmp/ltsmin4170217672661119818
[2023-03-20 16:28:05] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4170217672661119818
Running compilation step : cd /tmp/ltsmin4170217672661119818;'/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 1907 ms.
Running link step : cd /tmp/ltsmin4170217672661119818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4170217672661119818;'/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/stateBased3168749233184356498.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 710/710 transitions.
Applied a total of 0 rules in 16 ms. Remains 603 /603 variables (removed 0) and now considering 710/710 (removed 0) transitions.
// Phase 1: matrix 710 rows 603 cols
[2023-03-20 16:28:20] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-20 16:28:20] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-20 16:28:20] [INFO ] Invariant cache hit.
[2023-03-20 16:28:20] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2023-03-20 16:28:20] [INFO ] Invariant cache hit.
[2023-03-20 16:28:21] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1372 ms. Remains : 603/603 places, 710/710 transitions.
Built C files in :
/tmp/ltsmin12731004828336856179
[2023-03-20 16:28:21] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12731004828336856179
Running compilation step : cd /tmp/ltsmin12731004828336856179;'/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 1907 ms.
Running link step : cd /tmp/ltsmin12731004828336856179;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12731004828336856179;'/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/stateBased7304011170576712388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 16:28:36] [INFO ] Flatten gal took : 39 ms
[2023-03-20 16:28:36] [INFO ] Flatten gal took : 35 ms
[2023-03-20 16:28:36] [INFO ] Time to serialize gal into /tmp/LTL1748582472360891062.gal : 8 ms
[2023-03-20 16:28:36] [INFO ] Time to serialize properties into /tmp/LTL239979258545848418.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1748582472360891062.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15961498768872557212.hoa' '-atoms' '/tmp/LTL239979258545848418.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...317
Loading property file /tmp/LTL239979258545848418.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15961498768872557212.hoa
Detected timeout of ITS tools.
[2023-03-20 16:28:52] [INFO ] Flatten gal took : 52 ms
[2023-03-20 16:28:52] [INFO ] Flatten gal took : 50 ms
[2023-03-20 16:28:52] [INFO ] Time to serialize gal into /tmp/LTL3106872584066371086.gal : 7 ms
[2023-03-20 16:28:52] [INFO ] Time to serialize properties into /tmp/LTL4035694583915302762.ltl : 6 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/LTL3106872584066371086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4035694583915302762.ltl' '-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...275
Read 1 LTL properties
Checking formula 0 : !(((F(("(p691==0)")&&(G("((p836==0)||(p926==0))"))))||(X((G("((p836==1)&&(p926==1))"))U("(p691==1)")))))
Formula 0 simplified : G(!"(p691==0)" | F!"((p836==0)||(p926==0))") & X(F!"((p836==1)&&(p926==1))" R !"(p691==1)")
Detected timeout of ITS tools.
[2023-03-20 16:29:07] [INFO ] Flatten gal took : 30 ms
[2023-03-20 16:29:07] [INFO ] Applying decomposition
[2023-03-20 16:29:07] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2314066379023679070.txt' '-o' '/tmp/graph2314066379023679070.bin' '-w' '/tmp/graph2314066379023679070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2314066379023679070.bin' '-l' '-1' '-v' '-w' '/tmp/graph2314066379023679070.weights' '-q' '0' '-e' '0.001'
[2023-03-20 16:29:07] [INFO ] Decomposing Gal with order
[2023-03-20 16:29:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 16:29:07] [INFO ] Removed a total of 393 redundant transitions.
[2023-03-20 16:29:07] [INFO ] Flatten gal took : 118 ms
[2023-03-20 16:29:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 24 ms.
[2023-03-20 16:29:07] [INFO ] Time to serialize gal into /tmp/LTL16511015232405242063.gal : 16 ms
[2023-03-20 16:29:07] [INFO ] Time to serialize properties into /tmp/LTL18172891909235349728.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16511015232405242063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18172891909235349728.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !(((F(("(i20.u181.p691==0)")&&(G("((i24.u217.p836==0)||(i28.u240.p926==0))"))))||(X((G("((i24.u217.p836==1)&&(i28.u240.p926==1))"))U("...179
Formula 0 simplified : G(!"(i20.u181.p691==0)" | F!"((i24.u217.p836==0)||(i28.u240.p926==0))") & X(F!"((i24.u217.p836==1)&&(i28.u240.p926==1))" R !"(i20.u1...168
Reverse transition relation is NOT exact ! Due to transitions t70, t174, t175, t228, t231, t425, t506, t562, t618, t634, t635, t642, t645, t650, t653, t659...483
Computing Next relation with stutter on 6502 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1814718742560000344
[2023-03-20 16:29:22] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1814718742560000344
Running compilation step : cd /tmp/ltsmin1814718742560000344;'/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 1847 ms.
Running link step : cd /tmp/ltsmin1814718742560000344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1814718742560000344;'/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' '--ltl' '(<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))||X(([]((LTLAPp2==true)) U (LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyCommit-PT-02b-LTLFireability-02 finished in 110841 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||G(p1))))'
Support contains 2 out of 685 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 675 transition count 786
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 675 transition count 786
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 666 transition count 777
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 666 transition count 777
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 666 transition count 776
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 659 transition count 769
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 659 transition count 769
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 652 transition count 762
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 652 transition count 762
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 647 transition count 757
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 647 transition count 757
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 642 transition count 752
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 642 transition count 752
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 637 transition count 747
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 637 transition count 747
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 632 transition count 742
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 632 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 632 transition count 741
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 629 transition count 738
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 629 transition count 738
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 626 transition count 735
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 626 transition count 735
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 623 transition count 732
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 623 transition count 732
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 620 transition count 729
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 620 transition count 729
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 135 place count 617 transition count 726
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 617 transition count 726
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 614 transition count 723
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 614 transition count 723
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 611 transition count 720
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 611 transition count 720
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 153 place count 608 transition count 717
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 608 transition count 717
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 159 place count 605 transition count 714
Iterating global reduction 2 with 3 rules applied. Total rules applied 162 place count 605 transition count 714
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 165 place count 602 transition count 711
Iterating global reduction 2 with 3 rules applied. Total rules applied 168 place count 602 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 169 place count 602 transition count 710
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 600 transition count 708
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 600 transition count 708
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 598 transition count 706
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 598 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 178 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 179 place count 597 transition count 704
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 597 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 597 transition count 703
Applied a total of 181 rules in 381 ms. Remains 597 /685 variables (removed 88) and now considering 703/796 (removed 93) transitions.
// Phase 1: matrix 703 rows 597 cols
[2023-03-20 16:29:38] [INFO ] Computed 4 place invariants in 10 ms
[2023-03-20 16:29:38] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-20 16:29:38] [INFO ] Invariant cache hit.
[2023-03-20 16:29:39] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-20 16:29:39] [INFO ] Invariant cache hit.
[2023-03-20 16:29:39] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 597/685 places, 703/796 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1871 ms. Remains : 597/685 places, 703/796 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(NEQ s356 1), p0:(EQ s582 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1632 reset in 170 ms.
Product exploration explored 100000 steps with 220 reset in 194 ms.
Computed a total of 124 stabilizing places and 130 stable transitions
Computed a total of 124 stabilizing places and 130 stable transitions
Detected a total of 124/597 stabilizing places and 130/703 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 417 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 162 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 818344 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :{}
Probabilistic random walk after 818344 steps, saw 182041 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 16:29:44] [INFO ] Invariant cache hit.
[2023-03-20 16:29:44] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-20 16:29:44] [INFO ] After 312ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 16:29:44] [INFO ] After 393ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-20 16:29:44] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 440 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 597 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 703/703 transitions.
Applied a total of 0 rules in 21 ms. Remains 597 /597 variables (removed 0) and now considering 703/703 (removed 0) transitions.
[2023-03-20 16:29:45] [INFO ] Invariant cache hit.
[2023-03-20 16:29:45] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-20 16:29:45] [INFO ] Invariant cache hit.
[2023-03-20 16:29:46] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2023-03-20 16:29:46] [INFO ] Invariant cache hit.
[2023-03-20 16:29:47] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1952 ms. Remains : 597/597 places, 703/703 transitions.
Computed a total of 124 stabilizing places and 130 stable transitions
Computed a total of 124 stabilizing places and 130 stable transitions
Detected a total of 124/597 stabilizing places and 130/703 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 731114 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 731114 steps, saw 161307 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 16:29:50] [INFO ] Invariant cache hit.
[2023-03-20 16:29:50] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-20 16:29:51] [INFO ] After 386ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 16:29:51] [INFO ] After 467ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-20 16:29:51] [INFO ] After 628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p1, (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1634 reset in 165 ms.
Product exploration explored 100000 steps with 1648 reset in 177 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 703/703 transitions.
Graph (trivial) has 594 edges and 597 vertex of which 51 / 597 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 409 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 409 rules applied. Total rules applied 410 place count 555 transition count 655
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 416 place count 555 transition count 649
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 416 place count 555 transition count 652
Deduced a syphon composed of 433 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 440 place count 555 transition count 652
Discarding 368 places :
Symmetric choice reduction at 2 with 368 rule applications. Total rules 808 place count 187 transition count 284
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 2 with 368 rules applied. Total rules applied 1176 place count 187 transition count 284
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 1210 place count 187 transition count 293
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 1266 place count 131 transition count 197
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 1322 place count 131 transition count 197
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1335 place count 131 transition count 184
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1359 place count 107 transition count 157
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 3 with 24 rules applied. Total rules applied 1383 place count 107 transition count 157
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1391 place count 99 transition count 149
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1399 place count 99 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1401 place count 99 transition count 147
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1406 place count 94 transition count 142
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 1411 place count 94 transition count 142
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1418 place count 94 transition count 191
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1427 place count 85 transition count 172
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 1436 place count 85 transition count 172
Deduced a syphon composed of 43 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1442 place count 85 transition count 166
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 1442 rules in 88 ms. Remains 85 /597 variables (removed 512) and now considering 166/703 (removed 537) transitions.
[2023-03-20 16:29:52] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-20 16:29:52] [INFO ] Flow matrix only has 162 transitions (discarded 4 similar events)
// Phase 1: matrix 162 rows 85 cols
[2023-03-20 16:29:52] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-20 16:29:52] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/597 places, 166/703 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 85/597 places, 166/703 transitions.
Built C files in :
/tmp/ltsmin12584379905791223066
[2023-03-20 16:29:52] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12584379905791223066
Running compilation step : cd /tmp/ltsmin12584379905791223066;'/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 1746 ms.
Running link step : cd /tmp/ltsmin12584379905791223066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12584379905791223066;'/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/stateBased535675705506047532.hoa' '--buchi-type=spotba'
LTSmin run took 2795 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-02b-LTLFireability-04 finished in 19558 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(F((p0||G(p1)))))'
Support contains 4 out of 685 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 675 transition count 786
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 675 transition count 786
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 667 transition count 778
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 667 transition count 778
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 667 transition count 777
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 661 transition count 771
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 661 transition count 771
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 655 transition count 765
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 655 transition count 765
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 651 transition count 761
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 651 transition count 761
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 647 transition count 757
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 647 transition count 757
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 643 transition count 753
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 643 transition count 753
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 639 transition count 749
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 639 transition count 749
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 636 transition count 746
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 636 transition count 746
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 633 transition count 743
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 633 transition count 743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 630 transition count 740
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 630 transition count 740
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 627 transition count 737
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 627 transition count 737
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 624 transition count 734
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 624 transition count 734
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 621 transition count 731
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 621 transition count 731
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 132 place count 618 transition count 728
Iterating global reduction 1 with 3 rules applied. Total rules applied 135 place count 618 transition count 728
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 138 place count 615 transition count 725
Iterating global reduction 1 with 3 rules applied. Total rules applied 141 place count 615 transition count 725
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 144 place count 612 transition count 722
Iterating global reduction 1 with 3 rules applied. Total rules applied 147 place count 612 transition count 722
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 150 place count 609 transition count 719
Iterating global reduction 1 with 3 rules applied. Total rules applied 153 place count 609 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 154 place count 609 transition count 718
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 607 transition count 716
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 607 transition count 716
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 605 transition count 714
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 605 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 163 place count 605 transition count 713
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 604 transition count 712
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 604 transition count 712
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 166 place count 604 transition count 711
Applied a total of 166 rules in 469 ms. Remains 604 /685 variables (removed 81) and now considering 711/796 (removed 85) transitions.
// Phase 1: matrix 711 rows 604 cols
[2023-03-20 16:29:57] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 16:29:58] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-20 16:29:58] [INFO ] Invariant cache hit.
[2023-03-20 16:29:58] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2023-03-20 16:29:58] [INFO ] Invariant cache hit.
[2023-03-20 16:29:59] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 604/685 places, 711/796 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2207 ms. Remains : 604/685 places, 711/796 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s97 1) (EQ s277 1) (EQ s512 1)), p0:(EQ s153 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-06 finished in 2331 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(G(p0))))'
Support contains 1 out of 685 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 674 transition count 785
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 674 transition count 785
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 665 transition count 776
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 665 transition count 776
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 665 transition count 775
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 658 transition count 768
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 658 transition count 768
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 651 transition count 761
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 651 transition count 761
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 646 transition count 756
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 646 transition count 756
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 641 transition count 751
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 641 transition count 751
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 94 place count 636 transition count 746
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 636 transition count 746
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 631 transition count 741
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 631 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 631 transition count 740
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 628 transition count 737
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 628 transition count 737
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 119 place count 625 transition count 734
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 625 transition count 734
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 125 place count 622 transition count 731
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 622 transition count 731
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 619 transition count 728
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 619 transition count 728
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 616 transition count 725
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 616 transition count 725
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 613 transition count 722
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 613 transition count 722
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 610 transition count 719
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 610 transition count 719
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 607 transition count 716
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 607 transition count 716
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 604 transition count 713
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 604 transition count 713
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 167 place count 601 transition count 710
Iterating global reduction 2 with 3 rules applied. Total rules applied 170 place count 601 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 171 place count 601 transition count 709
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 599 transition count 707
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 599 transition count 707
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 597 transition count 705
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 597 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 181 place count 596 transition count 703
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 596 transition count 702
Applied a total of 183 rules in 507 ms. Remains 596 /685 variables (removed 89) and now considering 702/796 (removed 94) transitions.
// Phase 1: matrix 702 rows 596 cols
[2023-03-20 16:30:00] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-20 16:30:00] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-20 16:30:00] [INFO ] Invariant cache hit.
[2023-03-20 16:30:01] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2023-03-20 16:30:01] [INFO ] Invariant cache hit.
[2023-03-20 16:30:02] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/685 places, 702/796 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2255 ms. Remains : 596/685 places, 702/796 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s13 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 1650 reset in 109 ms.
Product exploration explored 100000 steps with 1022 reset in 109 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 163 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 855524 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 855524 steps, saw 190331 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 16:30:05] [INFO ] Invariant cache hit.
[2023-03-20 16:30:05] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-20 16:30:06] [INFO ] After 358ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 16:30:06] [INFO ] After 425ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-20 16:30:06] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 117 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 702/702 transitions.
Applied a total of 0 rules in 20 ms. Remains 596 /596 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2023-03-20 16:30:06] [INFO ] Invariant cache hit.
[2023-03-20 16:30:07] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-20 16:30:07] [INFO ] Invariant cache hit.
[2023-03-20 16:30:07] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
[2023-03-20 16:30:07] [INFO ] Invariant cache hit.
[2023-03-20 16:30:08] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1865 ms. Remains : 596/596 places, 702/702 transitions.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 166 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 884324 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 884324 steps, saw 196760 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 16:30:11] [INFO ] Invariant cache hit.
[2023-03-20 16:30:11] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-20 16:30:12] [INFO ] After 465ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 16:30:12] [INFO ] After 551ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-20 16:30:12] [INFO ] After 729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 141 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=70 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1635 reset in 167 ms.
Entered a terminal (fully accepting) state of product in 35608 steps with 580 reset in 74 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-07 finished in 13683 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||G(((p1 U G(p2)) U X(p3))))))'
Support contains 4 out of 685 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 675 transition count 786
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 675 transition count 786
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 667 transition count 778
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 667 transition count 778
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 660 transition count 771
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 660 transition count 771
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 653 transition count 764
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 653 transition count 764
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 648 transition count 759
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 648 transition count 759
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 643 transition count 754
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 643 transition count 754
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 638 transition count 749
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 638 transition count 749
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 633 transition count 744
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 633 transition count 744
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 105 place count 633 transition count 743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 630 transition count 740
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 630 transition count 740
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 627 transition count 737
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 627 transition count 737
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 625 transition count 735
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 625 transition count 735
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 623 transition count 733
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 623 transition count 733
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 621 transition count 731
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 621 transition count 731
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 619 transition count 729
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 619 transition count 729
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 617 transition count 727
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 617 transition count 727
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 615 transition count 725
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 615 transition count 725
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 143 place count 613 transition count 723
Iterating global reduction 1 with 2 rules applied. Total rules applied 145 place count 613 transition count 723
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 147 place count 611 transition count 721
Iterating global reduction 1 with 2 rules applied. Total rules applied 149 place count 611 transition count 721
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 609 transition count 719
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 609 transition count 719
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 155 place count 607 transition count 717
Iterating global reduction 1 with 2 rules applied. Total rules applied 157 place count 607 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 158 place count 607 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 606 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 606 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 606 transition count 714
Applied a total of 161 rules in 500 ms. Remains 606 /685 variables (removed 79) and now considering 714/796 (removed 82) transitions.
// Phase 1: matrix 714 rows 606 cols
[2023-03-20 16:30:14] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-20 16:30:14] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-20 16:30:14] [INFO ] Invariant cache hit.
[2023-03-20 16:30:15] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2023-03-20 16:30:15] [INFO ] Invariant cache hit.
[2023-03-20 16:30:15] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 606/685 places, 714/796 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2461 ms. Remains : 606/685 places, 714/796 transitions.
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(OR p2 p1), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p2 p1), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s298 1), p2:(EQ s354 1), p1:(EQ s338 1), p3:(EQ s315 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][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-08 finished in 2870 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(F(p0))||F(((p1&&X(F(p2)))||G(F(p2)))))))'
Support contains 3 out of 685 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 676 transition count 787
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 676 transition count 787
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 669 transition count 780
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 669 transition count 780
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 669 transition count 779
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 664 transition count 774
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 664 transition count 774
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 659 transition count 769
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 659 transition count 769
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 655 transition count 765
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 655 transition count 765
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 651 transition count 761
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 651 transition count 761
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 647 transition count 757
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 647 transition count 757
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 643 transition count 753
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 643 transition count 753
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 643 transition count 752
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 641 transition count 750
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 641 transition count 750
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 639 transition count 748
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 639 transition count 748
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 637 transition count 746
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 637 transition count 746
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 635 transition count 744
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 635 transition count 744
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 633 transition count 742
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 633 transition count 742
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 631 transition count 740
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 631 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 629 transition count 738
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 629 transition count 738
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 627 transition count 736
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 627 transition count 736
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 625 transition count 734
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 625 transition count 734
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 623 transition count 732
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 623 transition count 732
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 621 transition count 730
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 621 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 619 transition count 728
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 619 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 619 transition count 727
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 618 transition count 726
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 618 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 618 transition count 725
Applied a total of 138 rules in 467 ms. Remains 618 /685 variables (removed 67) and now considering 725/796 (removed 71) transitions.
// Phase 1: matrix 725 rows 618 cols
[2023-03-20 16:30:16] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-20 16:30:17] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-20 16:30:17] [INFO ] Invariant cache hit.
[2023-03-20 16:30:17] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2023-03-20 16:30:17] [INFO ] Invariant cache hit.
[2023-03-20 16:30:18] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 618/685 places, 725/796 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2073 ms. Remains : 618/685 places, 725/796 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s514 1), p1:(NEQ s542 1), p0:(EQ s346 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 846 ms.
Product exploration explored 100000 steps with 33333 reset in 500 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (OR (NOT p2) p1)), (X p1), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))))))
Knowledge based reduction with 6 factoid took 133 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLFireability-09 finished in 3803 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) U p1)||X(F(p2)))))'
Support contains 3 out of 685 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 676 transition count 787
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 676 transition count 787
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 669 transition count 780
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 669 transition count 780
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 669 transition count 779
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 664 transition count 774
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 664 transition count 774
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 659 transition count 769
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 659 transition count 769
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 656 transition count 766
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 656 transition count 766
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 653 transition count 763
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 653 transition count 763
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 650 transition count 760
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 650 transition count 760
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 647 transition count 757
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 647 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 647 transition count 756
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 645 transition count 754
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 645 transition count 754
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 643 transition count 752
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 643 transition count 752
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 641 transition count 750
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 641 transition count 750
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 639 transition count 748
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 639 transition count 748
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 637 transition count 746
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 637 transition count 746
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 635 transition count 744
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 635 transition count 744
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 633 transition count 742
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 633 transition count 742
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 631 transition count 740
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 631 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 629 transition count 738
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 629 transition count 738
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 627 transition count 736
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 627 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 627 transition count 735
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 626 transition count 734
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 626 transition count 734
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 625 transition count 733
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 625 transition count 733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 625 transition count 732
Applied a total of 124 rules in 302 ms. Remains 625 /685 variables (removed 60) and now considering 732/796 (removed 64) transitions.
// Phase 1: matrix 732 rows 625 cols
[2023-03-20 16:30:20] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 16:30:20] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-20 16:30:20] [INFO ] Invariant cache hit.
[2023-03-20 16:30:21] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2023-03-20 16:30:21] [INFO ] Invariant cache hit.
[2023-03-20 16:30:21] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 625/685 places, 732/796 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1662 ms. Remains : 625/685 places, 732/796 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s540 1), p2:(EQ s265 1), p1:(EQ s143 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 119 steps with 1 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-11 finished in 1903 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(G(p1)))))'
Support contains 2 out of 685 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Graph (trivial) has 675 edges and 685 vertex of which 51 / 685 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 472 transitions
Trivial Post-agglo rules discarded 472 transitions
Performed 472 trivial Post agglomeration. Transition count delta: 472
Iterating post reduction 0 with 472 rules applied. Total rules applied 473 place count 642 transition count 276
Reduce places removed 472 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 481 rules applied. Total rules applied 954 place count 170 transition count 267
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 959 place count 166 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 960 place count 165 transition count 266
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 960 place count 165 transition count 228
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1036 place count 127 transition count 228
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1043 place count 120 transition count 221
Iterating global reduction 4 with 7 rules applied. Total rules applied 1050 place count 120 transition count 221
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1053 place count 117 transition count 218
Iterating global reduction 4 with 3 rules applied. Total rules applied 1056 place count 117 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1057 place count 116 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 1058 place count 116 transition count 217
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1059 place count 115 transition count 216
Iterating global reduction 4 with 1 rules applied. Total rules applied 1060 place count 115 transition count 216
Performed 23 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1106 place count 92 transition count 190
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1123 place count 75 transition count 139
Iterating global reduction 4 with 17 rules applied. Total rules applied 1140 place count 75 transition count 139
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1149 place count 75 transition count 130
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1158 place count 66 transition count 119
Iterating global reduction 5 with 9 rules applied. Total rules applied 1167 place count 66 transition count 119
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1176 place count 57 transition count 108
Iterating global reduction 5 with 9 rules applied. Total rules applied 1185 place count 57 transition count 108
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1190 place count 57 transition count 103
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1206 place count 49 transition count 112
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1207 place count 48 transition count 104
Iterating global reduction 6 with 1 rules applied. Total rules applied 1208 place count 48 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1209 place count 48 transition count 103
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1213 place count 48 transition count 99
Applied a total of 1213 rules in 45 ms. Remains 48 /685 variables (removed 637) and now considering 99/796 (removed 697) transitions.
[2023-03-20 16:30:22] [INFO ] Flow matrix only has 94 transitions (discarded 5 similar events)
// Phase 1: matrix 94 rows 48 cols
[2023-03-20 16:30:22] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 16:30:22] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-20 16:30:22] [INFO ] Flow matrix only has 94 transitions (discarded 5 similar events)
[2023-03-20 16:30:22] [INFO ] Invariant cache hit.
[2023-03-20 16:30:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-20 16:30:22] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-20 16:30:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 16:30:22] [INFO ] Flow matrix only has 94 transitions (discarded 5 similar events)
[2023-03-20 16:30:22] [INFO ] Invariant cache hit.
[2023-03-20 16:30:22] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/685 places, 99/796 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 48/685 places, 99/796 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-13 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s18 1), p1:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-13 finished in 483 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((X(p1)&&p0))||(G(p2)&&X(p3))))'
Support contains 3 out of 685 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 685/685 places, 796/796 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 676 transition count 787
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 676 transition count 787
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 668 transition count 779
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 668 transition count 779
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 668 transition count 778
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 662 transition count 772
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 662 transition count 772
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 656 transition count 766
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 656 transition count 766
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 652 transition count 762
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 652 transition count 762
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 648 transition count 758
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 648 transition count 758
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 644 transition count 754
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 644 transition count 754
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 640 transition count 750
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 640 transition count 750
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 640 transition count 749
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 638 transition count 747
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 638 transition count 747
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 636 transition count 745
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 636 transition count 745
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 634 transition count 743
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 634 transition count 743
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 632 transition count 741
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 632 transition count 741
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 630 transition count 739
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 630 transition count 739
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 628 transition count 737
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 628 transition count 737
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 626 transition count 735
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 626 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 624 transition count 733
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 624 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 622 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 622 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 620 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 620 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 620 transition count 728
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 619 transition count 727
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 619 transition count 727
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 618 transition count 726
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 618 transition count 726
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 617 transition count 725
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 617 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 617 transition count 724
Applied a total of 140 rules in 506 ms. Remains 617 /685 variables (removed 68) and now considering 724/796 (removed 72) transitions.
// Phase 1: matrix 724 rows 617 cols
[2023-03-20 16:30:23] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-20 16:30:23] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-20 16:30:23] [INFO ] Invariant cache hit.
[2023-03-20 16:30:24] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-20 16:30:24] [INFO ] Invariant cache hit.
[2023-03-20 16:30:24] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 617/685 places, 724/796 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2200 ms. Remains : 617/685 places, 724/796 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p3), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2 p3 p1), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p0) p2 p3) (AND p2 p3 (NOT p1))), acceptance={} source=3 dest: 5}, { cond=(OR (AND p0 (NOT p2) p1) (AND p0 (NOT p3) p1)), acceptance={} source=3 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s530 0) (EQ s30 1)), p2:(EQ s530 0), p3:(EQ s30 1), p1:(EQ s366 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-14 finished in 2526 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&&G(p1)))||X((G(p2) U p3))))'
[2023-03-20 16:30:25] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13332585390565867196
[2023-03-20 16:30:25] [INFO ] Computing symmetric may disable matrix : 796 transitions.
[2023-03-20 16:30:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 16:30:25] [INFO ] Computing symmetric may enable matrix : 796 transitions.
[2023-03-20 16:30:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 16:30:25] [INFO ] Applying decomposition
[2023-03-20 16:30:25] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13136102568377902726.txt' '-o' '/tmp/graph13136102568377902726.bin' '-w' '/tmp/graph13136102568377902726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13136102568377902726.bin' '-l' '-1' '-v' '-w' '/tmp/graph13136102568377902726.weights' '-q' '0' '-e' '0.001'
[2023-03-20 16:30:25] [INFO ] Decomposing Gal with order
[2023-03-20 16:30:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 16:30:25] [INFO ] Computing Do-Not-Accords matrix : 796 transitions.
[2023-03-20 16:30:25] [INFO ] Removed a total of 398 redundant transitions.
[2023-03-20 16:30:25] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 16:30:25] [INFO ] Flatten gal took : 71 ms
[2023-03-20 16:30:25] [INFO ] Built C files in 289ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13332585390565867196
Running compilation step : cd /tmp/ltsmin13332585390565867196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
[2023-03-20 16:30:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2023-03-20 16:30:25] [INFO ] Time to serialize gal into /tmp/LTLFireability16521543711250441767.gal : 10 ms
[2023-03-20 16:30:25] [INFO ] Time to serialize properties into /tmp/LTLFireability10114358475155924655.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16521543711250441767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10114358475155924655.ltl' '-c' '-stutter-deadlock'

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...278
Read 1 LTL properties
Checking formula 0 : !(((F(("(i20.u195.p691==0)")&&(G("((i25.u238.p836==0)||(i30.u257.p926==0))"))))||(X((G("((i25.u238.p836==1)&&(i30.u257.p926==1))"))U("...179
Formula 0 simplified : G(!"(i20.u195.p691==0)" | F!"((i25.u238.p836==0)||(i30.u257.p926==0))") & X(F!"((i25.u238.p836==1)&&(i30.u257.p926==1))" R !"(i20.u1...168
Compilation finished in 3386 ms.
Running link step : cd /tmp/ltsmin13332585390565867196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin13332585390565867196;'/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' '--ltl' '(<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))||X(([]((LTLAPp2==true)) U (LTLAPp3==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t70, t119, t175, t229, t266, t369, t422, t423, t425, t458, t562, t616, t618, t634, t641, t642...586
Computing Next relation with stutter on 9478 deadlock states
77 unique states visited
77 strongly connected components in search stack
77 transitions explored
77 items max in DFS search stack
7724 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,77.3606,1841664,1,0,2.85348e+06,974,8147,1.19524e+07,307,4507,5947949
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyCommit-PT-02b-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 381119 ms.

BK_STOP 1679330025840

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-02b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645400404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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