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-171734910200098.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-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910200098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K 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 336K 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-20-LTLFireability-00
FORMULA_NAME CO4-PT-20-LTLFireability-01
FORMULA_NAME CO4-PT-20-LTLFireability-02
FORMULA_NAME CO4-PT-20-LTLFireability-03
FORMULA_NAME CO4-PT-20-LTLFireability-04
FORMULA_NAME CO4-PT-20-LTLFireability-05
FORMULA_NAME CO4-PT-20-LTLFireability-06
FORMULA_NAME CO4-PT-20-LTLFireability-07
FORMULA_NAME CO4-PT-20-LTLFireability-08
FORMULA_NAME CO4-PT-20-LTLFireability-09
FORMULA_NAME CO4-PT-20-LTLFireability-10
FORMULA_NAME CO4-PT-20-LTLFireability-11
FORMULA_NAME CO4-PT-20-LTLFireability-12
FORMULA_NAME CO4-PT-20-LTLFireability-13
FORMULA_NAME CO4-PT-20-LTLFireability-14
FORMULA_NAME CO4-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368948212

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-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:55:49] [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:55:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:55:50] [INFO ] Load time of PNML (sax parser for PT used): 437 ms
[2024-06-02 22:55:50] [INFO ] Transformed 1178 places.
[2024-06-02 22:55:50] [INFO ] Transformed 1463 transitions.
[2024-06-02 22:55:50] [INFO ] Found NUPN structural information;
[2024-06-02 22:55:50] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 187 places in 15 ms
Reduce places removed 187 places and 251 transitions.
FORMULA CO4-PT-20-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 969 transition count 1207
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 195 place count 801 transition count 1037
Iterating global reduction 1 with 168 rules applied. Total rules applied 363 place count 801 transition count 1037
Discarding 142 places :
Symmetric choice reduction at 1 with 142 rule applications. Total rules 505 place count 659 transition count 882
Iterating global reduction 1 with 142 rules applied. Total rules applied 647 place count 659 transition count 882
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 656 place count 659 transition count 873
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 725 place count 590 transition count 800
Iterating global reduction 2 with 69 rules applied. Total rules applied 794 place count 590 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 797 place count 590 transition count 797
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 844 place count 543 transition count 750
Iterating global reduction 3 with 47 rules applied. Total rules applied 891 place count 543 transition count 750
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 900 place count 543 transition count 741
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 919 place count 524 transition count 722
Iterating global reduction 4 with 19 rules applied. Total rules applied 938 place count 524 transition count 722
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 940 place count 524 transition count 720
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 945 place count 519 transition count 715
Iterating global reduction 5 with 5 rules applied. Total rules applied 950 place count 519 transition count 715
Applied a total of 950 rules in 234 ms. Remains 519 /991 variables (removed 472) and now considering 715/1212 (removed 497) transitions.
// Phase 1: matrix 715 rows 519 cols
[2024-06-02 22:55:50] [INFO ] Computed 7 invariants in 27 ms
[2024-06-02 22:55:51] [INFO ] Implicit Places using invariants in 365 ms returned [6, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 394 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 517/991 places, 715/1212 transitions.
Applied a total of 0 rules in 9 ms. Remains 517 /517 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 637 ms. Remains : 517/991 places, 715/1212 transitions.
Support contains 30 out of 517 places after structural reductions.
[2024-06-02 22:55:51] [INFO ] Flatten gal took : 75 ms
[2024-06-02 22:55:51] [INFO ] Flatten gal took : 40 ms
[2024-06-02 22:55:51] [INFO ] Input system was already deterministic with 715 transitions.
Support contains 29 out of 517 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 665 ms. (steps per millisecond=15 ) properties (out of 24) seen :8
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 715 rows 517 cols
[2024-06-02 22:55:52] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:55:52] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 22:55:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:55:53] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-02 22:55:54] [INFO ] After 1349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 424 ms.
[2024-06-02 22:55:54] [INFO ] After 2116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 11 properties in 101 ms.
Support contains 9 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 534 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1038 edges and 515 vertex of which 507 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 227 rules applied. Total rules applied 229 place count 507 transition count 473
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 221 rules applied. Total rules applied 450 place count 290 transition count 469
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 456 place count 288 transition count 465
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 460 place count 284 transition count 465
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 460 place count 284 transition count 418
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 554 place count 237 transition count 418
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 560 place count 231 transition count 412
Iterating global reduction 4 with 6 rules applied. Total rules applied 566 place count 231 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 568 place count 231 transition count 410
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 568 place count 231 transition count 408
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 572 place count 229 transition count 408
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 575 place count 226 transition count 403
Iterating global reduction 5 with 3 rules applied. Total rules applied 578 place count 226 transition count 403
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 579 place count 225 transition count 402
Iterating global reduction 5 with 1 rules applied. Total rules applied 580 place count 225 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 581 place count 225 transition count 401
Performed 75 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 731 place count 150 transition count 304
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 741 place count 150 transition count 294
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 748 place count 143 transition count 283
Iterating global reduction 7 with 7 rules applied. Total rules applied 755 place count 143 transition count 283
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 761 place count 140 transition count 280
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 843 place count 99 transition count 322
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 7 with 36 rules applied. Total rules applied 879 place count 99 transition count 286
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 906 place count 72 transition count 189
Iterating global reduction 8 with 27 rules applied. Total rules applied 933 place count 72 transition count 189
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 952 place count 72 transition count 170
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 958 place count 66 transition count 141
Iterating global reduction 9 with 6 rules applied. Total rules applied 964 place count 66 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 968 place count 66 transition count 137
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 972 place count 66 transition count 133
Free-agglomeration rule applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 983 place count 66 transition count 122
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 996 place count 55 transition count 120
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 1000 place count 55 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1001 place count 54 transition count 119
Applied a total of 1001 rules in 128 ms. Remains 54 /517 variables (removed 463) and now considering 119/715 (removed 596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 54/517 places, 119/715 transitions.
Incomplete random walk after 10000 steps, including 353 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:55:54] [INFO ] Flow matrix only has 112 transitions (discarded 7 similar events)
// Phase 1: matrix 112 rows 54 cols
[2024-06-02 22:55:54] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:55:54] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-02 22:55:54] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 22:55:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:55:54] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:55:54] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:55:54] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-02 22:55:55] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:55:55] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:55:55] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-06-02 22:55:55] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 119/119 transitions.
Graph (complete) has 216 edges and 54 vertex of which 51 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 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 0 with 11 rules applied. Total rules applied 12 place count 51 transition count 108
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 35 edges and 47 vertex of which 5 / 47 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 17 place count 44 transition count 108
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 24 place count 44 transition count 101
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 24 place count 44 transition count 98
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 30 place count 41 transition count 98
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 38 transition count 88
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 38 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 38 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 37 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 37 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 37 transition count 80
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 48 place count 33 transition count 76
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 53 place count 33 transition count 71
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 54 place count 32 transition count 69
Iterating global reduction 6 with 1 rules applied. Total rules applied 55 place count 32 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 57 place count 32 transition count 67
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 65 place count 32 transition count 59
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 67 place count 30 transition count 55
Iterating global reduction 7 with 2 rules applied. Total rules applied 69 place count 30 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 71 place count 30 transition count 53
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 81 place count 30 transition count 43
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 53 edges and 19 vertex of which 14 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (trivial) has 8 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 18 rules applied. Total rules applied 99 place count 12 transition count 34
Drop transitions removed 14 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 116 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 117 place count 11 transition count 13
Iterating global reduction 10 with 1 rules applied. Total rules applied 118 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 119 place count 11 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 120 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 121 place count 10 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 122 place count 10 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 123 place count 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 125 place count 9 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 126 place count 8 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 128 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 130 place count 5 transition count 7
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 132 place count 5 transition count 5
Applied a total of 132 rules in 13 ms. Remains 5 /54 variables (removed 49) and now considering 5/119 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 5/54 places, 5/119 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-20-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CO4-PT-20-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CO4-PT-20-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 23 stabilizing places and 38 stable transitions
Graph (complete) has 1041 edges and 517 vertex of which 510 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 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))&&(p1 U (p2||G(p1)))))'
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 548 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 508 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 216 place count 507 transition count 490
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 218 rules applied. Total rules applied 434 place count 293 transition count 486
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 291 transition count 486
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 436 place count 291 transition count 438
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 532 place count 243 transition count 438
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 536 place count 239 transition count 434
Iterating global reduction 3 with 4 rules applied. Total rules applied 540 place count 239 transition count 434
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 540 place count 239 transition count 432
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 544 place count 237 transition count 432
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 547 place count 234 transition count 427
Iterating global reduction 3 with 3 rules applied. Total rules applied 550 place count 234 transition count 427
Performed 84 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 718 place count 150 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 728 place count 150 transition count 307
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 736 place count 142 transition count 294
Iterating global reduction 4 with 8 rules applied. Total rules applied 744 place count 142 transition count 294
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 826 place count 101 transition count 339
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 846 place count 101 transition count 319
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 873 place count 74 transition count 211
Iterating global reduction 5 with 27 rules applied. Total rules applied 900 place count 74 transition count 211
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 918 place count 74 transition count 193
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 925 place count 67 transition count 155
Iterating global reduction 6 with 7 rules applied. Total rules applied 932 place count 67 transition count 155
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 937 place count 67 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
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 943 place count 64 transition count 180
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 7 with 45 rules applied. Total rules applied 988 place count 64 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 990 place count 62 transition count 133
Applied a total of 990 rules in 89 ms. Remains 62 /517 variables (removed 455) and now considering 133/715 (removed 582) transitions.
[2024-06-02 22:55:55] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
// Phase 1: matrix 113 rows 62 cols
[2024-06-02 22:55:55] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:55:55] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 22:55:55] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
[2024-06-02 22:55:55] [INFO ] Invariant cache hit.
[2024-06-02 22:55:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:55:55] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-06-02 22:55:55] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:55:55] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
[2024-06-02 22:55:55] [INFO ] Invariant cache hit.
[2024-06-02 22:55:55] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/517 places, 133/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 498 ms. Remains : 62/517 places, 133/715 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 295 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CO4-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s17 1) (EQ s60 1))) (NEQ s23 1)), p1:(NEQ s23 1), p0:(AND (OR (EQ s17 0) (EQ s60 0)) (EQ s27 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 449 reset in 183 ms.
Product exploration explored 100000 steps with 162 reset in 86 ms.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 100 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 242 steps, including 20 resets, run visited all 1 properties in 6 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 118 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 3 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 133/133 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-06-02 22:55:56] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
[2024-06-02 22:55:56] [INFO ] Invariant cache hit.
[2024-06-02 22:55:56] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 22:55:56] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
[2024-06-02 22:55:56] [INFO ] Invariant cache hit.
[2024-06-02 22:55:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:55:57] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-02 22:55:57] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:55:57] [INFO ] Flow matrix only has 113 transitions (discarded 20 similar events)
[2024-06-02 22:55:57] [INFO ] Invariant cache hit.
[2024-06-02 22:55:57] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 62/62 places, 133/133 transitions.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 35 ms :[(NOT p0)]
Finished random walk after 219 steps, including 17 resets, run visited all 1 properties in 2 ms. (steps per millisecond=109 )
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 97 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 214 reset in 54 ms.
Product exploration explored 100000 steps with 11 reset in 86 ms.
Built C files in :
/tmp/ltsmin16977096622144601916
[2024-06-02 22:55:57] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2024-06-02 22:55:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:57] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2024-06-02 22:55:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:57] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2024-06-02 22:55:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:55:57] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16977096622144601916
Running compilation step : cd /tmp/ltsmin16977096622144601916;'/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 363 ms.
Running link step : cd /tmp/ltsmin16977096622144601916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin16977096622144601916;'/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/stateBased17764850158006009594.hoa' '--buchi-type=spotba'
LTSmin run took 201 ms.
FORMULA CO4-PT-20-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-20-LTLFireability-00 finished in 2943 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(F(p0)))&&F((p1 U (G(p1)||(p1&&G(!p2)))))))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 500 transition count 697
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 500 transition count 697
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 498 transition count 695
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 498 transition count 695
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 497 transition count 694
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 497 transition count 694
Applied a total of 40 rules in 43 ms. Remains 497 /517 variables (removed 20) and now considering 694/715 (removed 21) transitions.
// Phase 1: matrix 694 rows 497 cols
[2024-06-02 22:55:58] [INFO ] Computed 5 invariants in 8 ms
[2024-06-02 22:55:58] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-02 22:55:58] [INFO ] Invariant cache hit.
[2024-06-02 22:55:58] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-06-02 22:55:58] [INFO ] Invariant cache hit.
[2024-06-02 22:55:59] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 497/517 places, 694/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 497/517 places, 694/715 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p2 (NOT p1)), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s408 1) (EQ s430 1) (EQ s458 1)), p1:(EQ s221 1), p0:(EQ s364 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 2 ms.
FORMULA CO4-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-01 finished in 1146 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((G(p0)||(X(F(p0))&&p1))))'
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 499 transition count 696
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 499 transition count 696
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 496 transition count 692
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 691
Applied a total of 44 rules in 30 ms. Remains 495 /517 variables (removed 22) and now considering 691/715 (removed 24) transitions.
// Phase 1: matrix 691 rows 495 cols
[2024-06-02 22:55:59] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 22:55:59] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 22:55:59] [INFO ] Invariant cache hit.
[2024-06-02 22:55:59] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-06-02 22:55:59] [INFO ] Invariant cache hit.
[2024-06-02 22:56:00] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 495/517 places, 691/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 670 ms. Remains : 495/517 places, 691/715 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s73 0), p1:(AND (EQ s259 1) (EQ s428 1) (EQ s482 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1376 reset in 139 ms.
Product exploration explored 100000 steps with 438 reset in 154 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1003 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 209 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1190454 steps, run timeout after 3001 ms. (steps per millisecond=396 ) properties seen :{}
Probabilistic random walk after 1190454 steps, saw 225781 distinct states, run finished after 3001 ms. (steps per millisecond=396 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:56:03] [INFO ] Invariant cache hit.
[2024-06-02 22:56:03] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:56:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:56:04] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:56:04] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-06-02 22:56:04] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 45 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 6 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-20-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-20-LTLFireability-02 finished in 4877 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 U (p1||G(p0)))||(p2&&X(p3))))))'
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 499 transition count 696
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 499 transition count 696
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 496 transition count 692
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 691
Applied a total of 44 rules in 29 ms. Remains 495 /517 variables (removed 22) and now considering 691/715 (removed 24) transitions.
// Phase 1: matrix 691 rows 495 cols
[2024-06-02 22:56:04] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 22:56:04] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 22:56:04] [INFO ] Invariant cache hit.
[2024-06-02 22:56:04] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-06-02 22:56:04] [INFO ] Invariant cache hit.
[2024-06-02 22:56:05] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 495/517 places, 691/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 684 ms. Remains : 495/517 places, 691/715 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : CO4-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s357 0), p1:(AND (NEQ s357 1) (NEQ s420 1)), p0:(NEQ s420 1), p3:(EQ s404 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1848 reset in 160 ms.
Product exploration explored 100000 steps with 3585 reset in 217 ms.
Computed a total of 23 stabilizing places and 38 stable transitions
Graph (complete) has 1003 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 23 stabilizing places and 38 stable transitions
Detected a total of 23/495 stabilizing places and 38/691 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p1) p0 (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 131 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 143 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-06-02 22:56:06] [INFO ] Invariant cache hit.
[2024-06-02 22:56:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:56:06] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-06-02 22:56:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:56:06] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2024-06-02 22:56:06] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-06-02 22:56:06] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 691/691 transitions.
Graph (trivial) has 532 edges and 495 vertex of which 3 / 495 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1000 edges and 493 vertex of which 476 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 476 transition count 439
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 212 rules applied. Total rules applied 449 place count 266 transition count 437
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 451 place count 265 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 452 place count 264 transition count 436
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 452 place count 264 transition count 387
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 550 place count 215 transition count 387
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 553 place count 212 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 556 place count 212 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 559 place count 212 transition count 381
Performed 78 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 715 place count 134 transition count 280
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 726 place count 134 transition count 269
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 734 place count 126 transition count 256
Iterating global reduction 6 with 8 rules applied. Total rules applied 742 place count 126 transition count 256
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 750 place count 122 transition count 252
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 751 place count 122 transition count 251
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 752 place count 121 transition count 249
Iterating global reduction 7 with 1 rules applied. Total rules applied 753 place count 121 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 754 place count 121 transition count 248
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 830 place count 83 transition count 288
Drop transitions removed 60 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 8 with 80 rules applied. Total rules applied 910 place count 83 transition count 208
Discarding 29 places :
Symmetric choice reduction at 9 with 29 rule applications. Total rules 939 place count 54 transition count 139
Iterating global reduction 9 with 29 rules applied. Total rules applied 968 place count 54 transition count 139
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 989 place count 54 transition count 118
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 995 place count 48 transition count 93
Iterating global reduction 10 with 6 rules applied. Total rules applied 1001 place count 48 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1006 place count 48 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1008 place count 47 transition count 95
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1011 place count 47 transition count 92
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 1018 place count 47 transition count 85
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1019 place count 46 transition count 83
Iterating global reduction 12 with 1 rules applied. Total rules applied 1020 place count 46 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1021 place count 46 transition count 82
Free-agglomeration rule applied 11 times.
Iterating global reduction 13 with 11 rules applied. Total rules applied 1032 place count 46 transition count 71
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 1045 place count 35 transition count 69
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1048 place count 35 transition count 69
Graph (complete) has 132 edges and 35 vertex of which 34 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 1049 place count 34 transition count 69
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1052 place count 34 transition count 66
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1055 place count 34 transition count 66
Graph (complete) has 124 edges and 34 vertex of which 33 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 16 with 1 rules applied. Total rules applied 1056 place count 33 transition count 66
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1059 place count 33 transition count 63
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 1062 place count 33 transition count 63
Graph (complete) has 116 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 18 with 1 rules applied. Total rules applied 1063 place count 32 transition count 63
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 1066 place count 32 transition count 60
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 1069 place count 32 transition count 60
Graph (complete) has 108 edges and 32 vertex of which 31 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 1070 place count 31 transition count 60
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 1073 place count 31 transition count 57
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 22 with 3 rules applied. Total rules applied 1076 place count 31 transition count 57
Graph (complete) has 100 edges and 31 vertex of which 30 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 1077 place count 30 transition count 57
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 1080 place count 30 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 1081 place count 29 transition count 53
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t376.t380.t568.t600 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 25 vertex of which 3 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 24 with 5 rules applied. Total rules applied 1086 place count 23 transition count 49
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 21 edges and 17 vertex of which 12 / 17 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 25 with 20 rules applied. Total rules applied 1106 place count 8 transition count 36
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 29 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 6 edges and 7 vertex of which 5 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 26 with 32 rules applied. Total rules applied 1138 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 27 with 1 Pre rules applied. Total rules applied 1138 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 1140 place count 4 transition count 4
Applied a total of 1140 rules in 54 ms. Remains 4 /495 variables (removed 491) and now considering 4/691 (removed 687) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 4/495 places, 4/691 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p2 (NOT p1) p0 (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 24 factoid took 18 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-20-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-20-LTLFireability-04 finished in 2642 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(G(p0)))'
Support contains 1 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 499 transition count 697
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 499 transition count 697
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 496 transition count 693
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 496 transition count 693
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 692
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 692
Applied a total of 44 rules in 23 ms. Remains 495 /517 variables (removed 22) and now considering 692/715 (removed 23) transitions.
// Phase 1: matrix 692 rows 495 cols
[2024-06-02 22:56:06] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:56:07] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 22:56:07] [INFO ] Invariant cache hit.
[2024-06-02 22:56:07] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-06-02 22:56:07] [INFO ] Invariant cache hit.
[2024-06-02 22:56:07] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 495/517 places, 692/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 495/517 places, 692/715 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s296 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][false, false, false]]
Product exploration explored 100000 steps with 2089 reset in 133 ms.
Product exploration explored 100000 steps with 1083 reset in 112 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1009 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 161 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 604212 steps, run visited all 1 properties in 1440 ms. (steps per millisecond=419 )
Probabilistic random walk after 604212 steps, saw 113458 distinct states, run finished after 1441 ms. (steps per millisecond=419 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-20-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-20-LTLFireability-05 finished in 2910 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))'
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 550 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 510 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 509 transition count 491
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 220 rules applied. Total rules applied 437 place count 294 transition count 486
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 440 place count 291 transition count 486
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 440 place count 291 transition count 438
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 536 place count 243 transition count 438
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 540 place count 239 transition count 434
Iterating global reduction 3 with 4 rules applied. Total rules applied 544 place count 239 transition count 434
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 544 place count 239 transition count 432
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 548 place count 237 transition count 432
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 551 place count 234 transition count 427
Iterating global reduction 3 with 3 rules applied. Total rules applied 554 place count 234 transition count 427
Performed 84 Post agglomeration using F-continuation condition with reduction of 26 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 722 place count 150 transition count 317
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 733 place count 150 transition count 306
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 741 place count 142 transition count 293
Iterating global reduction 4 with 8 rules applied. Total rules applied 749 place count 142 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 751 place count 141 transition count 292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 752 place count 140 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 753 place count 140 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 754 place count 140 transition count 289
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 834 place count 100 transition count 334
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 853 place count 100 transition count 315
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 880 place count 73 transition count 207
Iterating global reduction 6 with 27 rules applied. Total rules applied 907 place count 73 transition count 207
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 925 place count 73 transition count 189
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 932 place count 66 transition count 151
Iterating global reduction 7 with 7 rules applied. Total rules applied 939 place count 66 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 944 place count 66 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 950 place count 63 transition count 172
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 8 with 41 rules applied. Total rules applied 991 place count 63 transition count 131
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 993 place count 61 transition count 129
Applied a total of 993 rules in 63 ms. Remains 61 /517 variables (removed 456) and now considering 129/715 (removed 586) transitions.
[2024-06-02 22:56:09] [INFO ] Flow matrix only has 111 transitions (discarded 18 similar events)
// Phase 1: matrix 111 rows 61 cols
[2024-06-02 22:56:09] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 22:56:10] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 22:56:10] [INFO ] Flow matrix only has 111 transitions (discarded 18 similar events)
[2024-06-02 22:56:10] [INFO ] Invariant cache hit.
[2024-06-02 22:56:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:56:10] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-06-02 22:56:10] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:56:10] [INFO ] Flow matrix only has 111 transitions (discarded 18 similar events)
[2024-06-02 22:56:10] [INFO ] Invariant cache hit.
[2024-06-02 22:56:10] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/517 places, 129/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 61/517 places, 129/715 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s4 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-06 finished in 408 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))'
Support contains 1 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 553 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 510 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 218 place count 509 transition count 490
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 221 rules applied. Total rules applied 439 place count 293 transition count 485
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 442 place count 290 transition count 485
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 442 place count 290 transition count 437
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 538 place count 242 transition count 437
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 542 place count 238 transition count 433
Iterating global reduction 3 with 4 rules applied. Total rules applied 546 place count 238 transition count 433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 546 place count 238 transition count 431
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 550 place count 236 transition count 431
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 553 place count 233 transition count 426
Iterating global reduction 3 with 3 rules applied. Total rules applied 556 place count 233 transition count 426
Performed 84 Post agglomeration using F-continuation condition with reduction of 25 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 724 place count 149 transition count 317
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 735 place count 149 transition count 306
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 743 place count 141 transition count 293
Iterating global reduction 4 with 8 rules applied. Total rules applied 751 place count 141 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 753 place count 140 transition count 292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 754 place count 139 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 755 place count 139 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 756 place count 139 transition count 289
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 838 place count 98 transition count 335
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 859 place count 98 transition count 314
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 887 place count 70 transition count 202
Iterating global reduction 6 with 28 rules applied. Total rules applied 915 place count 70 transition count 202
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 934 place count 70 transition count 183
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 941 place count 63 transition count 145
Iterating global reduction 7 with 7 rules applied. Total rules applied 948 place count 63 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 953 place count 63 transition count 140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 961 place count 59 transition count 181
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 8 with 46 rules applied. Total rules applied 1007 place count 59 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1009 place count 57 transition count 133
Applied a total of 1009 rules in 60 ms. Remains 57 /517 variables (removed 460) and now considering 133/715 (removed 582) transitions.
[2024-06-02 22:56:10] [INFO ] Flow matrix only has 105 transitions (discarded 28 similar events)
// Phase 1: matrix 105 rows 57 cols
[2024-06-02 22:56:10] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:56:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 22:56:10] [INFO ] Flow matrix only has 105 transitions (discarded 28 similar events)
[2024-06-02 22:56:10] [INFO ] Invariant cache hit.
[2024-06-02 22:56:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:56:10] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-06-02 22:56:10] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:56:10] [INFO ] Flow matrix only has 105 transitions (discarded 28 similar events)
[2024-06-02 22:56:10] [INFO ] Invariant cache hit.
[2024-06-02 22:56:10] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/517 places, 133/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 57/517 places, 133/715 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-10 finished in 301 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))'
Support contains 1 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 551 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 508 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 216 place count 507 transition count 490
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 219 rules applied. Total rules applied 435 place count 293 transition count 485
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 439 place count 290 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 440 place count 289 transition count 484
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 440 place count 289 transition count 436
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 536 place count 241 transition count 436
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 540 place count 237 transition count 432
Iterating global reduction 4 with 4 rules applied. Total rules applied 544 place count 237 transition count 432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 544 place count 237 transition count 430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 548 place count 235 transition count 430
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 551 place count 232 transition count 425
Iterating global reduction 4 with 3 rules applied. Total rules applied 554 place count 232 transition count 425
Performed 84 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 722 place count 148 transition count 315
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 733 place count 148 transition count 304
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 741 place count 140 transition count 291
Iterating global reduction 5 with 8 rules applied. Total rules applied 749 place count 140 transition count 291
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 5 with 2 rules applied. Total rules applied 751 place count 139 transition count 290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 752 place count 138 transition count 288
Iterating global reduction 5 with 1 rules applied. Total rules applied 753 place count 138 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 754 place count 138 transition count 287
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 834 place count 98 transition count 332
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 854 place count 98 transition count 312
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 881 place count 71 transition count 204
Iterating global reduction 7 with 27 rules applied. Total rules applied 908 place count 71 transition count 204
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 926 place count 71 transition count 186
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 933 place count 64 transition count 148
Iterating global reduction 8 with 7 rules applied. Total rules applied 940 place count 64 transition count 148
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 945 place count 64 transition count 143
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 953 place count 60 transition count 186
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 9 with 48 rules applied. Total rules applied 1001 place count 60 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1003 place count 58 transition count 136
Applied a total of 1003 rules in 51 ms. Remains 58 /517 variables (removed 459) and now considering 136/715 (removed 579) transitions.
[2024-06-02 22:56:10] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
// Phase 1: matrix 107 rows 58 cols
[2024-06-02 22:56:10] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:56:10] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 22:56:10] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2024-06-02 22:56:10] [INFO ] Invariant cache hit.
[2024-06-02 22:56:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:56:10] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-06-02 22:56:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:56:10] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2024-06-02 22:56:10] [INFO ] Invariant cache hit.
[2024-06-02 22:56:10] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/517 places, 136/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 58/517 places, 136/715 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-12 finished in 261 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(X(F((G(F(p0))||(F(p0)&&G(p1)))))))))'
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 499 transition count 696
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 499 transition count 696
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 496 transition count 692
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 691
Applied a total of 44 rules in 27 ms. Remains 495 /517 variables (removed 22) and now considering 691/715 (removed 24) transitions.
// Phase 1: matrix 691 rows 495 cols
[2024-06-02 22:56:10] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 22:56:10] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 22:56:10] [INFO ] Invariant cache hit.
[2024-06-02 22:56:11] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-06-02 22:56:11] [INFO ] Invariant cache hit.
[2024-06-02 22:56:11] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 495/517 places, 691/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 661 ms. Remains : 495/517 places, 691/715 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s107 1), p0:(NEQ s447 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 608 reset in 104 ms.
Product exploration explored 100000 steps with 1532 reset in 126 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1008 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 31 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 783216 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :{1=1}
Probabilistic random walk after 783216 steps, saw 147670 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :1
Running SMT prover for 2 properties.
[2024-06-02 22:56:15] [INFO ] Invariant cache hit.
[2024-06-02 22:56:15] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:56:16] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:56:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:56:16] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:56:16] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-06-02 22:56:16] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Applied a total of 0 rules in 12 ms. Remains 495 /495 variables (removed 0) and now considering 691/691 (removed 0) transitions.
[2024-06-02 22:56:17] [INFO ] Invariant cache hit.
[2024-06-02 22:56:17] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:56:17] [INFO ] Invariant cache hit.
[2024-06-02 22:56:17] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-06-02 22:56:17] [INFO ] Invariant cache hit.
[2024-06-02 22:56:17] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 645 ms. Remains : 495/495 places, 691/691 transitions.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1008 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 571 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 857306 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{1=1}
Probabilistic random walk after 857306 steps, saw 162804 distinct states, run finished after 3003 ms. (steps per millisecond=285 ) properties seen :1
Running SMT prover for 2 properties.
[2024-06-02 22:56:21] [INFO ] Invariant cache hit.
[2024-06-02 22:56:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:56:22] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:56:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:56:22] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:56:22] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-06-02 22:56:22] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 367 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2089 reset in 145 ms.
Product exploration explored 100000 steps with 927 reset in 116 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Graph (trivial) has 529 edges and 495 vertex of which 3 / 495 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1006 edges and 493 vertex of which 488 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 203 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 203 rules applied. Total rules applied 205 place count 488 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 206 place count 488 transition count 682
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 206 place count 488 transition count 685
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 488 transition count 685
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 271 place count 428 transition count 625
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 331 place count 428 transition count 625
Performed 105 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 436 place count 428 transition count 670
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 451 place count 428 transition count 655
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 548 place count 331 transition count 553
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 3 with 97 rules applied. Total rules applied 645 place count 331 transition count 553
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 646 place count 330 transition count 552
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 647 place count 330 transition count 552
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 648 place count 330 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 649 place count 330 transition count 551
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 651 place count 328 transition count 549
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 653 place count 328 transition count 549
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 328 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 656 place count 326 transition count 546
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 658 place count 326 transition count 546
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 660 place count 324 transition count 543
Deduced a syphon composed of 161 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 662 place count 324 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 663 place count 324 transition count 542
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 664 place count 323 transition count 541
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 665 place count 323 transition count 541
Performed 62 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 62 rules applied. Total rules applied 727 place count 323 transition count 847
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 782 place count 323 transition count 792
Discarding 106 places :
Symmetric choice reduction at 6 with 106 rule applications. Total rules 888 place count 217 transition count 493
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 6 with 106 rules applied. Total rules applied 994 place count 217 transition count 493
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 1024 place count 217 transition count 463
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 1091 place count 150 transition count 329
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 1158 place count 150 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1164 place count 150 transition count 323
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1177 place count 137 transition count 298
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 8 with 13 rules applied. Total rules applied 1190 place count 137 transition count 298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1194 place count 137 transition count 349
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1197 place count 134 transition count 343
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1200 place count 134 transition count 343
Deduced a syphon composed of 72 places in 0 ms
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 8 with 70 rules applied. Total rules applied 1270 place count 134 transition count 273
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1271 place count 133 transition count 272
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1272 place count 133 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1273 place count 133 transition count 293
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1275 place count 131 transition count 277
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1277 place count 131 transition count 277
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 1277 rules in 150 ms. Remains 131 /495 variables (removed 364) and now considering 277/691 (removed 414) transitions.
[2024-06-02 22:56:24] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 22:56:24] [INFO ] Flow matrix only has 259 transitions (discarded 18 similar events)
// Phase 1: matrix 259 rows 131 cols
[2024-06-02 22:56:24] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:56:24] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/495 places, 277/691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 131/495 places, 277/691 transitions.
Built C files in :
/tmp/ltsmin2521769628520848278
[2024-06-02 22:56:24] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2521769628520848278
Running compilation step : cd /tmp/ltsmin2521769628520848278;'/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 943 ms.
Running link step : cd /tmp/ltsmin2521769628520848278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2521769628520848278;'/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/stateBased13838717275397872985.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Applied a total of 0 rules in 17 ms. Remains 495 /495 variables (removed 0) and now considering 691/691 (removed 0) transitions.
// Phase 1: matrix 691 rows 495 cols
[2024-06-02 22:56:39] [INFO ] Computed 5 invariants in 9 ms
[2024-06-02 22:56:39] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 22:56:39] [INFO ] Invariant cache hit.
[2024-06-02 22:56:40] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-06-02 22:56:40] [INFO ] Invariant cache hit.
[2024-06-02 22:56:40] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 687 ms. Remains : 495/495 places, 691/691 transitions.
Built C files in :
/tmp/ltsmin11013860609068696559
[2024-06-02 22:56:40] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11013860609068696559
Running compilation step : cd /tmp/ltsmin11013860609068696559;'/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 962 ms.
Running link step : cd /tmp/ltsmin11013860609068696559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11013860609068696559;'/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/stateBased10812766056200206927.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:56:55] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:56:55] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:56:55] [INFO ] Time to serialize gal into /tmp/LTL5878484949816577310.gal : 6 ms
[2024-06-02 22:56:55] [INFO ] Time to serialize properties into /tmp/LTL5932908007405150960.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/LTL5878484949816577310.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9741986456326760953.hoa' '-atoms' '/tmp/LTL5932908007405150960.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/LTL5932908007405150960.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9741986456326760953.hoa
Detected timeout of ITS tools.
[2024-06-02 22:57:10] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:57:10] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:57:10] [INFO ] Time to serialize gal into /tmp/LTL13925606368523756001.gal : 4 ms
[2024-06-02 22:57:10] [INFO ] Time to serialize properties into /tmp/LTL9722325474092714180.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/LTL13925606368523756001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9722325474092714180.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F((G(F("(p1043!=1)")))||((F("(p1043!=1)"))&&(G("(p332!=1)"))))))))))
Formula 0 simplified : XXXXG(FG!"(p1043!=1)" & (G!"(p1043!=1)" | F!"(p332!=1)"))
Detected timeout of ITS tools.
[2024-06-02 22:57:25] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:57:25] [INFO ] Applying decomposition
[2024-06-02 22:57:25] [INFO ] Flatten gal took : 31 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/graph12225178485713989635.txt' '-o' '/tmp/graph12225178485713989635.bin' '-w' '/tmp/graph12225178485713989635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12225178485713989635.bin' '-l' '-1' '-v' '-w' '/tmp/graph12225178485713989635.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:57:26] [INFO ] Decomposing Gal with order
[2024-06-02 22:57:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:57:26] [INFO ] Removed a total of 419 redundant transitions.
[2024-06-02 22:57:26] [INFO ] Flatten gal took : 227 ms
[2024-06-02 22:57:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 23 ms.
[2024-06-02 22:57:26] [INFO ] Time to serialize gal into /tmp/LTL1829642760721095322.gal : 10 ms
[2024-06-02 22:57:26] [INFO ] Time to serialize properties into /tmp/LTL15351460432769833381.ltl : 188 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/LTL1829642760721095322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15351460432769833381.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(X(F((G(F("(i19.u168.p1043!=1)")))||((F("(i19.u168.p1043!=1)"))&&(G("(i5.i0.i3.u36.p332!=1)"))))))))))
Formula 0 simplified : XXXXG(FG!"(i19.u168.p1043!=1)" & (G!"(i19.u168.p1043!=1)" | F!"(i5.i0.i3.u36.p332!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t19, t30, t54, t86, t95, t96, t141, t190, t258, t273, t366, t375, t421, t467, t509, t540, t56...1126
Computing Next relation with stutter on 1.176e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17274338869443656430
[2024-06-02 22:57:41] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17274338869443656430
Running compilation step : cd /tmp/ltsmin17274338869443656430;'/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 954 ms.
Running link step : cd /tmp/ltsmin17274338869443656430;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17274338869443656430;'/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' '--ltl' 'X(X(X(X(<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[]((LTLAPp1==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CO4-PT-20-LTLFireability-14 finished in 106140 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 (X(p1) U G((p0 U p2))))))'
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 705
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 705
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 499 transition count 696
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 499 transition count 696
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 497 transition count 693
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 497 transition count 693
Applied a total of 40 rules in 32 ms. Remains 497 /517 variables (removed 20) and now considering 693/715 (removed 22) transitions.
// Phase 1: matrix 693 rows 497 cols
[2024-06-02 22:57:57] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 22:57:57] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 22:57:57] [INFO ] Invariant cache hit.
[2024-06-02 22:57:57] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-06-02 22:57:57] [INFO ] Invariant cache hit.
[2024-06-02 22:57:57] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 497/517 places, 693/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 725 ms. Remains : 497/517 places, 693/715 transitions.
Stuttering acceptance computed with spot in 466 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : CO4-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(OR p2 p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 9}, { cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=10 dest: 9}, { cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s231 1), p2:(EQ s158 1), p1:(NEQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24898 reset in 308 ms.
Product exploration explored 100000 steps with 25064 reset in 327 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1005 edges and 497 vertex of which 492 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (OR p2 p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 163 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 537 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 208 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-06-02 22:57:59] [INFO ] Invariant cache hit.
[2024-06-02 22:57:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:00] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:58:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:58:00] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:58:00] [INFO ] After 408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-06-02 22:58:00] [INFO ] After 631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 693/693 transitions.
Graph (trivial) has 530 edges and 497 vertex of which 3 / 497 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1002 edges and 495 vertex of which 478 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 478 transition count 440
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 213 rules applied. Total rules applied 451 place count 267 transition count 438
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 454 place count 266 transition count 436
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 456 place count 264 transition count 436
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 456 place count 264 transition count 387
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 554 place count 215 transition count 387
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 557 place count 212 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 560 place count 212 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 563 place count 212 transition count 381
Performed 76 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 715 place count 136 transition count 283
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 725 place count 136 transition count 273
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 733 place count 128 transition count 260
Iterating global reduction 6 with 8 rules applied. Total rules applied 741 place count 128 transition count 260
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 749 place count 124 transition count 256
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 750 place count 124 transition count 255
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 751 place count 123 transition count 253
Iterating global reduction 7 with 1 rules applied. Total rules applied 752 place count 123 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 753 place count 123 transition count 252
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 829 place count 85 transition count 292
Drop transitions removed 61 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 8 with 79 rules applied. Total rules applied 908 place count 85 transition count 213
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 935 place count 58 transition count 150
Iterating global reduction 9 with 27 rules applied. Total rules applied 962 place count 58 transition count 150
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 980 place count 58 transition count 132
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 987 place count 51 transition count 103
Iterating global reduction 10 with 7 rules applied. Total rules applied 994 place count 51 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 999 place count 51 transition count 98
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1004 place count 51 transition count 93
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1005 place count 50 transition count 91
Iterating global reduction 11 with 1 rules applied. Total rules applied 1006 place count 50 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1007 place count 50 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1009 place count 49 transition count 100
Free-agglomeration rule applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 1020 place count 49 transition count 89
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1033 place count 38 transition count 87
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1036 place count 38 transition count 87
Graph (complete) has 155 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 13 with 1 rules applied. Total rules applied 1037 place count 37 transition count 87
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1040 place count 37 transition count 84
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1043 place count 37 transition count 84
Graph (complete) has 147 edges and 37 vertex of which 36 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 15 with 1 rules applied. Total rules applied 1044 place count 36 transition count 84
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1047 place count 36 transition count 81
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 1050 place count 36 transition count 81
Graph (complete) has 139 edges and 36 vertex of which 35 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 17 with 1 rules applied. Total rules applied 1051 place count 35 transition count 81
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1054 place count 35 transition count 78
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 1057 place count 35 transition count 78
Graph (complete) has 131 edges and 35 vertex of which 34 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 19 with 1 rules applied. Total rules applied 1058 place count 34 transition count 78
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1061 place count 34 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 1064 place count 34 transition count 75
Graph (complete) has 123 edges and 34 vertex of which 33 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 21 with 1 rules applied. Total rules applied 1065 place count 33 transition count 75
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1068 place count 33 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1069 place count 32 transition count 71
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t376.t380.t568.t600 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 18 edges and 28 vertex of which 3 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 23 with 5 rules applied. Total rules applied 1074 place count 26 transition count 67
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 24 edges and 20 vertex of which 11 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 24 with 18 rules applied. Total rules applied 1092 place count 11 transition count 56
Drop transitions removed 28 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 25 with 36 rules applied. Total rules applied 1128 place count 11 transition count 20
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 26 with 4 rules applied. Total rules applied 1132 place count 11 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1133 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 1134 place count 10 transition count 15
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 27 with 2 rules applied. Total rules applied 1136 place count 10 transition count 15
Applied a total of 1136 rules in 49 ms. Remains 10 /497 variables (removed 487) and now considering 15/693 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 10/497 places, 15/693 transitions.
Finished random walk after 6691 steps, including 2 resets, run visited all 4 properties in 22 ms. (steps per millisecond=304 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (OR p2 p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (OR p0 p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (OR (AND p0 p1) (AND p2 p1)))]
Knowledge based reduction with 14 factoid took 640 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 427 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 421 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
[2024-06-02 22:58:02] [INFO ] Invariant cache hit.
[2024-06-02 22:58:02] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:58:02] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-02 22:58:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:58:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:58:03] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-02 22:58:03] [INFO ] Computed and/alt/rep : 674/1230/674 causal constraints (skipped 18 transitions) in 52 ms.
[2024-06-02 22:58:09] [INFO ] Added : 614 causal constraints over 125 iterations in 6012 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 693/693 transitions.
Applied a total of 0 rules in 5 ms. Remains 497 /497 variables (removed 0) and now considering 693/693 (removed 0) transitions.
[2024-06-02 22:58:09] [INFO ] Invariant cache hit.
[2024-06-02 22:58:09] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 22:58:09] [INFO ] Invariant cache hit.
[2024-06-02 22:58:09] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-06-02 22:58:09] [INFO ] Invariant cache hit.
[2024-06-02 22:58:09] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 497/497 places, 693/693 transitions.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1005 edges and 497 vertex of which 492 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR p0 p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 205 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-06-02 22:58:10] [INFO ] Invariant cache hit.
[2024-06-02 22:58:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:10] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 22:58:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:58:11] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 22:58:11] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-06-02 22:58:11] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 693/693 transitions.
Graph (trivial) has 530 edges and 497 vertex of which 3 / 497 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1002 edges and 495 vertex of which 478 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 478 transition count 440
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 213 rules applied. Total rules applied 451 place count 267 transition count 438
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 454 place count 266 transition count 436
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 456 place count 264 transition count 436
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 456 place count 264 transition count 387
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 554 place count 215 transition count 387
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 557 place count 212 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 560 place count 212 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 563 place count 212 transition count 381
Performed 76 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 715 place count 136 transition count 283
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 725 place count 136 transition count 273
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 733 place count 128 transition count 260
Iterating global reduction 6 with 8 rules applied. Total rules applied 741 place count 128 transition count 260
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 749 place count 124 transition count 256
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 750 place count 124 transition count 255
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 751 place count 123 transition count 253
Iterating global reduction 7 with 1 rules applied. Total rules applied 752 place count 123 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 753 place count 123 transition count 252
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 829 place count 85 transition count 292
Drop transitions removed 61 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 8 with 79 rules applied. Total rules applied 908 place count 85 transition count 213
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 935 place count 58 transition count 150
Iterating global reduction 9 with 27 rules applied. Total rules applied 962 place count 58 transition count 150
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 980 place count 58 transition count 132
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 987 place count 51 transition count 103
Iterating global reduction 10 with 7 rules applied. Total rules applied 994 place count 51 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 999 place count 51 transition count 98
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1004 place count 51 transition count 93
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1005 place count 50 transition count 91
Iterating global reduction 11 with 1 rules applied. Total rules applied 1006 place count 50 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1007 place count 50 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1009 place count 49 transition count 100
Free-agglomeration rule applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 1020 place count 49 transition count 89
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1033 place count 38 transition count 87
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1036 place count 38 transition count 87
Graph (complete) has 155 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 13 with 1 rules applied. Total rules applied 1037 place count 37 transition count 87
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1040 place count 37 transition count 84
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1043 place count 37 transition count 84
Graph (complete) has 147 edges and 37 vertex of which 36 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 15 with 1 rules applied. Total rules applied 1044 place count 36 transition count 84
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1047 place count 36 transition count 81
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 1050 place count 36 transition count 81
Graph (complete) has 139 edges and 36 vertex of which 35 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 17 with 1 rules applied. Total rules applied 1051 place count 35 transition count 81
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1054 place count 35 transition count 78
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 1057 place count 35 transition count 78
Graph (complete) has 131 edges and 35 vertex of which 34 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 19 with 1 rules applied. Total rules applied 1058 place count 34 transition count 78
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1061 place count 34 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 1064 place count 34 transition count 75
Graph (complete) has 123 edges and 34 vertex of which 33 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 21 with 1 rules applied. Total rules applied 1065 place count 33 transition count 75
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1068 place count 33 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1069 place count 32 transition count 71
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t376.t380.t568.t600 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 18 edges and 28 vertex of which 3 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 23 with 5 rules applied. Total rules applied 1074 place count 26 transition count 67
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 24 edges and 20 vertex of which 11 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 24 with 18 rules applied. Total rules applied 1092 place count 11 transition count 56
Drop transitions removed 28 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 25 with 36 rules applied. Total rules applied 1128 place count 11 transition count 20
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 26 with 4 rules applied. Total rules applied 1132 place count 11 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1133 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 1134 place count 10 transition count 15
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 27 with 2 rules applied. Total rules applied 1136 place count 10 transition count 15
Applied a total of 1136 rules in 47 ms. Remains 10 /497 variables (removed 487) and now considering 15/693 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 10/497 places, 15/693 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :2
Finished Best-First random walk after 18 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR p0 p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (OR p0 p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (OR (AND p0 p1) (AND p2 p1)))]
Knowledge based reduction with 4 factoid took 344 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 344 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
[2024-06-02 22:58:12] [INFO ] Invariant cache hit.
[2024-06-02 22:58:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:58:13] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-06-02 22:58:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:58:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:58:13] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-06-02 22:58:13] [INFO ] Computed and/alt/rep : 674/1230/674 causal constraints (skipped 18 transitions) in 41 ms.
[2024-06-02 22:58:19] [INFO ] Added : 614 causal constraints over 125 iterations in 5847 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 372 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 20022 reset in 263 ms.
Product exploration explored 100000 steps with 19971 reset in 264 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 475 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 693/693 transitions.
Graph (trivial) has 530 edges and 497 vertex of which 3 / 497 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1003 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 204 rules applied. Total rules applied 206 place count 490 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 207 place count 490 transition count 684
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 207 place count 490 transition count 687
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 490 transition count 687
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 274 place count 429 transition count 626
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 335 place count 429 transition count 626
Performed 105 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 440 place count 429 transition count 681
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 456 place count 429 transition count 665
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 552 place count 333 transition count 564
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 96 rules applied. Total rules applied 648 place count 333 transition count 564
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 649 place count 332 transition count 563
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 650 place count 332 transition count 563
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 651 place count 332 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 652 place count 332 transition count 562
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 654 place count 330 transition count 560
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 656 place count 330 transition count 560
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 657 place count 330 transition count 560
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 659 place count 328 transition count 557
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 661 place count 328 transition count 557
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 663 place count 326 transition count 554
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 665 place count 326 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 666 place count 326 transition count 553
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 667 place count 325 transition count 552
Deduced a syphon composed of 162 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 668 place count 325 transition count 552
Performed 60 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 60 rules applied. Total rules applied 728 place count 325 transition count 853
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 784 place count 325 transition count 797
Discarding 99 places :
Symmetric choice reduction at 6 with 99 rule applications. Total rules 883 place count 226 transition count 526
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 6 with 99 rules applied. Total rules applied 982 place count 226 transition count 526
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 1010 place count 226 transition count 498
Discarding 63 places :
Symmetric choice reduction at 7 with 63 rule applications. Total rules 1073 place count 163 transition count 370
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 7 with 63 rules applied. Total rules applied 1136 place count 163 transition count 370
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1144 place count 163 transition count 362
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1157 place count 150 transition count 337
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 13 rules applied. Total rules applied 1170 place count 150 transition count 337
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1173 place count 150 transition count 388
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1183 place count 150 transition count 378
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1188 place count 145 transition count 356
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 1193 place count 145 transition count 356
Deduced a syphon composed of 78 places in 0 ms
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 9 with 48 rules applied. Total rules applied 1241 place count 145 transition count 308
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1242 place count 144 transition count 307
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1243 place count 144 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1244 place count 144 transition count 328
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1246 place count 142 transition count 312
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1248 place count 142 transition count 312
Deduced a syphon composed of 76 places in 0 ms
Applied a total of 1248 rules in 94 ms. Remains 142 /497 variables (removed 355) and now considering 312/693 (removed 381) transitions.
[2024-06-02 22:58:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:58:20] [INFO ] Flow matrix only has 293 transitions (discarded 19 similar events)
// Phase 1: matrix 293 rows 142 cols
[2024-06-02 22:58:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:58:21] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/497 places, 312/693 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 142/497 places, 312/693 transitions.
Built C files in :
/tmp/ltsmin2271386965493771863
[2024-06-02 22:58:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2271386965493771863
Running compilation step : cd /tmp/ltsmin2271386965493771863;'/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 985 ms.
Running link step : cd /tmp/ltsmin2271386965493771863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2271386965493771863;'/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/stateBased16436152963438475263.hoa' '--buchi-type=spotba'
LTSmin run took 166 ms.
FORMULA CO4-PT-20-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-20-LTLFireability-15 finished in 25351 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(X(F((G(F(p0))||(F(p0)&&G(p1)))))))))'
Found a Shortening insensitive property : CO4-PT-20-LTLFireability-14
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 517/517 places, 715/715 transitions.
Graph (trivial) has 548 edges and 517 vertex of which 3 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1039 edges and 515 vertex of which 508 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 507 transition count 489
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 220 rules applied. Total rules applied 437 place count 292 transition count 484
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 441 place count 289 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 442 place count 288 transition count 483
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 442 place count 288 transition count 435
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 538 place count 240 transition count 435
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 541 place count 237 transition count 432
Iterating global reduction 4 with 3 rules applied. Total rules applied 544 place count 237 transition count 432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 544 place count 237 transition count 430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 548 place count 235 transition count 430
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 550 place count 233 transition count 426
Iterating global reduction 4 with 2 rules applied. Total rules applied 552 place count 233 transition count 426
Performed 82 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 716 place count 151 transition count 321
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 727 place count 151 transition count 310
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 735 place count 143 transition count 297
Iterating global reduction 5 with 8 rules applied. Total rules applied 743 place count 143 transition count 297
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 5 with 2 rules applied. Total rules applied 745 place count 142 transition count 296
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 746 place count 141 transition count 294
Iterating global reduction 5 with 1 rules applied. Total rules applied 747 place count 141 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 748 place count 141 transition count 293
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 830 place count 100 transition count 339
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 850 place count 100 transition count 319
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 878 place count 72 transition count 207
Iterating global reduction 7 with 28 rules applied. Total rules applied 906 place count 72 transition count 207
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 924 place count 72 transition count 189
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 931 place count 65 transition count 151
Iterating global reduction 8 with 7 rules applied. Total rules applied 938 place count 65 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 942 place count 65 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 950 place count 61 transition count 188
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 959 place count 61 transition count 179
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 961 place count 61 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 963 place count 61 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 965 place count 59 transition count 175
Applied a total of 965 rules in 44 ms. Remains 59 /517 variables (removed 458) and now considering 175/715 (removed 540) transitions.
[2024-06-02 22:58:22] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
// Phase 1: matrix 145 rows 59 cols
[2024-06-02 22:58:22] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:58:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 22:58:22] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 22:58:22] [INFO ] Invariant cache hit.
[2024-06-02 22:58:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:58:22] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-06-02 22:58:22] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 22:58:22] [INFO ] Invariant cache hit.
[2024-06-02 22:58:22] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 59/517 places, 175/715 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 227 ms. Remains : 59/517 places, 175/715 transitions.
Running random walk in product with property : CO4-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s6 1), p0:(NEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 268 reset in 44 ms.
Product exploration explored 100000 steps with 442 reset in 51 ms.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 826 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:58:23] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 22:58:23] [INFO ] Invariant cache hit.
[2024-06-02 22:58:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:23] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:58:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:23] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:58:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:58:23] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:58:23] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-06-02 22:58:23] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 175/175 transitions.
Graph (complete) has 204 edges and 59 vertex of which 49 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 49 transition count 141
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 46 transition count 133
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 46 transition count 133
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 53 place count 46 transition count 120
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 63 place count 46 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 45 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 45 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 45 transition count 105
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 78 place count 45 transition count 93
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 15 edges and 31 vertex of which 3 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 97 place count 29 transition count 89
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 102 place count 29 transition count 84
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 103 place count 28 transition count 80
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 28 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 28 transition count 79
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 6 with 6 rules applied. Total rules applied 111 place count 25 transition count 76
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 70 edges and 25 vertex of which 20 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 4 rules applied. Total rules applied 115 place count 20 transition count 73
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 130 place count 20 transition count 58
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 139 place count 20 transition count 49
Graph (complete) has 43 edges and 20 vertex of which 19 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 8 with 1 rules applied. Total rules applied 140 place count 19 transition count 49
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 143 place count 19 transition count 46
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 144 place count 18 transition count 43
Iterating global reduction 10 with 1 rules applied. Total rules applied 145 place count 18 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 146 place count 18 transition count 42
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 147 place count 17 transition count 39
Iterating global reduction 11 with 1 rules applied. Total rules applied 148 place count 17 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 149 place count 17 transition count 38
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 151 place count 17 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 153 place count 15 transition count 36
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 155 place count 15 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 156 place count 15 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 157 place count 15 transition count 33
Applied a total of 157 rules in 19 ms. Remains 15 /59 variables (removed 44) and now considering 33/175 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 15/59 places, 33/175 transitions.
Finished random walk after 118 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=118 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 175/175 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-06-02 22:58:24] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 22:58:24] [INFO ] Invariant cache hit.
[2024-06-02 22:58:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 22:58:24] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 22:58:24] [INFO ] Invariant cache hit.
[2024-06-02 22:58:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:58:24] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-06-02 22:58:24] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 22:58:24] [INFO ] Invariant cache hit.
[2024-06-02 22:58:24] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 59/59 places, 175/175 transitions.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 831 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:58:24] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2024-06-02 22:58:24] [INFO ] Invariant cache hit.
[2024-06-02 22:58:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:24] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:58:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:58:25] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:58:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:58:25] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:58:25] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-06-02 22:58:25] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 175/175 transitions.
Graph (complete) has 204 edges and 59 vertex of which 49 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 49 transition count 141
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 46 transition count 133
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 46 transition count 133
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 53 place count 46 transition count 120
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 63 place count 46 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 45 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 45 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 45 transition count 105
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 78 place count 45 transition count 93
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 15 edges and 31 vertex of which 3 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 97 place count 29 transition count 89
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 102 place count 29 transition count 84
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 103 place count 28 transition count 80
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 28 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 28 transition count 79
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 6 with 6 rules applied. Total rules applied 111 place count 25 transition count 76
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 70 edges and 25 vertex of which 20 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 4 rules applied. Total rules applied 115 place count 20 transition count 73
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 130 place count 20 transition count 58
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 139 place count 20 transition count 49
Graph (complete) has 43 edges and 20 vertex of which 19 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 8 with 1 rules applied. Total rules applied 140 place count 19 transition count 49
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 143 place count 19 transition count 46
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 144 place count 18 transition count 43
Iterating global reduction 10 with 1 rules applied. Total rules applied 145 place count 18 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 146 place count 18 transition count 42
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 147 place count 17 transition count 39
Iterating global reduction 11 with 1 rules applied. Total rules applied 148 place count 17 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 149 place count 17 transition count 38
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 151 place count 17 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 153 place count 15 transition count 36
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 155 place count 15 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 156 place count 15 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 157 place count 15 transition count 33
Applied a total of 157 rules in 11 ms. Remains 15 /59 variables (removed 44) and now considering 33/175 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 15/59 places, 33/175 transitions.
Finished random walk after 83 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 254 reset in 51 ms.
Product exploration explored 100000 steps with 282 reset in 47 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 363 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 175/175 transitions.
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 37 place count 59 transition count 138
Applied a total of 37 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 138/175 (removed 37) transitions.
[2024-06-02 22:58:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:58:26] [INFO ] Flow matrix only has 110 transitions (discarded 28 similar events)
// Phase 1: matrix 110 rows 59 cols
[2024-06-02 22:58:26] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:58:26] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/59 places, 138/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 59/59 places, 138/175 transitions.
Built C files in :
/tmp/ltsmin5744204302853516197
[2024-06-02 22:58:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5744204302853516197
Running compilation step : cd /tmp/ltsmin5744204302853516197;'/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 272 ms.
Running link step : cd /tmp/ltsmin5744204302853516197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5744204302853516197;'/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/stateBased13501861116564661740.hoa' '--buchi-type=spotba'
LTSmin run took 272 ms.
Treatment of property CO4-PT-20-LTLFireability-14 finished in 4921 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-02 22:58:27] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17028916552616100831
[2024-06-02 22:58:27] [INFO ] Computing symmetric may disable matrix : 715 transitions.
[2024-06-02 22:58:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:58:27] [INFO ] Computing symmetric may enable matrix : 715 transitions.
[2024-06-02 22:58:27] [INFO ] Applying decomposition
[2024-06-02 22:58:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:58:27] [INFO ] Flatten gal took : 18 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/graph6766710649657386651.txt' '-o' '/tmp/graph6766710649657386651.bin' '-w' '/tmp/graph6766710649657386651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6766710649657386651.bin' '-l' '-1' '-v' '-w' '/tmp/graph6766710649657386651.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:58:27] [INFO ] Decomposing Gal with order
[2024-06-02 22:58:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:58:27] [INFO ] Removed a total of 427 redundant transitions.
[2024-06-02 22:58:27] [INFO ] Flatten gal took : 39 ms
[2024-06-02 22:58:27] [INFO ] Computing Do-Not-Accords matrix : 715 transitions.
[2024-06-02 22:58:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 7 ms.
[2024-06-02 22:58:27] [INFO ] Time to serialize gal into /tmp/LTLFireability1400868901906836727.gal : 6 ms
[2024-06-02 22:58:27] [INFO ] Time to serialize properties into /tmp/LTLFireability14724511604738050089.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1400868901906836727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14724511604738050089.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...277
Read 1 LTL properties
[2024-06-02 22:58:27] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:58:27] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17028916552616100831
Running compilation step : cd /tmp/ltsmin17028916552616100831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Checking formula 0 : !((X(X(X(X(F((G(F("(i19.u186.p1043!=1)")))||((F("(i19.u186.p1043!=1)"))&&(G("(i2.i1.i2.u42.p332!=1)"))))))))))
Formula 0 simplified : XXXXG(FG!"(i19.u186.p1043!=1)" & (G!"(i19.u186.p1043!=1)" | F!"(i2.i1.i2.u42.p332!=1)"))
Compilation finished in 1634 ms.
Running link step : cd /tmp/ltsmin17028916552616100831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17028916552616100831;'/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' '--ltl' 'X(X(X(X(<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[]((LTLAPp1==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t19, t30, t54, t95, t96, t178, t273, t341, t366, t375, t421, t500, t568, t569, t604, t605, t6...1158
Computing Next relation with stutter on 1.2432e+06 deadlock states
97 unique states visited
97 strongly connected components in search stack
98 transitions explored
97 items max in DFS search stack
10767 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,107.731,1808852,1,0,3.0384e+06,11971,8700,1.20261e+07,657,114029,2622016
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-20-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 436841 ms.

BK_STOP 1717369387931

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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-20"
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-20, 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-171734910200098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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