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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 239K 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-18-LTLFireability-00
FORMULA_NAME CO4-PT-18-LTLFireability-01
FORMULA_NAME CO4-PT-18-LTLFireability-02
FORMULA_NAME CO4-PT-18-LTLFireability-03
FORMULA_NAME CO4-PT-18-LTLFireability-04
FORMULA_NAME CO4-PT-18-LTLFireability-05
FORMULA_NAME CO4-PT-18-LTLFireability-06
FORMULA_NAME CO4-PT-18-LTLFireability-07
FORMULA_NAME CO4-PT-18-LTLFireability-08
FORMULA_NAME CO4-PT-18-LTLFireability-09
FORMULA_NAME CO4-PT-18-LTLFireability-10
FORMULA_NAME CO4-PT-18-LTLFireability-11
FORMULA_NAME CO4-PT-18-LTLFireability-12
FORMULA_NAME CO4-PT-18-LTLFireability-13
FORMULA_NAME CO4-PT-18-LTLFireability-14
FORMULA_NAME CO4-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368829843

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-18
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:53:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:53:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:53:51] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-02 22:53:51] [INFO ] Transformed 979 places.
[2024-06-02 22:53:51] [INFO ] Transformed 1111 transitions.
[2024-06-02 22:53:51] [INFO ] Found NUPN structural information;
[2024-06-02 22:53:51] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 150 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 157 places in 14 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-18-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 808 transition count 931
Discarding 129 places :
Symmetric choice reduction at 1 with 129 rule applications. Total rules 146 place count 679 transition count 800
Iterating global reduction 1 with 129 rules applied. Total rules applied 275 place count 679 transition count 800
Discarding 112 places :
Symmetric choice reduction at 1 with 112 rule applications. Total rules 387 place count 567 transition count 688
Iterating global reduction 1 with 112 rules applied. Total rules applied 499 place count 567 transition count 688
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 502 place count 567 transition count 685
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 556 place count 513 transition count 631
Iterating global reduction 2 with 54 rules applied. Total rules applied 610 place count 513 transition count 631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 611 place count 513 transition count 630
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 644 place count 480 transition count 597
Iterating global reduction 3 with 33 rules applied. Total rules applied 677 place count 480 transition count 597
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 680 place count 480 transition count 594
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 697 place count 463 transition count 577
Iterating global reduction 4 with 17 rules applied. Total rules applied 714 place count 463 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 715 place count 463 transition count 576
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 721 place count 457 transition count 570
Iterating global reduction 5 with 6 rules applied. Total rules applied 727 place count 457 transition count 570
Applied a total of 727 rules in 223 ms. Remains 457 /822 variables (removed 365) and now considering 570/934 (removed 364) transitions.
// Phase 1: matrix 570 rows 457 cols
[2024-06-02 22:53:52] [INFO ] Computed 5 invariants in 39 ms
[2024-06-02 22:53:52] [INFO ] Implicit Places using invariants in 269 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 515 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/822 places, 570/934 transitions.
Applied a total of 0 rules in 13 ms. Remains 456 /456 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 752 ms. Remains : 456/822 places, 570/934 transitions.
Support contains 24 out of 456 places after structural reductions.
[2024-06-02 22:53:52] [INFO ] Flatten gal took : 71 ms
[2024-06-02 22:53:52] [INFO ] Flatten gal took : 31 ms
[2024-06-02 22:53:52] [INFO ] Input system was already deterministic with 570 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 570 rows 456 cols
[2024-06-02 22:53:53] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 22:53:54] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-06-02 22:53:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:55] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-06-02 22:53:55] [INFO ] After 1214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 393 ms.
[2024-06-02 22:53:56] [INFO ] After 2124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 16 properties in 88 ms.
Support contains 3 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 570/570 transitions.
Graph (trivial) has 485 edges and 456 vertex of which 3 / 456 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 715 edges and 454 vertex of which 439 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 225 rules applied. Total rules applied 227 place count 439 transition count 331
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 209 rules applied. Total rules applied 436 place count 232 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 437 place count 231 transition count 329
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 437 place count 231 transition count 285
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 525 place count 187 transition count 285
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 528 place count 184 transition count 282
Iterating global reduction 3 with 3 rules applied. Total rules applied 531 place count 184 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 532 place count 184 transition count 281
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 534 place count 182 transition count 279
Iterating global reduction 4 with 2 rules applied. Total rules applied 536 place count 182 transition count 279
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 4 with 2 rules applied. Total rules applied 538 place count 182 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 539 place count 181 transition count 277
Performed 69 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 677 place count 112 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 683 place count 112 transition count 186
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 690 place count 105 transition count 179
Iterating global reduction 7 with 7 rules applied. Total rules applied 697 place count 105 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 698 place count 105 transition count 178
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 704 place count 102 transition count 175
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 708 place count 102 transition count 171
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 712 place count 98 transition count 167
Iterating global reduction 9 with 4 rules applied. Total rules applied 716 place count 98 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 717 place count 98 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 721 place count 96 transition count 164
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 723 place count 96 transition count 162
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 725 place count 94 transition count 160
Iterating global reduction 11 with 2 rules applied. Total rules applied 727 place count 94 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 728 place count 94 transition count 159
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 729 place count 93 transition count 158
Iterating global reduction 12 with 1 rules applied. Total rules applied 730 place count 93 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 731 place count 93 transition count 157
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 13 with 56 rules applied. Total rules applied 787 place count 65 transition count 159
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 13 with 36 rules applied. Total rules applied 823 place count 65 transition count 123
Discarding 25 places :
Symmetric choice reduction at 14 with 25 rule applications. Total rules 848 place count 40 transition count 87
Iterating global reduction 14 with 25 rules applied. Total rules applied 873 place count 40 transition count 87
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 14 with 20 rules applied. Total rules applied 893 place count 40 transition count 67
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 896 place count 37 transition count 59
Iterating global reduction 15 with 3 rules applied. Total rules applied 899 place count 37 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 902 place count 37 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 904 place count 36 transition count 64
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 907 place count 36 transition count 61
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 911 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 912 place count 35 transition count 56
Iterating global reduction 17 with 1 rules applied. Total rules applied 913 place count 35 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 914 place count 35 transition count 55
Free-agglomeration rule applied 5 times.
Iterating global reduction 18 with 5 rules applied. Total rules applied 919 place count 35 transition count 50
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 926 place count 30 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 927 place count 30 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 928 place count 29 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 930 place count 27 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 934 place count 25 transition count 45
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 937 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 938 place count 24 transition count 41
Iterating global reduction 21 with 1 rules applied. Total rules applied 939 place count 24 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 940 place count 24 transition count 40
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 942 place count 24 transition count 38
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 943 place count 23 transition count 36
Iterating global reduction 22 with 1 rules applied. Total rules applied 944 place count 23 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 945 place count 23 transition count 35
Free-agglomeration rule applied 2 times.
Iterating global reduction 23 with 2 rules applied. Total rules applied 947 place count 23 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 949 place count 21 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 950 place count 21 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 951 place count 21 transition count 32
Applied a total of 951 rules in 130 ms. Remains 21 /456 variables (removed 435) and now considering 32/570 (removed 538) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 21/456 places, 32/570 transitions.
Finished random walk after 44 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 718 edges and 456 vertex of which 451 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 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(F(p0)))'
Support contains 1 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 446 transition count 560
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 446 transition count 560
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 439 transition count 553
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 436 transition count 549
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 436 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 434 transition count 547
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 434 transition count 547
Applied a total of 45 rules in 39 ms. Remains 434 /456 variables (removed 22) and now considering 547/570 (removed 23) transitions.
// Phase 1: matrix 547 rows 434 cols
[2024-06-02 22:53:56] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:53:56] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-02 22:53:56] [INFO ] Invariant cache hit.
[2024-06-02 22:53:57] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-06-02 22:53:57] [INFO ] Invariant cache hit.
[2024-06-02 22:53:57] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/456 places, 547/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 766 ms. Remains : 434/456 places, 547/570 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 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s270 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 691 edges and 434 vertex of which 429 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLFireability-00 finished in 1810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(p1)))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 562
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 442 transition count 556
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 442 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 442 transition count 555
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 440 transition count 553
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 440 transition count 553
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 439 transition count 552
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 439 transition count 552
Applied a total of 35 rules in 42 ms. Remains 439 /456 variables (removed 17) and now considering 552/570 (removed 18) transitions.
// Phase 1: matrix 552 rows 439 cols
[2024-06-02 22:53:58] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:53:58] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-02 22:53:58] [INFO ] Invariant cache hit.
[2024-06-02 22:53:59] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-06-02 22:53:59] [INFO ] Invariant cache hit.
[2024-06-02 22:53:59] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/456 places, 552/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 830 ms. Remains : 439/456 places, 552/570 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), true]
Running random walk in product with property : CO4-PT-18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s183 1), p0:(EQ s174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 270 ms.
Product exploration explored 100000 steps with 33333 reset in 321 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 696 edges and 439 vertex of which 434 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 79 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLFireability-01 finished in 1716 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((p0 U X(p1)))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 562
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 443 transition count 557
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 443 transition count 557
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 443 transition count 556
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 440 transition count 553
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 440 transition count 553
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 438 transition count 551
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 438 transition count 551
Applied a total of 37 rules in 32 ms. Remains 438 /456 variables (removed 18) and now considering 551/570 (removed 19) transitions.
// Phase 1: matrix 551 rows 438 cols
[2024-06-02 22:54:00] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 22:54:00] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 22:54:00] [INFO ] Invariant cache hit.
[2024-06-02 22:54:00] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-02 22:54:00] [INFO ] Invariant cache hit.
[2024-06-02 22:54:00] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/456 places, 551/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 438/456 places, 551/570 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-18-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(EQ s328 1), p1:(EQ s399 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CO4-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-03 finished in 794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Graph (trivial) has 488 edges and 456 vertex of which 3 / 456 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 716 edges and 454 vertex of which 449 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 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 201 place count 448 transition count 362
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 249 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 403 place count 248 transition count 360
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 403 place count 248 transition count 315
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 493 place count 203 transition count 315
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 496 place count 200 transition count 312
Iterating global reduction 3 with 3 rules applied. Total rules applied 499 place count 200 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 499 place count 200 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 501 place count 199 transition count 311
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 503 place count 197 transition count 309
Iterating global reduction 3 with 2 rules applied. Total rules applied 505 place count 197 transition count 309
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 3 with 2 rules applied. Total rules applied 507 place count 197 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 508 place count 196 transition count 307
Performed 73 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 654 place count 123 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 660 place count 123 transition count 208
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 667 place count 116 transition count 201
Iterating global reduction 6 with 7 rules applied. Total rules applied 674 place count 116 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 675 place count 116 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 679 place count 114 transition count 198
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 745 place count 81 transition count 200
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 765 place count 81 transition count 180
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 792 place count 54 transition count 126
Iterating global reduction 8 with 27 rules applied. Total rules applied 819 place count 54 transition count 126
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 837 place count 54 transition count 108
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 843 place count 48 transition count 91
Iterating global reduction 9 with 6 rules applied. Total rules applied 849 place count 48 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 854 place count 48 transition count 86
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 10 with 2 rules applied. Total rules applied 856 place count 47 transition count 96
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 871 place count 47 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 873 place count 45 transition count 79
Applied a total of 873 rules in 80 ms. Remains 45 /456 variables (removed 411) and now considering 79/570 (removed 491) transitions.
[2024-06-02 22:54:01] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
// Phase 1: matrix 72 rows 45 cols
[2024-06-02 22:54:01] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:54:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 22:54:01] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 22:54:01] [INFO ] Invariant cache hit.
[2024-06-02 22:54:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:54:01] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-06-02 22:54:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:54:01] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 22:54:01] [INFO ] Invariant cache hit.
[2024-06-02 22:54:01] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/456 places, 79/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 45/456 places, 79/570 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-18-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s7 0) (EQ s23 0)), p1:(EQ s7 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3 reset in 101 ms.
Product exploration explored 100000 steps with 11 reset in 90 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 398 steps, including 42 resets, run visited all 2 properties in 3 ms. (steps per millisecond=132 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 79/79 transitions.
Applied a total of 0 rules in 7 ms. Remains 45 /45 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2024-06-02 22:54:02] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 22:54:02] [INFO ] Invariant cache hit.
[2024-06-02 22:54:02] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 22:54:02] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 22:54:02] [INFO ] Invariant cache hit.
[2024-06-02 22:54:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:54:02] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-02 22:54:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:54:02] [INFO ] Flow matrix only has 72 transitions (discarded 7 similar events)
[2024-06-02 22:54:02] [INFO ] Invariant cache hit.
[2024-06-02 22:54:02] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 45/45 places, 79/79 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 105 steps, including 11 resets, run visited all 2 properties in 3 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 17 reset in 57 ms.
Product exploration explored 100000 steps with 2 reset in 164 ms.
Built C files in :
/tmp/ltsmin9818154499824384100
[2024-06-02 22:54:03] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2024-06-02 22:54:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:03] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2024-06-02 22:54:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:03] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2024-06-02 22:54:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:03] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9818154499824384100
Running compilation step : cd /tmp/ltsmin9818154499824384100;'/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 325 ms.
Running link step : cd /tmp/ltsmin9818154499824384100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9818154499824384100;'/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/stateBased14679901455971208568.hoa' '--buchi-type=spotba'
LTSmin run took 98 ms.
FORMULA CO4-PT-18-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLFireability-04 finished in 2722 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((p0&&X(G(p1)))))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 447 transition count 561
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 447 transition count 561
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 441 transition count 555
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 441 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 441 transition count 554
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 439 transition count 552
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 437 transition count 550
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 437 transition count 550
Applied a total of 39 rules in 41 ms. Remains 437 /456 variables (removed 19) and now considering 550/570 (removed 20) transitions.
// Phase 1: matrix 550 rows 437 cols
[2024-06-02 22:54:03] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 22:54:03] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 22:54:03] [INFO ] Invariant cache hit.
[2024-06-02 22:54:04] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 22:54:04] [INFO ] Invariant cache hit.
[2024-06-02 22:54:04] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 437/456 places, 550/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 437/456 places, 550/570 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(EQ s99 0), p1:(AND (NEQ s323 1) (NEQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 86 ms.
Product exploration explored 100000 steps with 5 reset in 114 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 694 edges and 437 vertex of which 432 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1353298 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :{1=1}
Probabilistic random walk after 1353298 steps, saw 261941 distinct states, run finished after 3002 ms. (steps per millisecond=450 ) properties seen :1
Running SMT prover for 1 properties.
[2024-06-02 22:54:08] [INFO ] Invariant cache hit.
[2024-06-02 22:54:08] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:54:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:08] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:54:08] [INFO ] After 176ms 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:54:08] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 550/550 transitions.
Graph (trivial) has 471 edges and 437 vertex of which 3 / 437 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 691 edges and 435 vertex of which 420 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 213 rules applied. Total rules applied 215 place count 420 transition count 323
Reduce places removed 195 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 197 rules applied. Total rules applied 412 place count 225 transition count 321
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 414 place count 224 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 223 transition count 320
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 415 place count 223 transition count 273
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 509 place count 176 transition count 273
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 510 place count 175 transition count 272
Iterating global reduction 4 with 1 rules applied. Total rules applied 511 place count 175 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 512 place count 175 transition count 271
Performed 67 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 646 place count 108 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 652 place count 108 transition count 182
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 659 place count 101 transition count 175
Iterating global reduction 6 with 7 rules applied. Total rules applied 666 place count 101 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 667 place count 101 transition count 174
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 673 place count 98 transition count 171
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 677 place count 98 transition count 167
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 681 place count 94 transition count 163
Iterating global reduction 8 with 4 rules applied. Total rules applied 685 place count 94 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 686 place count 94 transition count 162
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 9 with 6 rules applied. Total rules applied 692 place count 91 transition count 159
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 695 place count 91 transition count 156
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 698 place count 88 transition count 153
Iterating global reduction 10 with 3 rules applied. Total rules applied 701 place count 88 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 703 place count 88 transition count 151
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 704 place count 87 transition count 150
Iterating global reduction 11 with 1 rules applied. Total rules applied 705 place count 87 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 706 place count 87 transition count 149
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 12 with 54 rules applied. Total rules applied 760 place count 60 transition count 151
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 12 with 36 rules applied. Total rules applied 796 place count 60 transition count 115
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 820 place count 36 transition count 81
Iterating global reduction 13 with 24 rules applied. Total rules applied 844 place count 36 transition count 81
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 864 place count 36 transition count 61
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 867 place count 33 transition count 53
Iterating global reduction 14 with 3 rules applied. Total rules applied 870 place count 33 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 873 place count 33 transition count 50
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 15 with 2 rules applied. Total rules applied 875 place count 32 transition count 60
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 879 place count 32 transition count 56
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 884 place count 32 transition count 51
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 885 place count 31 transition count 50
Iterating global reduction 16 with 1 rules applied. Total rules applied 886 place count 31 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 887 place count 31 transition count 49
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 892 place count 31 transition count 44
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 899 place count 26 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 900 place count 26 transition count 42
Graph (complete) has 72 edges and 26 vertex of which 25 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 901 place count 25 transition count 42
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 902 place count 25 transition count 41
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 903 place count 25 transition count 41
Graph (complete) has 69 edges and 25 vertex of which 24 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 904 place count 24 transition count 41
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 905 place count 24 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 906 place count 24 transition count 40
Graph (complete) has 66 edges and 24 vertex of which 23 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 907 place count 23 transition count 40
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 908 place count 23 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 909 place count 22 transition count 38
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t61.t67.t509.t545 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 14 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 3 rules applied. Total rules applied 912 place count 16 transition count 36
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t58.t495.t41.t42.t43.t44.t45.t46.t47.t48.t57.t27.t545.t160.t161.t162.t555.t11.t166 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 10 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 25 with 8 rules applied. Total rules applied 920 place count 12 transition count 29
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 16 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Graph (trivial) has 12 edges and 10 vertex of which 5 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 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 26 with 18 rules applied. Total rules applied 938 place count 6 transition count 14
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 27 with 12 rules applied. Total rules applied 950 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 951 place count 3 transition count 4
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 29 with 2 rules applied. Total rules applied 953 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 954 place count 2 transition count 2
Applied a total of 954 rules in 70 ms. Remains 2 /437 variables (removed 435) and now considering 2/550 (removed 548) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 2/437 places, 2/550 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 234 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 550/550 transitions.
Applied a total of 0 rules in 9 ms. Remains 437 /437 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-06-02 22:54:09] [INFO ] Invariant cache hit.
[2024-06-02 22:54:09] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 22:54:09] [INFO ] Invariant cache hit.
[2024-06-02 22:54:09] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-06-02 22:54:09] [INFO ] Invariant cache hit.
[2024-06-02 22:54:09] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 437/437 places, 550/550 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 694 edges and 437 vertex of which 432 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 46 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1431248 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :{1=1}
Probabilistic random walk after 1431248 steps, saw 274098 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :1
Running SMT prover for 1 properties.
[2024-06-02 22:54:13] [INFO ] Invariant cache hit.
[2024-06-02 22:54:13] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:54:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 22:54:13] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:54:13] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-06-02 22:54:13] [INFO ] After 238ms 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 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 550/550 transitions.
Graph (trivial) has 471 edges and 437 vertex of which 3 / 437 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 691 edges and 435 vertex of which 420 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 213 rules applied. Total rules applied 215 place count 420 transition count 323
Reduce places removed 195 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 197 rules applied. Total rules applied 412 place count 225 transition count 321
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 414 place count 224 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 223 transition count 320
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 415 place count 223 transition count 273
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 509 place count 176 transition count 273
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 510 place count 175 transition count 272
Iterating global reduction 4 with 1 rules applied. Total rules applied 511 place count 175 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 512 place count 175 transition count 271
Performed 67 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 646 place count 108 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 652 place count 108 transition count 182
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 659 place count 101 transition count 175
Iterating global reduction 6 with 7 rules applied. Total rules applied 666 place count 101 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 667 place count 101 transition count 174
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 673 place count 98 transition count 171
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 677 place count 98 transition count 167
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 681 place count 94 transition count 163
Iterating global reduction 8 with 4 rules applied. Total rules applied 685 place count 94 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 686 place count 94 transition count 162
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 9 with 6 rules applied. Total rules applied 692 place count 91 transition count 159
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 695 place count 91 transition count 156
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 698 place count 88 transition count 153
Iterating global reduction 10 with 3 rules applied. Total rules applied 701 place count 88 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 703 place count 88 transition count 151
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 704 place count 87 transition count 150
Iterating global reduction 11 with 1 rules applied. Total rules applied 705 place count 87 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 706 place count 87 transition count 149
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 12 with 54 rules applied. Total rules applied 760 place count 60 transition count 151
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 12 with 36 rules applied. Total rules applied 796 place count 60 transition count 115
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 820 place count 36 transition count 81
Iterating global reduction 13 with 24 rules applied. Total rules applied 844 place count 36 transition count 81
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 864 place count 36 transition count 61
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 867 place count 33 transition count 53
Iterating global reduction 14 with 3 rules applied. Total rules applied 870 place count 33 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 873 place count 33 transition count 50
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 15 with 2 rules applied. Total rules applied 875 place count 32 transition count 60
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 879 place count 32 transition count 56
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 884 place count 32 transition count 51
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 885 place count 31 transition count 50
Iterating global reduction 16 with 1 rules applied. Total rules applied 886 place count 31 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 887 place count 31 transition count 49
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 892 place count 31 transition count 44
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 899 place count 26 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 900 place count 26 transition count 42
Graph (complete) has 72 edges and 26 vertex of which 25 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 901 place count 25 transition count 42
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 902 place count 25 transition count 41
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 903 place count 25 transition count 41
Graph (complete) has 69 edges and 25 vertex of which 24 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 904 place count 24 transition count 41
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 905 place count 24 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 906 place count 24 transition count 40
Graph (complete) has 66 edges and 24 vertex of which 23 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 907 place count 23 transition count 40
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 908 place count 23 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 909 place count 22 transition count 38
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t61.t67.t509.t545 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 14 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 3 rules applied. Total rules applied 912 place count 16 transition count 36
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t58.t495.t41.t42.t43.t44.t45.t46.t47.t48.t57.t27.t545.t160.t161.t162.t555.t11.t166 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 10 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 25 with 8 rules applied. Total rules applied 920 place count 12 transition count 29
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 16 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Graph (trivial) has 12 edges and 10 vertex of which 5 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 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 26 with 18 rules applied. Total rules applied 938 place count 6 transition count 14
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 27 with 12 rules applied. Total rules applied 950 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 951 place count 3 transition count 4
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 29 with 2 rules applied. Total rules applied 953 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 954 place count 2 transition count 2
Applied a total of 954 rules in 42 ms. Remains 2 /437 variables (removed 435) and now considering 2/550 (removed 548) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 2/437 places, 2/550 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 201 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 215 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 40 reset in 179 ms.
Product exploration explored 100000 steps with 46 reset in 100 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 214 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 437/437 places, 550/550 transitions.
Graph (trivial) has 469 edges and 437 vertex of which 3 / 437 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 692 edges and 435 vertex of which 430 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 187 rules applied. Total rules applied 189 place count 430 transition count 542
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 190 place count 430 transition count 541
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 190 place count 430 transition count 542
Deduced a syphon composed of 193 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 196 place count 430 transition count 542
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 248 place count 378 transition count 490
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 300 place count 378 transition count 490
Performed 89 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 389 place count 378 transition count 543
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 398 place count 378 transition count 534
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 483 place count 293 transition count 449
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 3 with 85 rules applied. Total rules applied 568 place count 293 transition count 449
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 569 place count 292 transition count 448
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 570 place count 292 transition count 448
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 571 place count 292 transition count 448
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 573 place count 292 transition count 446
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 577 place count 288 transition count 442
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 581 place count 288 transition count 442
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 583 place count 286 transition count 439
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 585 place count 286 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 586 place count 286 transition count 438
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 587 place count 285 transition count 437
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 588 place count 285 transition count 437
Performed 57 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 203 places in 0 ms
Iterating global reduction 5 with 57 rules applied. Total rules applied 645 place count 285 transition count 674
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 54 rules applied. Total rules applied 699 place count 285 transition count 620
Discarding 92 places :
Symmetric choice reduction at 6 with 92 rule applications. Total rules 791 place count 193 transition count 415
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 6 with 92 rules applied. Total rules applied 883 place count 193 transition count 415
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 918 place count 193 transition count 380
Discarding 61 places :
Symmetric choice reduction at 7 with 61 rule applications. Total rules 979 place count 132 transition count 276
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 7 with 61 rules applied. Total rules applied 1040 place count 132 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1048 place count 132 transition count 268
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1057 place count 123 transition count 251
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 8 with 9 rules applied. Total rules applied 1066 place count 123 transition count 251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1067 place count 123 transition count 276
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1077 place count 123 transition count 266
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1080 place count 120 transition count 248
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1083 place count 120 transition count 248
Deduced a syphon composed of 70 places in 0 ms
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1094 place count 120 transition count 237
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1095 place count 119 transition count 236
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1096 place count 119 transition count 236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1097 place count 119 transition count 257
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1099 place count 117 transition count 241
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1101 place count 117 transition count 241
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 1101 rules in 111 ms. Remains 117 /437 variables (removed 320) and now considering 241/550 (removed 309) transitions.
[2024-06-02 22:54:15] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 22:54:15] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
// Phase 1: matrix 234 rows 117 cols
[2024-06-02 22:54:15] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:54:15] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/437 places, 241/550 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 117/437 places, 241/550 transitions.
Built C files in :
/tmp/ltsmin14391241575971565108
[2024-06-02 22:54:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14391241575971565108
Running compilation step : cd /tmp/ltsmin14391241575971565108;'/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 719 ms.
Running link step : cd /tmp/ltsmin14391241575971565108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14391241575971565108;'/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/stateBased9215628175195275420.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 550/550 transitions.
Applied a total of 0 rules in 17 ms. Remains 437 /437 variables (removed 0) and now considering 550/550 (removed 0) transitions.
// Phase 1: matrix 550 rows 437 cols
[2024-06-02 22:54:30] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:54:30] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 22:54:30] [INFO ] Invariant cache hit.
[2024-06-02 22:54:30] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-02 22:54:30] [INFO ] Invariant cache hit.
[2024-06-02 22:54:30] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 490 ms. Remains : 437/437 places, 550/550 transitions.
Built C files in :
/tmp/ltsmin170669483668907231
[2024-06-02 22:54:30] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin170669483668907231
Running compilation step : cd /tmp/ltsmin170669483668907231;'/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 722 ms.
Running link step : cd /tmp/ltsmin170669483668907231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin170669483668907231;'/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/stateBased18190275516086758461.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:54:46] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:54:46] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:54:46] [INFO ] Time to serialize gal into /tmp/LTL8333160275846936812.gal : 5 ms
[2024-06-02 22:54:46] [INFO ] Time to serialize properties into /tmp/LTL17052592606828773960.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8333160275846936812.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18134282081070038041.hoa' '-atoms' '/tmp/LTL17052592606828773960.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...319
Loading property file /tmp/LTL17052592606828773960.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18134282081070038041.hoa
Reverse transition relation is NOT exact ! Due to transitions t19, t20, t21, t22, t23, t24, t25, t31, t40, t49, t51, t52, t53, t54, t55, t57, t60, t106, t1...457
Computing Next relation with stutter on 23519 deadlock states
Detected timeout of ITS tools.
[2024-06-02 22:55:01] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:55:01] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:55:01] [INFO ] Time to serialize gal into /tmp/LTL18171460797089712085.gal : 2 ms
[2024-06-02 22:55:01] [INFO ] Time to serialize properties into /tmp/LTL16792531629211461959.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/LTL18171460797089712085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16792531629211461959.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(p319==0)")&&(X(G("((p745!=1)&&(p319!=1))"))))))))
Formula 0 simplified : XXX(!"(p319==0)" | XF!"((p745!=1)&&(p319!=1))")
Reverse transition relation is NOT exact ! Due to transitions t19, t20, t21, t22, t23, t24, t25, t31, t40, t49, t51, t52, t53, t54, t55, t57, t60, t106, t1...457
Computing Next relation with stutter on 23519 deadlock states
Detected timeout of ITS tools.
[2024-06-02 22:55:16] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:55:16] [INFO ] Applying decomposition
[2024-06-02 22:55:16] [INFO ] Flatten gal took : 16 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/graph8561846903253575074.txt' '-o' '/tmp/graph8561846903253575074.bin' '-w' '/tmp/graph8561846903253575074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8561846903253575074.bin' '-l' '-1' '-v' '-w' '/tmp/graph8561846903253575074.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:55:16] [INFO ] Decomposing Gal with order
[2024-06-02 22:55:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:55:16] [INFO ] Removed a total of 168 redundant transitions.
[2024-06-02 22:55:16] [INFO ] Flatten gal took : 102 ms
[2024-06-02 22:55:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 13 ms.
[2024-06-02 22:55:16] [INFO ] Time to serialize gal into /tmp/LTL15277874544418888770.gal : 7 ms
[2024-06-02 22:55:16] [INFO ] Time to serialize properties into /tmp/LTL14761968120222541032.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15277874544418888770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14761968120222541032.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(i5.u39.p319==0)")&&(X(G("((i15.u131.p745!=1)&&(i5.u39.p319!=1))"))))))))
Formula 0 simplified : XXX(!"(i5.u39.p319==0)" | XF!"((i15.u131.p745!=1)&&(i5.u39.p319!=1))")
Reverse transition relation is NOT exact ! Due to transitions t51, t60, t106, t194, t279, t309, t389, t410, t473, t482, t509, t510, i0.t464, i1.t432, i1.i0...738
Computing Next relation with stutter on 23519 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
62 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.659016,41560,1,0,48967,2833,6479,94237,477,11577,137055
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-18-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CO4-PT-18-LTLFireability-06 finished in 73770 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)))'
Support contains 1 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Graph (trivial) has 490 edges and 456 vertex of which 3 / 456 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 716 edges and 454 vertex of which 449 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 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 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 203 place count 448 transition count 360
Reduce places removed 201 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 203 rules applied. Total rules applied 406 place count 247 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 407 place count 246 transition count 358
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 407 place count 246 transition count 313
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 497 place count 201 transition count 313
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 500 place count 198 transition count 310
Iterating global reduction 3 with 3 rules applied. Total rules applied 503 place count 198 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 503 place count 198 transition count 309
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 505 place count 197 transition count 309
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 507 place count 195 transition count 307
Iterating global reduction 3 with 2 rules applied. Total rules applied 509 place count 195 transition count 307
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 3 with 2 rules applied. Total rules applied 511 place count 195 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 512 place count 194 transition count 305
Performed 73 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 658 place count 121 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 664 place count 121 transition count 208
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 671 place count 114 transition count 201
Iterating global reduction 6 with 7 rules applied. Total rules applied 678 place count 114 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 679 place count 114 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 683 place count 112 transition count 198
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 749 place count 79 transition count 200
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 770 place count 79 transition count 179
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 798 place count 51 transition count 123
Iterating global reduction 8 with 28 rules applied. Total rules applied 826 place count 51 transition count 123
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 844 place count 51 transition count 105
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 851 place count 44 transition count 85
Iterating global reduction 9 with 7 rules applied. Total rules applied 858 place count 44 transition count 85
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 863 place count 44 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 867 place count 42 transition count 105
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 887 place count 42 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 889 place count 40 transition count 83
Applied a total of 889 rules in 70 ms. Remains 40 /456 variables (removed 416) and now considering 83/570 (removed 487) transitions.
[2024-06-02 22:55:17] [INFO ] Flow matrix only has 73 transitions (discarded 10 similar events)
// Phase 1: matrix 73 rows 40 cols
[2024-06-02 22:55:17] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:55:17] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 22:55:17] [INFO ] Flow matrix only has 73 transitions (discarded 10 similar events)
[2024-06-02 22:55:17] [INFO ] Invariant cache hit.
[2024-06-02 22:55:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:55:17] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-06-02 22:55:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:55:17] [INFO ] Flow matrix only has 73 transitions (discarded 10 similar events)
[2024-06-02 22:55:17] [INFO ] Invariant cache hit.
[2024-06-02 22:55:17] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/456 places, 83/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 40/456 places, 83/570 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-07 finished in 402 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 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 446 transition count 560
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 446 transition count 560
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 439 transition count 553
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 436 transition count 549
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 436 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 434 transition count 547
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 434 transition count 547
Applied a total of 45 rules in 29 ms. Remains 434 /456 variables (removed 22) and now considering 547/570 (removed 23) transitions.
// Phase 1: matrix 547 rows 434 cols
[2024-06-02 22:55:17] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:55:17] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 22:55:17] [INFO ] Invariant cache hit.
[2024-06-02 22:55:18] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-02 22:55:18] [INFO ] Invariant cache hit.
[2024-06-02 22:55:18] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/456 places, 547/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 434/456 places, 547/570 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-08 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:(NEQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 428 steps with 12 reset in 2 ms.
FORMULA CO4-PT-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-08 finished in 685 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))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 446 transition count 560
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 446 transition count 560
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 439 transition count 553
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 436 transition count 549
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 436 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 434 transition count 547
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 434 transition count 547
Applied a total of 45 rules in 32 ms. Remains 434 /456 variables (removed 22) and now considering 547/570 (removed 23) transitions.
[2024-06-02 22:55:18] [INFO ] Invariant cache hit.
[2024-06-02 22:55:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 22:55:18] [INFO ] Invariant cache hit.
[2024-06-02 22:55:18] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-06-02 22:55:18] [INFO ] Invariant cache hit.
[2024-06-02 22:55:19] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/456 places, 547/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 501 ms. Remains : 434/456 places, 547/570 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s421 1) (EQ s429 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-10 finished in 597 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||(p1&&X(F(p2)))))))'
Support contains 4 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Graph (trivial) has 481 edges and 456 vertex of which 3 / 456 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 716 edges and 454 vertex of which 449 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 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 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 448 transition count 361
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 203 rules applied. Total rules applied 405 place count 248 transition count 358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 407 place count 246 transition count 358
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 407 place count 246 transition count 314
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 495 place count 202 transition count 314
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 497 place count 200 transition count 312
Iterating global reduction 3 with 2 rules applied. Total rules applied 499 place count 200 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 499 place count 200 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 501 place count 199 transition count 311
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 502 place count 198 transition count 310
Iterating global reduction 3 with 1 rules applied. Total rules applied 503 place count 198 transition count 310
Performed 74 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 651 place count 124 transition count 216
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 657 place count 124 transition count 210
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 664 place count 117 transition count 203
Iterating global reduction 4 with 7 rules applied. Total rules applied 671 place count 117 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 672 place count 117 transition count 202
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 676 place count 115 transition count 200
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 740 place count 83 transition count 203
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 760 place count 83 transition count 183
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 787 place count 56 transition count 129
Iterating global reduction 6 with 27 rules applied. Total rules applied 814 place count 56 transition count 129
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 832 place count 56 transition count 111
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 839 place count 49 transition count 91
Iterating global reduction 7 with 7 rules applied. Total rules applied 846 place count 49 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 851 place count 49 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 855 place count 47 transition count 113
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 868 place count 47 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 870 place count 45 transition count 98
Applied a total of 870 rules in 39 ms. Remains 45 /456 variables (removed 411) and now considering 98/570 (removed 472) transitions.
[2024-06-02 22:55:19] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
// Phase 1: matrix 89 rows 45 cols
[2024-06-02 22:55:19] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:55:19] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 22:55:19] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
[2024-06-02 22:55:19] [INFO ] Invariant cache hit.
[2024-06-02 22:55:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:55:19] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-02 22:55:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:55:19] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
[2024-06-02 22:55:19] [INFO ] Invariant cache hit.
[2024-06-02 22:55:19] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/456 places, 98/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 439 ms. Remains : 45/456 places, 98/570 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s23 0) (EQ s38 0)), p0:(EQ s17 0), p2:(AND (EQ s25 0) (OR (EQ s23 0) (EQ s38 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 30 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Computed a total of 7 stabilizing places and 23 stable transitions
Computed a total of 7 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 956 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 22:55:20] [INFO ] Flow matrix only has 89 transitions (discarded 9 similar events)
[2024-06-02 22:55:20] [INFO ] Invariant cache hit.
[2024-06-02 22:55:20] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:55:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-02 22:55:20] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 12 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLFireability-11 finished in 1345 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(p0) U (F((p1&&X((p1 U (!p0||G(p1)))))) U p2))))'
Support contains 3 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 562
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 562
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 442 transition count 556
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 442 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 442 transition count 555
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 439 transition count 552
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 437 transition count 550
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 437 transition count 550
Applied a total of 39 rules in 41 ms. Remains 437 /456 variables (removed 19) and now considering 550/570 (removed 20) transitions.
// Phase 1: matrix 550 rows 437 cols
[2024-06-02 22:55:20] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 22:55:20] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 22:55:20] [INFO ] Invariant cache hit.
[2024-06-02 22:55:20] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-02 22:55:20] [INFO ] Invariant cache hit.
[2024-06-02 22:55:21] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 437/456 places, 550/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 437/456 places, 550/570 transitions.
Stuttering acceptance computed with spot in 359 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Running random walk in product with property : CO4-PT-18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s233 1), p1:(NEQ s422 1), p0:(EQ s23 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 16643 reset in 202 ms.
Product exploration explored 100000 steps with 16674 reset in 212 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 696 edges and 437 vertex of which 432 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 19 stable transitions
Detected a total of 16/437 stabilizing places and 19/550 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 183 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 888241 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 7=1, 10=1}
Probabilistic random walk after 888241 steps, saw 175505 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :8
Running SMT prover for 3 properties.
[2024-06-02 22:55:26] [INFO ] Invariant cache hit.
[2024-06-02 22:55:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:26] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:55:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:55:26] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 22:55:26] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-06-02 22:55:26] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 550/550 transitions.
Graph (trivial) has 467 edges and 437 vertex of which 3 / 437 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 693 edges and 435 vertex of which 420 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 211 rules applied. Total rules applied 213 place count 420 transition count 325
Reduce places removed 193 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 195 rules applied. Total rules applied 408 place count 227 transition count 323
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 410 place count 226 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 411 place count 225 transition count 322
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 411 place count 225 transition count 276
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 503 place count 179 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 504 place count 178 transition count 275
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 178 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 506 place count 178 transition count 274
Performed 66 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 638 place count 112 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 644 place count 112 transition count 186
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 651 place count 105 transition count 179
Iterating global reduction 6 with 7 rules applied. Total rules applied 658 place count 105 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 659 place count 105 transition count 178
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 665 place count 102 transition count 175
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 669 place count 102 transition count 171
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 673 place count 98 transition count 167
Iterating global reduction 8 with 4 rules applied. Total rules applied 677 place count 98 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 678 place count 98 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 682 place count 96 transition count 164
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 684 place count 96 transition count 162
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 686 place count 94 transition count 160
Iterating global reduction 10 with 2 rules applied. Total rules applied 688 place count 94 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 689 place count 94 transition count 159
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 690 place count 93 transition count 158
Iterating global reduction 11 with 1 rules applied. Total rules applied 691 place count 93 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 692 place count 93 transition count 157
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 56 rules applied. Total rules applied 748 place count 65 transition count 159
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 12 with 36 rules applied. Total rules applied 784 place count 65 transition count 123
Discarding 25 places :
Symmetric choice reduction at 13 with 25 rule applications. Total rules 809 place count 40 transition count 87
Iterating global reduction 13 with 25 rules applied. Total rules applied 834 place count 40 transition count 87
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 854 place count 40 transition count 67
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 857 place count 37 transition count 59
Iterating global reduction 14 with 3 rules applied. Total rules applied 860 place count 37 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 862 place count 37 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 864 place count 36 transition count 65
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 867 place count 36 transition count 62
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 872 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 873 place count 35 transition count 56
Iterating global reduction 16 with 1 rules applied. Total rules applied 874 place count 35 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 875 place count 35 transition count 55
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 880 place count 35 transition count 50
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 887 place count 30 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 888 place count 30 transition count 48
Graph (complete) has 84 edges and 30 vertex of which 29 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 889 place count 29 transition count 48
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 890 place count 29 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 891 place count 29 transition count 47
Graph (complete) has 81 edges and 29 vertex of which 28 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 892 place count 28 transition count 47
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 893 place count 28 transition count 46
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 894 place count 28 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 895 place count 27 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 896 place count 26 transition count 44
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t61.t67.t509.t545 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 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 3 rules applied. Total rules applied 899 place count 20 transition count 42
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 904 place count 20 transition count 37
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 905 place count 19 transition count 36
Iterating global reduction 25 with 1 rules applied. Total rules applied 906 place count 19 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 907 place count 19 transition count 35
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 26 with 9 rules applied. Total rules applied 916 place count 19 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 918 place count 18 transition count 25
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 919 place count 17 transition count 24
Iterating global reduction 27 with 1 rules applied. Total rules applied 920 place count 17 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 921 place count 17 transition count 23
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 922 place count 16 transition count 22
Iterating global reduction 28 with 1 rules applied. Total rules applied 923 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 924 place count 16 transition count 21
Free-agglomeration rule applied 3 times.
Iterating global reduction 29 with 3 rules applied. Total rules applied 927 place count 16 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 29 with 3 rules applied. Total rules applied 930 place count 13 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 30 with 2 rules applied. Total rules applied 932 place count 13 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 30 with 2 rules applied. Total rules applied 934 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 3 rules applied. Total rules applied 937 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 31 with 1 rules applied. Total rules applied 938 place count 11 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 939 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 941 place count 10 transition count 10
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 32 with 2 rules applied. Total rules applied 943 place count 9 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 32 with 1 rules applied. Total rules applied 944 place count 9 transition count 8
Applied a total of 944 rules in 38 ms. Remains 9 /437 variables (removed 428) and now considering 8/550 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 9/437 places, 8/550 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 9 cols
[2024-06-02 22:55:27] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:55:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:27] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:55:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:27] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:55:27] [INFO ] After 10ms 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:55:27] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F p2), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 641 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
// Phase 1: matrix 550 rows 437 cols
[2024-06-02 22:55:28] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:55:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:28] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-06-02 22:55:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:28] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-06-02 22:55:28] [INFO ] Computed and/alt/rep : 540/745/540 causal constraints (skipped 9 transitions) in 26 ms.
[2024-06-02 22:55:32] [INFO ] Added : 509 causal constraints over 102 iterations in 3479 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 550/550 transitions.
Applied a total of 0 rules in 11 ms. Remains 437 /437 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-06-02 22:55:32] [INFO ] Invariant cache hit.
[2024-06-02 22:55:32] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 22:55:32] [INFO ] Invariant cache hit.
[2024-06-02 22:55:32] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-06-02 22:55:32] [INFO ] Invariant cache hit.
[2024-06-02 22:55:32] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 437/437 places, 550/550 transitions.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 696 edges and 437 vertex of which 432 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 19 stable transitions
Detected a total of 16/437 stabilizing places and 19/550 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 170 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-06-02 22:55:34] [INFO ] Invariant cache hit.
[2024-06-02 22:55:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:34] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 22:55:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:35] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 22:55:35] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-06-02 22:55:35] [INFO ] After 690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 550/550 transitions.
Graph (trivial) has 467 edges and 437 vertex of which 3 / 437 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 693 edges and 435 vertex of which 420 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 211 rules applied. Total rules applied 213 place count 420 transition count 325
Reduce places removed 193 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 195 rules applied. Total rules applied 408 place count 227 transition count 323
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 410 place count 226 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 411 place count 225 transition count 322
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 411 place count 225 transition count 276
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 503 place count 179 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 504 place count 178 transition count 275
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 178 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 506 place count 178 transition count 274
Performed 66 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 638 place count 112 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 644 place count 112 transition count 186
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 651 place count 105 transition count 179
Iterating global reduction 6 with 7 rules applied. Total rules applied 658 place count 105 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 659 place count 105 transition count 178
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 665 place count 102 transition count 175
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 669 place count 102 transition count 171
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 673 place count 98 transition count 167
Iterating global reduction 8 with 4 rules applied. Total rules applied 677 place count 98 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 678 place count 98 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 682 place count 96 transition count 164
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 684 place count 96 transition count 162
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 686 place count 94 transition count 160
Iterating global reduction 10 with 2 rules applied. Total rules applied 688 place count 94 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 689 place count 94 transition count 159
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 690 place count 93 transition count 158
Iterating global reduction 11 with 1 rules applied. Total rules applied 691 place count 93 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 692 place count 93 transition count 157
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 56 rules applied. Total rules applied 748 place count 65 transition count 159
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 12 with 36 rules applied. Total rules applied 784 place count 65 transition count 123
Discarding 25 places :
Symmetric choice reduction at 13 with 25 rule applications. Total rules 809 place count 40 transition count 87
Iterating global reduction 13 with 25 rules applied. Total rules applied 834 place count 40 transition count 87
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 854 place count 40 transition count 67
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 857 place count 37 transition count 59
Iterating global reduction 14 with 3 rules applied. Total rules applied 860 place count 37 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 862 place count 37 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 864 place count 36 transition count 65
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 867 place count 36 transition count 62
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 872 place count 36 transition count 57
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 873 place count 35 transition count 56
Iterating global reduction 16 with 1 rules applied. Total rules applied 874 place count 35 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 875 place count 35 transition count 55
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 880 place count 35 transition count 50
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 887 place count 30 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 888 place count 30 transition count 48
Graph (complete) has 84 edges and 30 vertex of which 29 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 889 place count 29 transition count 48
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 890 place count 29 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 891 place count 29 transition count 47
Graph (complete) has 81 edges and 29 vertex of which 28 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 892 place count 28 transition count 47
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 893 place count 28 transition count 46
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 894 place count 28 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 895 place count 27 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 896 place count 26 transition count 44
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t61.t67.t509.t545 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 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 3 rules applied. Total rules applied 899 place count 20 transition count 42
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 904 place count 20 transition count 37
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 905 place count 19 transition count 36
Iterating global reduction 25 with 1 rules applied. Total rules applied 906 place count 19 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 907 place count 19 transition count 35
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 26 with 9 rules applied. Total rules applied 916 place count 19 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 918 place count 18 transition count 25
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 919 place count 17 transition count 24
Iterating global reduction 27 with 1 rules applied. Total rules applied 920 place count 17 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 921 place count 17 transition count 23
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 922 place count 16 transition count 22
Iterating global reduction 28 with 1 rules applied. Total rules applied 923 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 924 place count 16 transition count 21
Free-agglomeration rule applied 3 times.
Iterating global reduction 29 with 3 rules applied. Total rules applied 927 place count 16 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 29 with 3 rules applied. Total rules applied 930 place count 13 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 30 with 2 rules applied. Total rules applied 932 place count 13 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 30 with 2 rules applied. Total rules applied 934 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 3 rules applied. Total rules applied 937 place count 11 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 31 with 1 rules applied. Total rules applied 938 place count 11 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 939 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 941 place count 10 transition count 10
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 32 with 2 rules applied. Total rules applied 943 place count 9 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 32 with 1 rules applied. Total rules applied 944 place count 9 transition count 8
Applied a total of 944 rules in 41 ms. Remains 9 /437 variables (removed 428) and now considering 8/550 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 9/437 places, 8/550 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :5
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F p2), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 692 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Stuttering acceptance computed with spot in 353 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
[2024-06-02 22:55:36] [INFO ] Invariant cache hit.
[2024-06-02 22:55:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:37] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-06-02 22:55:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:55:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:55:37] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-06-02 22:55:37] [INFO ] Computed and/alt/rep : 540/745/540 causal constraints (skipped 9 transitions) in 28 ms.
[2024-06-02 22:55:41] [INFO ] Added : 509 causal constraints over 102 iterations in 3579 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Product exploration explored 100000 steps with 16738 reset in 192 ms.
Product exploration explored 100000 steps with 16623 reset in 199 ms.
Built C files in :
/tmp/ltsmin13321164986581605228
[2024-06-02 22:55:41] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13321164986581605228
Running compilation step : cd /tmp/ltsmin13321164986581605228;'/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 790 ms.
Running link step : cd /tmp/ltsmin13321164986581605228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13321164986581605228;'/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/stateBased12890940133754821187.hoa' '--buchi-type=spotba'
LTSmin run took 141 ms.
FORMULA CO4-PT-18-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLFireability-12 finished in 22484 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(F((p0||G(p1)))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 447 transition count 561
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 447 transition count 561
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 441 transition count 555
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 441 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 441 transition count 554
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 438 transition count 551
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 438 transition count 551
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 436 transition count 549
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 436 transition count 549
Applied a total of 41 rules in 25 ms. Remains 436 /456 variables (removed 20) and now considering 549/570 (removed 21) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 22:55:42] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 22:55:43] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 22:55:43] [INFO ] Invariant cache hit.
[2024-06-02 22:55:43] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-06-02 22:55:43] [INFO ] Invariant cache hit.
[2024-06-02 22:55:43] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 436/456 places, 549/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 436/456 places, 549/570 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s43 1), p0:(EQ s325 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-13 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 570/570 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 446 transition count 560
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 446 transition count 560
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 439 transition count 553
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 439 transition count 552
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 436 transition count 549
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 436 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 434 transition count 547
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 434 transition count 547
Applied a total of 45 rules in 25 ms. Remains 434 /456 variables (removed 22) and now considering 547/570 (removed 23) transitions.
// Phase 1: matrix 547 rows 434 cols
[2024-06-02 22:55:43] [INFO ] Computed 4 invariants in 8 ms
[2024-06-02 22:55:43] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 22:55:43] [INFO ] Invariant cache hit.
[2024-06-02 22:55:43] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-06-02 22:55:43] [INFO ] Invariant cache hit.
[2024-06-02 22:55:44] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/456 places, 547/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 434/456 places, 547/570 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s314 0), p1:(EQ s105 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Product exploration explored 100000 steps with 50000 reset in 369 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 691 edges and 434 vertex of which 429 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLFireability-14 finished in 1466 ms.
All properties solved by simple procedures.
Total runtime 113687 ms.

BK_STOP 1717368946355

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-18"
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-18, 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-171734910200088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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