Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 248K Jun 2 16:33 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 CO4-PT-17-LTLFireability-00
FORMULA_NAME CO4-PT-17-LTLFireability-01
FORMULA_NAME CO4-PT-17-LTLFireability-02
FORMULA_NAME CO4-PT-17-LTLFireability-03
FORMULA_NAME CO4-PT-17-LTLFireability-04
FORMULA_NAME CO4-PT-17-LTLFireability-05
FORMULA_NAME CO4-PT-17-LTLFireability-06
FORMULA_NAME CO4-PT-17-LTLFireability-07
FORMULA_NAME CO4-PT-17-LTLFireability-08
FORMULA_NAME CO4-PT-17-LTLFireability-09
FORMULA_NAME CO4-PT-17-LTLFireability-10
FORMULA_NAME CO4-PT-17-LTLFireability-11
FORMULA_NAME CO4-PT-17-LTLFireability-12
FORMULA_NAME CO4-PT-17-LTLFireability-13
FORMULA_NAME CO4-PT-17-LTLFireability-14
FORMULA_NAME CO4-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368793006

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-17
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:53:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:53:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:53:14] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-06-02 22:53:14] [INFO ] Transformed 967 places.
[2024-06-02 22:53:14] [INFO ] Transformed 1150 transitions.
[2024-06-02 22:53:14] [INFO ] Found NUPN structural information;
[2024-06-02 22:53:14] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 198 places in 10 ms
Reduce places removed 198 places and 238 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-17-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 750 transition count 911
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 180 place count 590 transition count 751
Iterating global reduction 1 with 160 rules applied. Total rules applied 340 place count 590 transition count 751
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 347 place count 590 transition count 744
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 431 place count 506 transition count 660
Iterating global reduction 2 with 84 rules applied. Total rules applied 515 place count 506 transition count 660
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 530 place count 491 transition count 643
Iterating global reduction 2 with 15 rules applied. Total rules applied 545 place count 491 transition count 643
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 548 place count 491 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 550 place count 489 transition count 638
Iterating global reduction 3 with 2 rules applied. Total rules applied 552 place count 489 transition count 638
Applied a total of 552 rules in 153 ms. Remains 489 /769 variables (removed 280) and now considering 638/912 (removed 274) transitions.
// Phase 1: matrix 638 rows 489 cols
[2024-06-02 22:53:15] [INFO ] Computed 5 invariants in 25 ms
[2024-06-02 22:53:15] [INFO ] Implicit Places using invariants in 258 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 287 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/769 places, 638/912 transitions.
Applied a total of 0 rules in 22 ms. Remains 488 /488 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 462 ms. Remains : 488/769 places, 638/912 transitions.
Support contains 26 out of 488 places after structural reductions.
[2024-06-02 22:53:15] [INFO ] Flatten gal took : 62 ms
[2024-06-02 22:53:15] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:53:15] [INFO ] Input system was already deterministic with 638 transitions.
Support contains 25 out of 488 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 638 rows 488 cols
[2024-06-02 22:53:16] [INFO ] Computed 4 invariants in 17 ms
[2024-06-02 22:53:16] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-06-02 22:53:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 22:53:17] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2024-06-02 22:53:17] [INFO ] After 1052ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 304 ms.
[2024-06-02 22:53:18] [INFO ] After 1673ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 10 properties in 73 ms.
Support contains 5 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 638/638 transitions.
Graph (trivial) has 522 edges and 488 vertex of which 2 / 488 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 825 edges and 487 vertex of which 466 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 466 transition count 434
Reduce places removed 166 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 171 rules applied. Total rules applied 357 place count 300 transition count 429
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 363 place count 295 transition count 428
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 363 place count 295 transition count 368
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 483 place count 235 transition count 368
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 487 place count 231 transition count 364
Iterating global reduction 3 with 4 rules applied. Total rules applied 491 place count 231 transition count 364
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 491 place count 231 transition count 362
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 495 place count 229 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 497 place count 227 transition count 360
Iterating global reduction 3 with 2 rules applied. Total rules applied 499 place count 227 transition count 360
Performed 79 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 657 place count 148 transition count 263
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 663 place count 148 transition count 257
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 670 place count 141 transition count 250
Iterating global reduction 4 with 7 rules applied. Total rules applied 677 place count 141 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 678 place count 141 transition count 249
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 5 with 6 rules applied. Total rules applied 684 place count 138 transition count 246
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 770 place count 95 transition count 249
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 797 place count 95 transition count 222
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 835 place count 57 transition count 146
Iterating global reduction 6 with 38 rules applied. Total rules applied 873 place count 57 transition count 146
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 899 place count 57 transition count 120
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 909 place count 47 transition count 91
Iterating global reduction 7 with 10 rules applied. Total rules applied 919 place count 47 transition count 91
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 926 place count 47 transition count 84
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 928 place count 47 transition count 82
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 933 place count 47 transition count 77
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 941 place count 42 transition count 74
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 943 place count 42 transition count 74
Graph (complete) has 136 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 944 place count 41 transition count 74
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 945 place count 41 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 946 place count 41 transition count 73
Graph (complete) has 133 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 947 place count 40 transition count 73
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 948 place count 40 transition count 72
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 949 place count 40 transition count 72
Graph (complete) has 130 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 950 place count 39 transition count 72
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 951 place count 39 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 952 place count 38 transition count 70
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t50.t556.t47 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 27 edges and 34 vertex of which 3 / 34 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 15 with 3 rules applied. Total rules applied 955 place count 32 transition count 68
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 960 place count 32 transition count 63
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 961 place count 31 transition count 61
Iterating global reduction 17 with 1 rules applied. Total rules applied 962 place count 31 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 963 place count 31 transition count 60
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 18 with 10 rules applied. Total rules applied 973 place count 31 transition count 50
Discarding 6 places :
Symmetric choice reduction at 18 with 6 rule applications. Total rules 979 place count 25 transition count 44
Iterating global reduction 18 with 6 rules applied. Total rules applied 985 place count 25 transition count 44
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 991 place count 25 transition count 38
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 994 place count 22 transition count 35
Iterating global reduction 19 with 3 rules applied. Total rules applied 997 place count 22 transition count 35
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 1000 place count 22 transition count 32
Free-agglomeration rule applied 3 times.
Iterating global reduction 20 with 3 rules applied. Total rules applied 1003 place count 22 transition count 29
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1006 place count 19 transition count 29
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 21 with 5 rules applied. Total rules applied 1011 place count 19 transition count 29
Applied a total of 1011 rules in 134 ms. Remains 19 /488 variables (removed 469) and now considering 29/638 (removed 609) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 19/488 places, 29/638 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-17-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 827 edges and 488 vertex of which 482 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 479 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 479 transition count 629
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 479 transition count 627
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 475 transition count 622
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 475 transition count 622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 473 transition count 620
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 473 transition count 620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 472 transition count 619
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 472 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 472 transition count 618
Applied a total of 35 rules in 45 ms. Remains 472 /488 variables (removed 16) and now considering 618/638 (removed 20) transitions.
// Phase 1: matrix 618 rows 472 cols
[2024-06-02 22:53:18] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:53:18] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-02 22:53:18] [INFO ] Invariant cache hit.
[2024-06-02 22:53:19] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-06-02 22:53:19] [INFO ] Invariant cache hit.
[2024-06-02 22:53:19] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/488 places, 618/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 773 ms. Remains : 472/488 places, 618/638 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-00 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:(EQ s426 0)], 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 29 reset in 230 ms.
Product exploration explored 100000 steps with 2 reset in 122 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 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 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 15888 steps, run visited all 1 properties in 105 ms. (steps per millisecond=151 )
Probabilistic random walk after 15888 steps, saw 4031 distinct states, run finished after 106 ms. (steps per millisecond=149 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 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 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 618/618 transitions.
Applied a total of 0 rules in 10 ms. Remains 472 /472 variables (removed 0) and now considering 618/618 (removed 0) transitions.
[2024-06-02 22:53:20] [INFO ] Invariant cache hit.
[2024-06-02 22:53:20] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 22:53:20] [INFO ] Invariant cache hit.
[2024-06-02 22:53:21] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-06-02 22:53:21] [INFO ] Invariant cache hit.
[2024-06-02 22:53:21] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 472/472 places, 618/618 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 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 206 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished Best-First random walk after 2058 steps, including 10 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1029 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 94 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 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17 reset in 81 ms.
Product exploration explored 100000 steps with 10 reset in 99 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 618/618 transitions.
Graph (trivial) has 517 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 802 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 468 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 167 place count 468 transition count 612
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 167 place count 468 transition count 673
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 231 place count 468 transition count 673
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 264 place count 435 transition count 640
Deduced a syphon composed of 194 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 297 place count 435 transition count 640
Performed 56 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 353 place count 435 transition count 712
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 361 place count 435 transition count 704
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 387 place count 409 transition count 672
Deduced a syphon composed of 231 places in 1 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 413 place count 409 transition count 672
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 415 place count 407 transition count 669
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 417 place count 407 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 407 transition count 668
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 419 place count 406 transition count 667
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 420 place count 406 transition count 667
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 421 place count 406 transition count 667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 422 place count 406 transition count 666
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 424 place count 404 transition count 664
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 426 place count 404 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 427 place count 404 transition count 664
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 428 place count 403 transition count 663
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 429 place count 403 transition count 663
Performed 74 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 5 with 74 rules applied. Total rules applied 503 place count 403 transition count 971
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 5 with 71 rules applied. Total rules applied 574 place count 403 transition count 900
Discarding 156 places :
Symmetric choice reduction at 6 with 156 rule applications. Total rules 730 place count 247 transition count 546
Deduced a syphon composed of 186 places in 1 ms
Iterating global reduction 6 with 156 rules applied. Total rules applied 886 place count 247 transition count 546
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 6 with 49 rules applied. Total rules applied 935 place count 247 transition count 497
Discarding 101 places :
Symmetric choice reduction at 7 with 101 rule applications. Total rules 1036 place count 146 transition count 315
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 7 with 101 rules applied. Total rules applied 1137 place count 146 transition count 315
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1147 place count 146 transition count 305
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1167 place count 126 transition count 265
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1187 place count 126 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1189 place count 126 transition count 315
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1203 place count 126 transition count 301
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1209 place count 120 transition count 265
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 6 rules applied. Total rules applied 1215 place count 120 transition count 265
Deduced a syphon composed of 71 places in 0 ms
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1226 place count 120 transition count 254
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1227 place count 119 transition count 253
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1228 place count 119 transition count 253
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1229 place count 119 transition count 274
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1230 place count 118 transition count 266
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1231 place count 118 transition count 266
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 1231 rules in 178 ms. Remains 118 /472 variables (removed 354) and now considering 266/618 (removed 352) transitions.
[2024-06-02 22:53:22] [INFO ] Redundant transitions in 20 ms returned []
[2024-06-02 22:53:22] [INFO ] Flow matrix only has 258 transitions (discarded 8 similar events)
// Phase 1: matrix 258 rows 118 cols
[2024-06-02 22:53:22] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:53:22] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/472 places, 266/618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 118/472 places, 266/618 transitions.
Built C files in :
/tmp/ltsmin7152076054414364304
[2024-06-02 22:53:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7152076054414364304
Running compilation step : cd /tmp/ltsmin7152076054414364304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 982 ms.
Running link step : cd /tmp/ltsmin7152076054414364304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7152076054414364304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3156199814844812575.hoa' '--buchi-type=spotba'
LTSmin run took 2273 ms.
FORMULA CO4-PT-17-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-00 finished in 7599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((G(p1)||p0))))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 479 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 479 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 479 transition count 628
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 475 transition count 623
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 475 transition count 623
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 473 transition count 621
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 473 transition count 621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 472 transition count 620
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 472 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 472 transition count 619
Applied a total of 34 rules in 57 ms. Remains 472 /488 variables (removed 16) and now considering 619/638 (removed 19) transitions.
// Phase 1: matrix 619 rows 472 cols
[2024-06-02 22:53:26] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 22:53:26] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 22:53:26] [INFO ] Invariant cache hit.
[2024-06-02 22:53:26] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-06-02 22:53:26] [INFO ] Invariant cache hit.
[2024-06-02 22:53:26] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/488 places, 619/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 660 ms. Remains : 472/488 places, 619/638 transitions.
Stuttering acceptance computed with spot in 353 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(EQ s444 1), p0:(OR (EQ s269 1) (EQ s73 0))], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 102 ms.
Product exploration explored 100000 steps with 52 reset in 197 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 804 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 892290 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{0=1}
Probabilistic random walk after 892290 steps, saw 161882 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :1
Running SMT prover for 3 properties.
[2024-06-02 22:53:31] [INFO ] Invariant cache hit.
[2024-06-02 22:53:31] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:53:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:31] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 22:53:31] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-06-02 22:53:31] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 2 ms.
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 619/619 transitions.
Graph (trivial) has 512 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 802 edges and 471 vertex of which 450 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 180 rules applied. Total rules applied 182 place count 450 transition count 419
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 166 rules applied. Total rules applied 348 place count 288 transition count 415
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 351 place count 285 transition count 415
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 351 place count 285 transition count 350
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 481 place count 220 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 482 place count 219 transition count 349
Iterating global reduction 3 with 1 rules applied. Total rules applied 483 place count 219 transition count 349
Performed 75 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 633 place count 144 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 640 place count 144 transition count 251
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 647 place count 137 transition count 244
Iterating global reduction 4 with 7 rules applied. Total rules applied 654 place count 137 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 655 place count 137 transition count 243
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 5 with 6 rules applied. Total rules applied 661 place count 134 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 662 place count 134 transition count 239
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 746 place count 92 transition count 242
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 773 place count 92 transition count 215
Discarding 38 places :
Symmetric choice reduction at 7 with 38 rule applications. Total rules 811 place count 54 transition count 139
Iterating global reduction 7 with 38 rules applied. Total rules applied 849 place count 54 transition count 139
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 875 place count 54 transition count 113
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 884 place count 45 transition count 87
Iterating global reduction 8 with 9 rules applied. Total rules applied 893 place count 45 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 899 place count 45 transition count 81
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 900 place count 45 transition count 80
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 905 place count 45 transition count 75
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 913 place count 40 transition count 72
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 916 place count 40 transition count 72
Graph (complete) has 134 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 917 place count 39 transition count 72
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 918 place count 39 transition count 71
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 919 place count 39 transition count 70
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 920 place count 39 transition count 70
Graph (complete) has 131 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 921 place count 38 transition count 70
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 922 place count 38 transition count 69
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 923 place count 38 transition count 69
Graph (complete) has 128 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 924 place count 37 transition count 69
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 925 place count 37 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 926 place count 36 transition count 67
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t50.t556 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 32 vertex of which 3 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 16 with 3 rules applied. Total rules applied 929 place count 30 transition count 65
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 934 place count 30 transition count 60
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 935 place count 29 transition count 58
Iterating global reduction 18 with 1 rules applied. Total rules applied 936 place count 29 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 937 place count 29 transition count 57
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 19 with 11 rules applied. Total rules applied 948 place count 29 transition count 46
Discarding 6 places :
Symmetric choice reduction at 19 with 6 rule applications. Total rules 954 place count 23 transition count 40
Iterating global reduction 19 with 6 rules applied. Total rules applied 960 place count 23 transition count 40
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 966 place count 23 transition count 34
Discarding 3 places :
Symmetric choice reduction at 20 with 3 rule applications. Total rules 969 place count 20 transition count 31
Iterating global reduction 20 with 3 rules applied. Total rules applied 972 place count 20 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 975 place count 20 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 21 with 4 rules applied. Total rules applied 979 place count 20 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 983 place count 16 transition count 24
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 22 with 4 rules applied. Total rules applied 987 place count 16 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 988 place count 16 transition count 23
Applied a total of 988 rules in 85 ms. Remains 16 /472 variables (removed 456) and now considering 23/619 (removed 596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 16/472 places, 23/619 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 175 steps, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Probabilistic random walk after 175 steps, saw 73 distinct states, run finished after 4 ms. (steps per millisecond=43 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 284 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 619/619 transitions.
Applied a total of 0 rules in 11 ms. Remains 472 /472 variables (removed 0) and now considering 619/619 (removed 0) transitions.
[2024-06-02 22:53:32] [INFO ] Invariant cache hit.
[2024-06-02 22:53:32] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 22:53:32] [INFO ] Invariant cache hit.
[2024-06-02 22:53:33] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-06-02 22:53:33] [INFO ] Invariant cache hit.
[2024-06-02 22:53:33] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 623 ms. Remains : 472/472 places, 619/619 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 804 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 814141 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{0=1}
Probabilistic random walk after 814141 steps, saw 150393 distinct states, run finished after 3001 ms. (steps per millisecond=271 ) properties seen :1
Running SMT prover for 3 properties.
[2024-06-02 22:53:37] [INFO ] Invariant cache hit.
[2024-06-02 22:53:37] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:53:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:37] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 22:53:37] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-06-02 22:53:37] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 2 ms.
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 619/619 transitions.
Graph (trivial) has 512 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 802 edges and 471 vertex of which 450 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 180 rules applied. Total rules applied 182 place count 450 transition count 419
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 166 rules applied. Total rules applied 348 place count 288 transition count 415
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 351 place count 285 transition count 415
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 351 place count 285 transition count 350
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 481 place count 220 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 482 place count 219 transition count 349
Iterating global reduction 3 with 1 rules applied. Total rules applied 483 place count 219 transition count 349
Performed 75 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 633 place count 144 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 640 place count 144 transition count 251
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 647 place count 137 transition count 244
Iterating global reduction 4 with 7 rules applied. Total rules applied 654 place count 137 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 655 place count 137 transition count 243
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 5 with 6 rules applied. Total rules applied 661 place count 134 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 662 place count 134 transition count 239
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 746 place count 92 transition count 242
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 773 place count 92 transition count 215
Discarding 38 places :
Symmetric choice reduction at 7 with 38 rule applications. Total rules 811 place count 54 transition count 139
Iterating global reduction 7 with 38 rules applied. Total rules applied 849 place count 54 transition count 139
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 875 place count 54 transition count 113
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 884 place count 45 transition count 87
Iterating global reduction 8 with 9 rules applied. Total rules applied 893 place count 45 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 899 place count 45 transition count 81
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 900 place count 45 transition count 80
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 905 place count 45 transition count 75
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 913 place count 40 transition count 72
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 916 place count 40 transition count 72
Graph (complete) has 134 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 917 place count 39 transition count 72
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 918 place count 39 transition count 71
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 919 place count 39 transition count 70
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 920 place count 39 transition count 70
Graph (complete) has 131 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 921 place count 38 transition count 70
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 922 place count 38 transition count 69
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 923 place count 38 transition count 69
Graph (complete) has 128 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 924 place count 37 transition count 69
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 925 place count 37 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 926 place count 36 transition count 67
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t50.t556 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 32 vertex of which 3 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 16 with 3 rules applied. Total rules applied 929 place count 30 transition count 65
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 934 place count 30 transition count 60
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 935 place count 29 transition count 58
Iterating global reduction 18 with 1 rules applied. Total rules applied 936 place count 29 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 937 place count 29 transition count 57
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 19 with 11 rules applied. Total rules applied 948 place count 29 transition count 46
Discarding 6 places :
Symmetric choice reduction at 19 with 6 rule applications. Total rules 954 place count 23 transition count 40
Iterating global reduction 19 with 6 rules applied. Total rules applied 960 place count 23 transition count 40
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 966 place count 23 transition count 34
Discarding 3 places :
Symmetric choice reduction at 20 with 3 rule applications. Total rules 969 place count 20 transition count 31
Iterating global reduction 20 with 3 rules applied. Total rules applied 972 place count 20 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 975 place count 20 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 21 with 4 rules applied. Total rules applied 979 place count 20 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 983 place count 16 transition count 24
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 22 with 4 rules applied. Total rules applied 987 place count 16 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 988 place count 16 transition count 23
Applied a total of 988 rules in 50 ms. Remains 16 /472 variables (removed 456) and now considering 23/619 (removed 596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 16/472 places, 23/619 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 175 steps, run visited all 1 properties in 3 ms. (steps per millisecond=58 )
Probabilistic random walk after 175 steps, saw 73 distinct states, run finished after 3 ms. (steps per millisecond=58 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 10 reset in 112 ms.
Product exploration explored 100000 steps with 5 reset in 144 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 619/619 transitions.
Graph (trivial) has 512 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 803 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 468 transition count 614
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 167 place count 468 transition count 613
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 167 place count 468 transition count 673
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 230 place count 468 transition count 673
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 263 place count 435 transition count 640
Deduced a syphon composed of 193 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 296 place count 435 transition count 640
Performed 55 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 351 place count 435 transition count 712
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 359 place count 435 transition count 704
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 385 place count 409 transition count 672
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 411 place count 409 transition count 672
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 413 place count 407 transition count 669
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 415 place count 407 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 416 place count 407 transition count 668
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 417 place count 406 transition count 667
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 418 place count 406 transition count 667
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 406 transition count 667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 420 place count 406 transition count 666
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 422 place count 404 transition count 664
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 424 place count 404 transition count 664
Performed 73 Post agglomeration using F-continuation condition with reduction of 35 identical transitions.
Deduced a syphon composed of 299 places in 0 ms
Iterating global reduction 5 with 73 rules applied. Total rules applied 497 place count 404 transition count 968
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 5 with 71 rules applied. Total rules applied 568 place count 404 transition count 897
Discarding 151 places :
Symmetric choice reduction at 6 with 151 rule applications. Total rules 719 place count 253 transition count 554
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 6 with 151 rules applied. Total rules applied 870 place count 253 transition count 554
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 6 with 50 rules applied. Total rules applied 920 place count 253 transition count 504
Discarding 98 places :
Symmetric choice reduction at 7 with 98 rule applications. Total rules 1018 place count 155 transition count 328
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 7 with 98 rules applied. Total rules applied 1116 place count 155 transition count 328
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1124 place count 155 transition count 320
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 1142 place count 137 transition count 284
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 18 rules applied. Total rules applied 1160 place count 137 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1161 place count 137 transition count 309
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1168 place count 137 transition count 302
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1171 place count 134 transition count 284
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1174 place count 134 transition count 284
Deduced a syphon composed of 78 places in 0 ms
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1189 place count 134 transition count 269
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1191 place count 132 transition count 267
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1193 place count 132 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1195 place count 132 transition count 312
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1198 place count 129 transition count 290
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1201 place count 129 transition count 290
Deduced a syphon composed of 75 places in 1 ms
Applied a total of 1201 rules in 96 ms. Remains 129 /472 variables (removed 343) and now considering 290/619 (removed 329) transitions.
[2024-06-02 22:53:39] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:53:39] [INFO ] Flow matrix only has 283 transitions (discarded 7 similar events)
// Phase 1: matrix 283 rows 129 cols
[2024-06-02 22:53:39] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:53:39] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/472 places, 290/619 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 129/472 places, 290/619 transitions.
Built C files in :
/tmp/ltsmin14003047410459935157
[2024-06-02 22:53:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14003047410459935157
Running compilation step : cd /tmp/ltsmin14003047410459935157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 821 ms.
Running link step : cd /tmp/ltsmin14003047410459935157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14003047410459935157;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16683912431981793682.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 619/619 transitions.
Applied a total of 0 rules in 15 ms. Remains 472 /472 variables (removed 0) and now considering 619/619 (removed 0) transitions.
// Phase 1: matrix 619 rows 472 cols
[2024-06-02 22:53:54] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 22:53:54] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 22:53:54] [INFO ] Invariant cache hit.
[2024-06-02 22:53:54] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-06-02 22:53:54] [INFO ] Invariant cache hit.
[2024-06-02 22:53:55] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 611 ms. Remains : 472/472 places, 619/619 transitions.
Built C files in :
/tmp/ltsmin9795861497198682077
[2024-06-02 22:53:55] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9795861497198682077
Running compilation step : cd /tmp/ltsmin9795861497198682077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 889 ms.
Running link step : cd /tmp/ltsmin9795861497198682077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9795861497198682077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10757370923895227121.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:54:10] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:54:10] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:54:10] [INFO ] Time to serialize gal into /tmp/LTL10689699927683310007.gal : 6 ms
[2024-06-02 22:54:10] [INFO ] Time to serialize properties into /tmp/LTL9196924853084947646.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10689699927683310007.gal' '-t' 'CGAL' '-hoa' '/tmp/aut308852223057119188.hoa' '-atoms' '/tmp/LTL9196924853084947646.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9196924853084947646.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut308852223057119188.hoa
Detected timeout of ITS tools.
[2024-06-02 22:54:25] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:54:25] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:54:25] [INFO ] Time to serialize gal into /tmp/LTL616808403937869705.gal : 4 ms
[2024-06-02 22:54:25] [INFO ] Time to serialize properties into /tmp/LTL6255418763965235138.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL616808403937869705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6255418763965235138.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((p614==1)||(p210==0))")||(G("(p898==1)"))))))))
Formula 0 simplified : XXXF(!"((p614==1)||(p210==0))" & F!"(p898==1)")
Detected timeout of ITS tools.
[2024-06-02 22:54:40] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:54:40] [INFO ] Applying decomposition
[2024-06-02 22:54:40] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3166936764875381320.txt' '-o' '/tmp/graph3166936764875381320.bin' '-w' '/tmp/graph3166936764875381320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3166936764875381320.bin' '-l' '-1' '-v' '-w' '/tmp/graph3166936764875381320.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:54:40] [INFO ] Decomposing Gal with order
[2024-06-02 22:54:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:54:40] [INFO ] Removed a total of 203 redundant transitions.
[2024-06-02 22:54:40] [INFO ] Flatten gal took : 88 ms
[2024-06-02 22:54:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 31 ms.
[2024-06-02 22:54:40] [INFO ] Time to serialize gal into /tmp/LTL5052556627001021407.gal : 8 ms
[2024-06-02 22:54:40] [INFO ] Time to serialize properties into /tmp/LTL17998072428539868643.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5052556627001021407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17998072428539868643.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G(("((i17.u87.p614==1)||(i1.u22.p210==0))")||(G("(i18.u154.p898==1)"))))))))
Formula 0 simplified : XXXF(!"((i17.u87.p614==1)||(i1.u22.p210==0))" & F!"(i18.u154.p898==1)")
Reverse transition relation is NOT exact ! Due to transitions t18, t49, t82, t207, t224, t241, t258, t333, t339, t365, t384, t556, i0.t472, i0.t464, i0.u9....761
Computing Next relation with stutter on 391679 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
88 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,0.942111,57720,1,0,82456,1879,6945,185164,532,7398,202616
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-17-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CO4-PT-17-LTLFireability-02 finished in 75620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Graph (trivial) has 527 edges and 488 vertex of which 2 / 488 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 826 edges and 487 vertex of which 481 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 166 rules applied. Total rules applied 168 place count 480 transition count 463
Reduce places removed 165 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 170 rules applied. Total rules applied 338 place count 315 transition count 458
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 345 place count 310 transition count 456
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 345 place count 310 transition count 395
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 467 place count 249 transition count 395
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 471 place count 245 transition count 391
Iterating global reduction 3 with 4 rules applied. Total rules applied 475 place count 245 transition count 391
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 475 place count 245 transition count 388
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 481 place count 242 transition count 388
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 483 place count 240 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 485 place count 240 transition count 386
Performed 85 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 655 place count 155 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 661 place count 155 transition count 273
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 668 place count 148 transition count 266
Iterating global reduction 4 with 7 rules applied. Total rules applied 675 place count 148 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 676 place count 148 transition count 265
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 5 with 6 rules applied. Total rules applied 682 place count 145 transition count 262
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 772 place count 100 transition count 265
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 802 place count 100 transition count 235
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 842 place count 60 transition count 155
Iterating global reduction 6 with 40 rules applied. Total rules applied 882 place count 60 transition count 155
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 909 place count 60 transition count 128
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 919 place count 50 transition count 99
Iterating global reduction 7 with 10 rules applied. Total rules applied 929 place count 50 transition count 99
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 936 place count 50 transition count 92
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 939 place count 50 transition count 89
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 940 place count 50 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 942 place count 48 transition count 87
Applied a total of 942 rules in 56 ms. Remains 48 /488 variables (removed 440) and now considering 87/638 (removed 551) transitions.
[2024-06-02 22:54:41] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
// Phase 1: matrix 80 rows 48 cols
[2024-06-02 22:54:41] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:54:42] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 22:54:42] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2024-06-02 22:54:42] [INFO ] Invariant cache hit.
[2024-06-02 22:54:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:54:42] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-06-02 22:54:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:54:42] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2024-06-02 22:54:42] [INFO ] Invariant cache hit.
[2024-06-02 22:54:42] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/488 places, 87/638 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 48/488 places, 87/638 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-17-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s33 1), p1:(OR (EQ s35 1) (EQ s33 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-03 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!((p0 U p1) U p2) U p0)))'
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 478 transition count 628
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 478 transition count 628
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 478 transition count 626
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 474 transition count 621
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 474 transition count 621
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 472 transition count 619
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 472 transition count 619
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 471 transition count 618
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 471 transition count 617
Applied a total of 37 rules in 36 ms. Remains 471 /488 variables (removed 17) and now considering 617/638 (removed 21) transitions.
// Phase 1: matrix 617 rows 471 cols
[2024-06-02 22:54:42] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 22:54:42] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:54:42] [INFO ] Invariant cache hit.
[2024-06-02 22:54:42] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 22:54:42] [INFO ] Invariant cache hit.
[2024-06-02 22:54:42] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/488 places, 617/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 471/488 places, 617/638 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), true, p2, (AND p1 p2), p1]
Running random walk in product with property : CO4-PT-17-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s351 1), p2:(AND (EQ s270 1) (EQ s351 1)), p1:(OR (EQ s270 1) (EQ s351 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 3 ms.
FORMULA CO4-PT-17-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-04 finished in 844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G((X(p0) U p1))||p2))||G(F(p2))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 479 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 479 transition count 629
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 479 transition count 627
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 475 transition count 622
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 475 transition count 622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 473 transition count 620
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 473 transition count 620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 472 transition count 619
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 472 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 472 transition count 618
Applied a total of 35 rules in 40 ms. Remains 472 /488 variables (removed 16) and now considering 618/638 (removed 20) transitions.
// Phase 1: matrix 618 rows 472 cols
[2024-06-02 22:54:43] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:54:43] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:54:43] [INFO ] Invariant cache hit.
[2024-06-02 22:54:43] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-06-02 22:54:43] [INFO ] Invariant cache hit.
[2024-06-02 22:54:43] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/488 places, 618/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 472/488 places, 618/638 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : CO4-PT-17-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s428 0), p1:(EQ s419 1), p0:(NEQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 98 ms.
Product exploration explored 100000 steps with 6 reset in 94 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 148 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-06-02 22:54:44] [INFO ] Invariant cache hit.
[2024-06-02 22:54:44] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:54:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:45] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:54:45] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-06-02 22:54:45] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 1 ms.
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 618/618 transitions.
Graph (trivial) has 516 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 801 edges and 471 vertex of which 450 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 181 rules applied. Total rules applied 183 place count 450 transition count 417
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 347 place count 287 transition count 416
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 347 place count 287 transition count 349
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 481 place count 220 transition count 349
Performed 75 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 631 place count 145 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 639 place count 145 transition count 250
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 641 place count 144 transition count 249
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 648 place count 137 transition count 242
Iterating global reduction 4 with 7 rules applied. Total rules applied 655 place count 137 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 656 place count 137 transition count 241
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 664 place count 133 transition count 237
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 668 place count 133 transition count 233
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 672 place count 129 transition count 229
Iterating global reduction 6 with 4 rules applied. Total rules applied 676 place count 129 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 677 place count 129 transition count 228
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 7 with 6 rules applied. Total rules applied 683 place count 126 transition count 225
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 686 place count 126 transition count 222
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 689 place count 123 transition count 219
Iterating global reduction 8 with 3 rules applied. Total rules applied 692 place count 123 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 694 place count 123 transition count 217
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 695 place count 122 transition count 216
Iterating global reduction 9 with 1 rules applied. Total rules applied 696 place count 122 transition count 216
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 9 with 80 rules applied. Total rules applied 776 place count 82 transition count 219
Drop transitions removed 16 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 819 place count 82 transition count 176
Discarding 36 places :
Symmetric choice reduction at 10 with 36 rule applications. Total rules 855 place count 46 transition count 118
Iterating global reduction 10 with 36 rules applied. Total rules applied 891 place count 46 transition count 118
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 918 place count 46 transition count 91
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 925 place count 39 transition count 71
Iterating global reduction 11 with 7 rules applied. Total rules applied 932 place count 39 transition count 71
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 937 place count 39 transition count 66
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 938 place count 39 transition count 65
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 939 place count 38 transition count 64
Iterating global reduction 12 with 1 rules applied. Total rules applied 940 place count 38 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 941 place count 38 transition count 63
Free-agglomeration rule applied 5 times.
Iterating global reduction 13 with 5 rules applied. Total rules applied 946 place count 38 transition count 58
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 954 place count 33 transition count 55
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 956 place count 33 transition count 55
Graph (complete) has 106 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 957 place count 32 transition count 55
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 958 place count 32 transition count 54
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 959 place count 32 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 961 place count 31 transition count 52
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 90 edges and 31 vertex of which 24 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 6 rules applied. Total rules applied 967 place count 24 transition count 47
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 979 place count 24 transition count 35
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 980 place count 23 transition count 34
Iterating global reduction 18 with 1 rules applied. Total rules applied 981 place count 23 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 982 place count 23 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 983 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 984 place count 22 transition count 31
Iterating global reduction 19 with 1 rules applied. Total rules applied 985 place count 22 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 986 place count 22 transition count 30
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 987 place count 22 transition count 30
Graph (complete) has 58 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 988 place count 21 transition count 30
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 989 place count 21 transition count 29
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 990 place count 21 transition count 29
Graph (complete) has 55 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 22 with 1 rules applied. Total rules applied 991 place count 20 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 992 place count 20 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 993 place count 19 transition count 27
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t50.t556 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 13 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 3 rules applied. Total rules applied 996 place count 13 transition count 25
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t47.t543.t25.t26.t27.t29.t128.t125.t621.t129.t130 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 9 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 25 with 8 rules applied. Total rules applied 1004 place count 9 transition count 18
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 1010 place count 9 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 27 with 2 rules applied. Total rules applied 1012 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 1014 place count 7 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 28 with 1 rules applied. Total rules applied 1015 place count 7 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 1016 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 1017 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 29 with 1 rules applied. Total rules applied 1018 place count 6 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 1019 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 1021 place count 5 transition count 5
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 30 with 1 rules applied. Total rules applied 1022 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 1023 place count 4 transition count 4
Iterating global reduction 30 with 1 rules applied. Total rules applied 1024 place count 4 transition count 4
Applied a total of 1024 rules in 49 ms. Remains 4 /472 variables (removed 468) and now considering 4/618 (removed 614) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 4/472 places, 4/618 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p2) (NOT p0))), (F p1), (F (NOT p2)), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 14 factoid took 363 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 618/618 transitions.
Applied a total of 0 rules in 13 ms. Remains 472 /472 variables (removed 0) and now considering 618/618 (removed 0) transitions.
[2024-06-02 22:54:46] [INFO ] Invariant cache hit.
[2024-06-02 22:54:46] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 22:54:46] [INFO ] Invariant cache hit.
[2024-06-02 22:54:46] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-06-02 22:54:46] [INFO ] Invariant cache hit.
[2024-06-02 22:54:46] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 571 ms. Remains : 472/472 places, 618/618 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 134 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 22:54:47] [INFO ] Invariant cache hit.
[2024-06-02 22:54:47] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:54:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:48] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:54:48] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-06-02 22:54:48] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 2 ms.
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 618/618 transitions.
Graph (trivial) has 516 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 801 edges and 471 vertex of which 450 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 181 rules applied. Total rules applied 183 place count 450 transition count 417
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 347 place count 287 transition count 416
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 347 place count 287 transition count 349
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 481 place count 220 transition count 349
Performed 75 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 631 place count 145 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 639 place count 145 transition count 250
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 641 place count 144 transition count 249
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 648 place count 137 transition count 242
Iterating global reduction 4 with 7 rules applied. Total rules applied 655 place count 137 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 656 place count 137 transition count 241
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 664 place count 133 transition count 237
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 668 place count 133 transition count 233
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 672 place count 129 transition count 229
Iterating global reduction 6 with 4 rules applied. Total rules applied 676 place count 129 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 677 place count 129 transition count 228
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 7 with 6 rules applied. Total rules applied 683 place count 126 transition count 225
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 686 place count 126 transition count 222
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 689 place count 123 transition count 219
Iterating global reduction 8 with 3 rules applied. Total rules applied 692 place count 123 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 694 place count 123 transition count 217
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 695 place count 122 transition count 216
Iterating global reduction 9 with 1 rules applied. Total rules applied 696 place count 122 transition count 216
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 9 with 80 rules applied. Total rules applied 776 place count 82 transition count 219
Drop transitions removed 16 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 819 place count 82 transition count 176
Discarding 36 places :
Symmetric choice reduction at 10 with 36 rule applications. Total rules 855 place count 46 transition count 118
Iterating global reduction 10 with 36 rules applied. Total rules applied 891 place count 46 transition count 118
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 918 place count 46 transition count 91
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 925 place count 39 transition count 71
Iterating global reduction 11 with 7 rules applied. Total rules applied 932 place count 39 transition count 71
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 937 place count 39 transition count 66
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 938 place count 39 transition count 65
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 939 place count 38 transition count 64
Iterating global reduction 12 with 1 rules applied. Total rules applied 940 place count 38 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 941 place count 38 transition count 63
Free-agglomeration rule applied 5 times.
Iterating global reduction 13 with 5 rules applied. Total rules applied 946 place count 38 transition count 58
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 954 place count 33 transition count 55
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 956 place count 33 transition count 55
Graph (complete) has 106 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 957 place count 32 transition count 55
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 958 place count 32 transition count 54
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 959 place count 32 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 961 place count 31 transition count 52
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 90 edges and 31 vertex of which 24 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 6 rules applied. Total rules applied 967 place count 24 transition count 47
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 979 place count 24 transition count 35
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 980 place count 23 transition count 34
Iterating global reduction 18 with 1 rules applied. Total rules applied 981 place count 23 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 982 place count 23 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 983 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 984 place count 22 transition count 31
Iterating global reduction 19 with 1 rules applied. Total rules applied 985 place count 22 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 986 place count 22 transition count 30
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 987 place count 22 transition count 30
Graph (complete) has 58 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 988 place count 21 transition count 30
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 989 place count 21 transition count 29
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 990 place count 21 transition count 29
Graph (complete) has 55 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 22 with 1 rules applied. Total rules applied 991 place count 20 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 992 place count 20 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 993 place count 19 transition count 27
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t50.t556 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 13 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 3 rules applied. Total rules applied 996 place count 13 transition count 25
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t47.t543.t25.t26.t27.t29.t128.t125.t621.t129.t130 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 9 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 25 with 8 rules applied. Total rules applied 1004 place count 9 transition count 18
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 1010 place count 9 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 27 with 2 rules applied. Total rules applied 1012 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 1014 place count 7 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 28 with 1 rules applied. Total rules applied 1015 place count 7 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 1016 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 1017 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 29 with 1 rules applied. Total rules applied 1018 place count 6 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 1019 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 1021 place count 5 transition count 5
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 30 with 1 rules applied. Total rules applied 1022 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 1023 place count 4 transition count 4
Iterating global reduction 30 with 1 rules applied. Total rules applied 1024 place count 4 transition count 4
Applied a total of 1024 rules in 42 ms. Remains 4 /472 variables (removed 468) and now considering 4/618 (removed 614) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 4/472 places, 4/618 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p2) (NOT p0))), (F p1), (F (NOT p2)), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 14 factoid took 337 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 21 reset in 86 ms.
Product exploration explored 100000 steps with 29 reset in 84 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 618/618 transitions.
Graph (trivial) has 514 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 802 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 468 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 164 place count 468 transition count 612
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 164 place count 468 transition count 673
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 228 place count 468 transition count 673
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 259 place count 437 transition count 642
Deduced a syphon composed of 193 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 290 place count 437 transition count 642
Performed 57 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 347 place count 437 transition count 716
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 355 place count 437 transition count 708
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 381 place count 411 transition count 676
Deduced a syphon composed of 231 places in 1 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 407 place count 411 transition count 676
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 409 place count 409 transition count 673
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 411 place count 409 transition count 673
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 412 place count 409 transition count 672
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 413 place count 408 transition count 671
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 408 transition count 671
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 408 transition count 671
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 416 place count 408 transition count 670
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 418 place count 406 transition count 668
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 420 place count 406 transition count 668
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 421 place count 406 transition count 668
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 422 place count 405 transition count 667
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 405 transition count 667
Performed 73 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 301 places in 0 ms
Iterating global reduction 5 with 73 rules applied. Total rules applied 496 place count 405 transition count 970
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 5 with 67 rules applied. Total rules applied 563 place count 405 transition count 903
Discarding 153 places :
Symmetric choice reduction at 6 with 153 rule applications. Total rules 716 place count 252 transition count 556
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 6 with 153 rules applied. Total rules applied 869 place count 252 transition count 556
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 916 place count 252 transition count 509
Discarding 99 places :
Symmetric choice reduction at 7 with 99 rule applications. Total rules 1015 place count 153 transition count 330
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 7 with 99 rules applied. Total rules applied 1114 place count 153 transition count 330
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1124 place count 153 transition count 320
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1144 place count 133 transition count 280
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1164 place count 133 transition count 280
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1166 place count 133 transition count 330
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1180 place count 133 transition count 316
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1186 place count 127 transition count 280
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 6 rules applied. Total rules applied 1192 place count 127 transition count 280
Deduced a syphon composed of 74 places in 0 ms
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1203 place count 127 transition count 269
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1204 place count 126 transition count 268
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1205 place count 126 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1206 place count 126 transition count 289
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1207 place count 125 transition count 281
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1208 place count 125 transition count 281
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 1208 rules in 82 ms. Remains 125 /472 variables (removed 347) and now considering 281/618 (removed 337) transitions.
[2024-06-02 22:54:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:54:49] [INFO ] Flow matrix only has 273 transitions (discarded 8 similar events)
// Phase 1: matrix 273 rows 125 cols
[2024-06-02 22:54:49] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:54:49] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/472 places, 281/618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 125/472 places, 281/618 transitions.
Built C files in :
/tmp/ltsmin1832158364917346948
[2024-06-02 22:54:50] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1832158364917346948
Running compilation step : cd /tmp/ltsmin1832158364917346948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 799 ms.
Running link step : cd /tmp/ltsmin1832158364917346948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1832158364917346948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7503814395938616379.hoa' '--buchi-type=spotba'
LTSmin run took 398 ms.
FORMULA CO4-PT-17-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-05 finished in 8095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 480 transition count 630
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 480 transition count 630
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 480 transition count 628
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 476 transition count 623
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 476 transition count 623
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 474 transition count 621
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 474 transition count 621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 473 transition count 620
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 473 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 473 transition count 619
Applied a total of 33 rules in 35 ms. Remains 473 /488 variables (removed 15) and now considering 619/638 (removed 19) transitions.
// Phase 1: matrix 619 rows 473 cols
[2024-06-02 22:54:51] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 22:54:51] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 22:54:51] [INFO ] Invariant cache hit.
[2024-06-02 22:54:51] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-02 22:54:51] [INFO ] Invariant cache hit.
[2024-06-02 22:54:51] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/488 places, 619/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 473/488 places, 619/638 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-17-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s235 1) (EQ s436 1)), p1:(EQ s355 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-09 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p1))))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 478 transition count 628
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 478 transition count 628
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 478 transition count 626
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 474 transition count 621
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 474 transition count 621
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 472 transition count 619
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 472 transition count 619
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 471 transition count 618
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 471 transition count 617
Applied a total of 37 rules in 34 ms. Remains 471 /488 variables (removed 17) and now considering 617/638 (removed 21) transitions.
// Phase 1: matrix 617 rows 471 cols
[2024-06-02 22:54:52] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 22:54:52] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 22:54:52] [INFO ] Invariant cache hit.
[2024-06-02 22:54:52] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-06-02 22:54:52] [INFO ] Invariant cache hit.
[2024-06-02 22:54:52] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/488 places, 617/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 471/488 places, 617/638 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CO4-PT-17-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s77 0) (EQ s434 0)), p0:(EQ s125 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 233 ms.
Product exploration explored 100000 steps with 25000 reset in 216 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 802 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), true]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1324898 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :{}
Probabilistic random walk after 1324898 steps, saw 236761 distinct states, run finished after 3001 ms. (steps per millisecond=441 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:54:56] [INFO ] Invariant cache hit.
[2024-06-02 22:54:56] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:54:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:56] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:54:56] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-06-02 22:54:56] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 471 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 617/617 transitions.
Applied a total of 0 rules in 11 ms. Remains 471 /471 variables (removed 0) and now considering 617/617 (removed 0) transitions.
[2024-06-02 22:54:57] [INFO ] Invariant cache hit.
[2024-06-02 22:54:57] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 22:54:57] [INFO ] Invariant cache hit.
[2024-06-02 22:54:57] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-06-02 22:54:57] [INFO ] Invariant cache hit.
[2024-06-02 22:54:57] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 471/471 places, 617/617 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 802 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1336864 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :{}
Probabilistic random walk after 1336864 steps, saw 238731 distinct states, run finished after 3002 ms. (steps per millisecond=445 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:55:01] [INFO ] Invariant cache hit.
[2024-06-02 22:55:01] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:55:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-02 22:55:01] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:55:01] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-06-02 22:55:01] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 182 ms.
Product exploration explored 100000 steps with 25000 reset in 195 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 617/617 transitions.
Graph (trivial) has 515 edges and 471 vertex of which 2 / 471 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 801 edges and 470 vertex of which 467 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 163 rules applied. Total rules applied 165 place count 467 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 166 place count 467 transition count 611
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 166 place count 467 transition count 673
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 2 with 65 rules applied. Total rules applied 231 place count 467 transition count 673
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 264 place count 434 transition count 640
Deduced a syphon composed of 194 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 297 place count 434 transition count 640
Performed 54 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 351 place count 434 transition count 712
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 359 place count 434 transition count 704
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 384 place count 409 transition count 673
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 409 place count 409 transition count 673
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 411 place count 407 transition count 670
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 413 place count 407 transition count 670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 407 transition count 669
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 415 place count 406 transition count 668
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 416 place count 406 transition count 668
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 406 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 418 place count 406 transition count 667
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 420 place count 404 transition count 665
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 422 place count 404 transition count 665
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 404 transition count 665
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 424 place count 403 transition count 664
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 425 place count 403 transition count 664
Performed 75 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 5 with 75 rules applied. Total rules applied 500 place count 403 transition count 977
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 5 with 73 rules applied. Total rules applied 573 place count 403 transition count 904
Discarding 156 places :
Symmetric choice reduction at 6 with 156 rule applications. Total rules 729 place count 247 transition count 549
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 6 with 156 rules applied. Total rules applied 885 place count 247 transition count 549
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 936 place count 247 transition count 498
Discarding 98 places :
Symmetric choice reduction at 7 with 98 rule applications. Total rules 1034 place count 149 transition count 322
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 7 with 98 rules applied. Total rules applied 1132 place count 149 transition count 322
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1142 place count 149 transition count 312
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 1160 place count 131 transition count 276
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 8 with 18 rules applied. Total rules applied 1178 place count 131 transition count 276
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1180 place count 131 transition count 326
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1194 place count 131 transition count 312
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1200 place count 125 transition count 276
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 6 rules applied. Total rules applied 1206 place count 125 transition count 276
Deduced a syphon composed of 74 places in 0 ms
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1217 place count 125 transition count 265
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1218 place count 124 transition count 264
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1219 place count 124 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1220 place count 124 transition count 285
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1221 place count 123 transition count 277
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1222 place count 123 transition count 277
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 1222 rules in 84 ms. Remains 123 /471 variables (removed 348) and now considering 277/617 (removed 340) transitions.
[2024-06-02 22:55:02] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:55:02] [INFO ] Flow matrix only has 268 transitions (discarded 9 similar events)
// Phase 1: matrix 268 rows 123 cols
[2024-06-02 22:55:02] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:55:02] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/471 places, 277/617 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 123/471 places, 277/617 transitions.
Built C files in :
/tmp/ltsmin2618940557730317098
[2024-06-02 22:55:02] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2618940557730317098
Running compilation step : cd /tmp/ltsmin2618940557730317098;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 798 ms.
Running link step : cd /tmp/ltsmin2618940557730317098;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2618940557730317098;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5056525778159694868.hoa' '--buchi-type=spotba'
LTSmin run took 234 ms.
FORMULA CO4-PT-17-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-10 finished in 11950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 479 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 479 transition count 629
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 479 transition count 627
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 476 transition count 623
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 476 transition count 623
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 474 transition count 621
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 474 transition count 621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 473 transition count 620
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 473 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 473 transition count 619
Applied a total of 33 rules in 30 ms. Remains 473 /488 variables (removed 15) and now considering 619/638 (removed 19) transitions.
// Phase 1: matrix 619 rows 473 cols
[2024-06-02 22:55:03] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 22:55:04] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 22:55:04] [INFO ] Invariant cache hit.
[2024-06-02 22:55:04] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-06-02 22:55:04] [INFO ] Invariant cache hit.
[2024-06-02 22:55:04] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/488 places, 619/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 566 ms. Remains : 473/488 places, 619/638 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s220 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 180 ms.
Product exploration explored 100000 steps with 25000 reset in 184 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 806 edges and 473 vertex of which 470 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1379033 steps, run timeout after 3001 ms. (steps per millisecond=459 ) properties seen :{}
Probabilistic random walk after 1379033 steps, saw 244933 distinct states, run finished after 3002 ms. (steps per millisecond=459 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:55:08] [INFO ] Invariant cache hit.
[2024-06-02 22:55:08] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:55:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:08] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:55:08] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-06-02 22:55:08] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 619/619 transitions.
Applied a total of 0 rules in 12 ms. Remains 473 /473 variables (removed 0) and now considering 619/619 (removed 0) transitions.
[2024-06-02 22:55:08] [INFO ] Invariant cache hit.
[2024-06-02 22:55:09] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 22:55:09] [INFO ] Invariant cache hit.
[2024-06-02 22:55:09] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-02 22:55:09] [INFO ] Invariant cache hit.
[2024-06-02 22:55:09] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 571 ms. Remains : 473/473 places, 619/619 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 806 edges and 473 vertex of which 470 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished Best-First random walk after 5566 steps, including 28 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1391 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 181 ms.
Product exploration explored 100000 steps with 25000 reset in 185 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 619/619 transitions.
Graph (trivial) has 518 edges and 473 vertex of which 2 / 473 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 805 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 469 transition count 614
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 167 place count 469 transition count 613
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 167 place count 469 transition count 674
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 231 place count 469 transition count 674
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 264 place count 436 transition count 641
Deduced a syphon composed of 194 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 297 place count 436 transition count 641
Performed 57 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 251 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 354 place count 436 transition count 718
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 362 place count 436 transition count 710
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 389 place count 409 transition count 677
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 416 place count 409 transition count 677
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 418 place count 407 transition count 674
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 420 place count 407 transition count 674
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 421 place count 407 transition count 673
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 422 place count 406 transition count 672
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 423 place count 406 transition count 672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 424 place count 406 transition count 672
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 425 place count 406 transition count 671
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 427 place count 404 transition count 669
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 429 place count 404 transition count 669
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 430 place count 404 transition count 669
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 431 place count 403 transition count 668
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 432 place count 403 transition count 668
Performed 74 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 5 with 74 rules applied. Total rules applied 506 place count 403 transition count 975
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 5 with 77 rules applied. Total rules applied 583 place count 403 transition count 898
Discarding 157 places :
Symmetric choice reduction at 6 with 157 rule applications. Total rules 740 place count 246 transition count 541
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 6 with 157 rules applied. Total rules applied 897 place count 246 transition count 541
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 945 place count 246 transition count 493
Discarding 100 places :
Symmetric choice reduction at 7 with 100 rule applications. Total rules 1045 place count 146 transition count 314
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 7 with 100 rules applied. Total rules applied 1145 place count 146 transition count 314
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1155 place count 146 transition count 304
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1175 place count 126 transition count 264
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1195 place count 126 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1197 place count 126 transition count 309
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1209 place count 126 transition count 297
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1215 place count 120 transition count 261
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 6 rules applied. Total rules applied 1221 place count 120 transition count 261
Deduced a syphon composed of 71 places in 0 ms
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1232 place count 120 transition count 250
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1233 place count 119 transition count 249
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1234 place count 119 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1235 place count 119 transition count 270
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1236 place count 118 transition count 262
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1237 place count 118 transition count 262
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 1237 rules in 80 ms. Remains 118 /473 variables (removed 355) and now considering 262/619 (removed 357) transitions.
[2024-06-02 22:55:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:55:10] [INFO ] Flow matrix only has 254 transitions (discarded 8 similar events)
// Phase 1: matrix 254 rows 118 cols
[2024-06-02 22:55:10] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:55:11] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/473 places, 262/619 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 118/473 places, 262/619 transitions.
Built C files in :
/tmp/ltsmin4536315724370047756
[2024-06-02 22:55:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4536315724370047756
Running compilation step : cd /tmp/ltsmin4536315724370047756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 822 ms.
Running link step : cd /tmp/ltsmin4536315724370047756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4536315724370047756;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10580267585389644717.hoa' '--buchi-type=spotba'
LTSmin run took 195 ms.
FORMULA CO4-PT-17-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-12 finished in 8168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1)||F(p2))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Graph (trivial) has 529 edges and 488 vertex of which 2 / 488 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 826 edges and 487 vertex of which 481 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 168 rules applied. Total rules applied 170 place count 480 transition count 461
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 171 rules applied. Total rules applied 341 place count 313 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 343 place count 311 transition count 457
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 343 place count 311 transition count 396
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 465 place count 250 transition count 396
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 468 place count 247 transition count 393
Iterating global reduction 3 with 3 rules applied. Total rules applied 471 place count 247 transition count 393
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 471 place count 247 transition count 391
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 475 place count 245 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 476 place count 244 transition count 390
Iterating global reduction 3 with 1 rules applied. Total rules applied 477 place count 244 transition count 390
Performed 84 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 645 place count 160 transition count 283
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 652 place count 160 transition count 276
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 659 place count 153 transition count 269
Iterating global reduction 4 with 7 rules applied. Total rules applied 666 place count 153 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 667 place count 153 transition count 268
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 675 place count 149 transition count 264
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 767 place count 103 transition count 268
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 795 place count 103 transition count 240
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 835 place count 63 transition count 160
Iterating global reduction 6 with 40 rules applied. Total rules applied 875 place count 63 transition count 160
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 900 place count 63 transition count 135
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 909 place count 54 transition count 109
Iterating global reduction 7 with 9 rules applied. Total rules applied 918 place count 54 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 923 place count 54 transition count 104
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 929 place count 54 transition count 98
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 933 place count 54 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 935 place count 52 transition count 96
Applied a total of 935 rules in 29 ms. Remains 52 /488 variables (removed 436) and now considering 96/638 (removed 542) transitions.
[2024-06-02 22:55:12] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
// Phase 1: matrix 88 rows 52 cols
[2024-06-02 22:55:12] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:55:12] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 22:55:12] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2024-06-02 22:55:12] [INFO ] Invariant cache hit.
[2024-06-02 22:55:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:55:12] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-02 22:55:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:55:12] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2024-06-02 22:55:12] [INFO ] Invariant cache hit.
[2024-06-02 22:55:12] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/488 places, 96/638 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 52/488 places, 96/638 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s12 1), p2:(EQ s29 1), p0:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-13 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Graph (trivial) has 531 edges and 488 vertex of which 2 / 488 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 826 edges and 487 vertex of which 484 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 483 transition count 461
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 174 rules applied. Total rules applied 348 place count 312 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 311 transition count 458
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 349 place count 311 transition count 398
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 469 place count 251 transition count 398
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 473 place count 247 transition count 394
Iterating global reduction 3 with 4 rules applied. Total rules applied 477 place count 247 transition count 394
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 477 place count 247 transition count 391
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 483 place count 244 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 485 place count 242 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 487 place count 242 transition count 389
Performed 86 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 659 place count 156 transition count 280
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 666 place count 156 transition count 273
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 673 place count 149 transition count 266
Iterating global reduction 4 with 7 rules applied. Total rules applied 680 place count 149 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 681 place count 149 transition count 265
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 689 place count 145 transition count 261
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 777 place count 101 transition count 264
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 805 place count 101 transition count 236
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 843 place count 63 transition count 160
Iterating global reduction 6 with 38 rules applied. Total rules applied 881 place count 63 transition count 160
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 907 place count 63 transition count 134
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 917 place count 53 transition count 105
Iterating global reduction 7 with 10 rules applied. Total rules applied 927 place count 53 transition count 105
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 934 place count 53 transition count 98
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 938 place count 53 transition count 94
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 940 place count 51 transition count 92
Applied a total of 940 rules in 36 ms. Remains 51 /488 variables (removed 437) and now considering 92/638 (removed 546) transitions.
[2024-06-02 22:55:12] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
// Phase 1: matrix 83 rows 51 cols
[2024-06-02 22:55:12] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:55:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 22:55:12] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-06-02 22:55:12] [INFO ] Invariant cache hit.
[2024-06-02 22:55:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:55:12] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-02 22:55:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:55:12] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-06-02 22:55:12] [INFO ] Invariant cache hit.
[2024-06-02 22:55:12] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/488 places, 92/638 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 51/488 places, 92/638 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s4 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11 reset in 71 ms.
Product exploration explored 100000 steps with 31 reset in 68 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Graph (complete) has 180 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 69 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=69 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-02 22:55:13] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-06-02 22:55:13] [INFO ] Invariant cache hit.
[2024-06-02 22:55:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:55:13] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-06-02 22:55:13] [INFO ] Invariant cache hit.
[2024-06-02 22:55:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:55:13] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-02 22:55:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:55:13] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-06-02 22:55:13] [INFO ] Invariant cache hit.
[2024-06-02 22:55:13] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 51/51 places, 92/92 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Graph (complete) has 180 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 561 steps, including 52 resets, run visited all 1 properties in 7 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 32 reset in 39 ms.
Product exploration explored 100000 steps with 0 reset in 34 ms.
Built C files in :
/tmp/ltsmin17616147977936218705
[2024-06-02 22:55:13] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2024-06-02 22:55:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:13] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2024-06-02 22:55:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:13] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2024-06-02 22:55:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:13] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17616147977936218705
Running compilation step : cd /tmp/ltsmin17616147977936218705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 181 ms.
Running link step : cd /tmp/ltsmin17616147977936218705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17616147977936218705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1683415216648067713.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA CO4-PT-17-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-15 finished in 1540 ms.
All properties solved by simple procedures.
Total runtime 119515 ms.

BK_STOP 1717368914937

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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