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.r131-smll-171624288500188.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 DLCshifumi-PT-2b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288500188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 06:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 06:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 05:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 05:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 729K May 18 16:42 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 DLCshifumi-PT-2b-LTLFireability-00
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-01
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-02
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-03
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-04
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-05
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-06
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-07
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-08
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-09
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-10
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-11
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-12
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-13
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-14
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716403531441

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=DLCshifumi-PT-2b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 18:45:33] [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-05-22 18:45:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:45:34] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2024-05-22 18:45:34] [INFO ] Transformed 2483 places.
[2024-05-22 18:45:34] [INFO ] Transformed 3183 transitions.
[2024-05-22 18:45:34] [INFO ] Found NUPN structural information;
[2024-05-22 18:45:34] [INFO ] Parsed PT model containing 2483 places and 3183 transitions and 7756 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DLCshifumi-PT-2b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 2483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3183/3183 transitions.
Discarding 388 places :
Symmetric choice reduction at 0 with 388 rule applications. Total rules 388 place count 2095 transition count 2795
Iterating global reduction 0 with 388 rules applied. Total rules applied 776 place count 2095 transition count 2795
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 1079 place count 1792 transition count 2492
Iterating global reduction 0 with 303 rules applied. Total rules applied 1382 place count 1792 transition count 2492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 1384 place count 1792 transition count 2490
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 1490 place count 1686 transition count 2354
Iterating global reduction 1 with 106 rules applied. Total rules applied 1596 place count 1686 transition count 2354
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 1695 place count 1587 transition count 2255
Iterating global reduction 1 with 99 rules applied. Total rules applied 1794 place count 1587 transition count 2255
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 1808 place count 1587 transition count 2241
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1850 place count 1545 transition count 2199
Iterating global reduction 2 with 42 rules applied. Total rules applied 1892 place count 1545 transition count 2199
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1934 place count 1503 transition count 2157
Iterating global reduction 2 with 42 rules applied. Total rules applied 1976 place count 1503 transition count 2157
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 2015 place count 1464 transition count 2118
Iterating global reduction 2 with 39 rules applied. Total rules applied 2054 place count 1464 transition count 2118
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 2091 place count 1427 transition count 2081
Iterating global reduction 2 with 37 rules applied. Total rules applied 2128 place count 1427 transition count 2081
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 2151 place count 1404 transition count 2058
Iterating global reduction 2 with 23 rules applied. Total rules applied 2174 place count 1404 transition count 2058
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 2197 place count 1381 transition count 2035
Iterating global reduction 2 with 23 rules applied. Total rules applied 2220 place count 1381 transition count 2035
Applied a total of 2220 rules in 1786 ms. Remains 1381 /2483 variables (removed 1102) and now considering 2035/3183 (removed 1148) transitions.
// Phase 1: matrix 2035 rows 1381 cols
[2024-05-22 18:45:36] [INFO ] Computed 79 invariants in 39 ms
[2024-05-22 18:45:37] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-22 18:45:37] [INFO ] Invariant cache hit.
[2024-05-22 18:45:39] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2556 ms to find 0 implicit places.
[2024-05-22 18:45:39] [INFO ] Invariant cache hit.
[2024-05-22 18:45:41] [INFO ] Dead Transitions using invariants and state equation in 2148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1381/2483 places, 2035/3183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6504 ms. Remains : 1381/2483 places, 2035/3183 transitions.
Support contains 43 out of 1381 places after structural reductions.
[2024-05-22 18:45:41] [INFO ] Flatten gal took : 218 ms
[2024-05-22 18:45:41] [INFO ] Flatten gal took : 122 ms
[2024-05-22 18:45:42] [INFO ] Input system was already deterministic with 2035 transitions.
Support contains 42 out of 1381 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 34) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-22 18:45:43] [INFO ] Invariant cache hit.
[2024-05-22 18:45:43] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 18:45:44] [INFO ] [Nat]Absence check using 79 positive place invariants in 54 ms returned sat
[2024-05-22 18:45:45] [INFO ] After 1456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-22 18:45:46] [INFO ] After 2666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 597 ms.
[2024-05-22 18:45:47] [INFO ] After 3985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 7 properties in 123 ms.
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1313 edges and 1381 vertex of which 330 / 1381 are part of one of the 23 SCC in 8 ms
Free SCC test removed 307 places
Drop transitions removed 349 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 365 transitions.
Drop transitions removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 316 place count 1074 transition count 1355
Reduce places removed 315 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 369 rules applied. Total rules applied 685 place count 759 transition count 1301
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 721 place count 723 transition count 1301
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 721 place count 723 transition count 1189
Deduced a syphon composed of 112 places in 3 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 945 place count 611 transition count 1189
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 997 place count 559 transition count 989
Iterating global reduction 3 with 52 rules applied. Total rules applied 1049 place count 559 transition count 989
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1062 place count 559 transition count 976
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1062 place count 559 transition count 972
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1070 place count 555 transition count 972
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1072 place count 553 transition count 968
Iterating global reduction 4 with 2 rules applied. Total rules applied 1074 place count 553 transition count 968
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1076 place count 553 transition count 966
Performed 191 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 191 places in 1 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 5 with 382 rules applied. Total rules applied 1458 place count 362 transition count 773
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1461 place count 362 transition count 770
Renaming transitions due to excessive name length > 1024 char.
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1480 place count 343 transition count 676
Iterating global reduction 6 with 19 rules applied. Total rules applied 1499 place count 343 transition count 676
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1518 place count 343 transition count 657
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 7 with 2 rules applied. Total rules applied 1520 place count 342 transition count 656
Performed 48 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 1616 place count 294 transition count 723
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1626 place count 294 transition count 713
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1640 place count 280 transition count 654
Iterating global reduction 8 with 14 rules applied. Total rules applied 1654 place count 280 transition count 654
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 1683 place count 280 transition count 625
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 1711 place count 280 transition count 597
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1715 place count 276 transition count 593
Iterating global reduction 9 with 4 rules applied. Total rules applied 1719 place count 276 transition count 593
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1723 place count 272 transition count 527
Iterating global reduction 9 with 4 rules applied. Total rules applied 1727 place count 272 transition count 527
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1731 place count 272 transition count 523
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 1735 place count 270 transition count 521
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1737 place count 268 transition count 488
Iterating global reduction 10 with 2 rules applied. Total rules applied 1739 place count 268 transition count 488
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1741 place count 268 transition count 486
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1749 place count 264 transition count 513
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1754 place count 264 transition count 508
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 12 with 22 rules applied. Total rules applied 1776 place count 264 transition count 486
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1784 place count 260 transition count 513
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1790 place count 260 transition count 507
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1811 place count 260 transition count 486
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1819 place count 256 transition count 513
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1825 place count 256 transition count 507
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1846 place count 256 transition count 486
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1854 place count 252 transition count 513
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1860 place count 252 transition count 507
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 15 with 20 rules applied. Total rules applied 1880 place count 252 transition count 487
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1888 place count 248 transition count 514
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1894 place count 248 transition count 508
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1915 place count 248 transition count 487
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1923 place count 244 transition count 514
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1929 place count 244 transition count 508
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1950 place count 244 transition count 487
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 1958 place count 240 transition count 514
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1964 place count 240 transition count 508
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 18 with 20 rules applied. Total rules applied 1984 place count 240 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 1992 place count 236 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 1998 place count 236 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2019 place count 236 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2027 place count 232 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2033 place count 232 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2054 place count 232 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2062 place count 228 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2068 place count 228 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2089 place count 228 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2097 place count 224 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2103 place count 224 transition count 510
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2124 place count 224 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2132 place count 220 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2138 place count 220 transition count 510
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 23 with 20 rules applied. Total rules applied 2158 place count 220 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2166 place count 216 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 2172 place count 216 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 2193 place count 216 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 2201 place count 212 transition count 515
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 2206 place count 212 transition count 510
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 25 with 20 rules applied. Total rules applied 2226 place count 212 transition count 490
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 2228 place count 211 transition count 492
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 2229 place count 211 transition count 491
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 26 with 2 rules applied. Total rules applied 2231 place count 211 transition count 489
Free-agglomeration rule applied 50 times with reduction of 1 identical transitions.
Iterating global reduction 26 with 50 rules applied. Total rules applied 2281 place count 211 transition count 438
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Graph (complete) has 461 edges and 161 vertex of which 27 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.1 ms
Discarding 134 places :
Also discarding 182 output transitions
Drop transitions removed 182 transitions
Iterating post reduction 26 with 200 rules applied. Total rules applied 2481 place count 27 transition count 107
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 27 with 56 rules applied. Total rules applied 2537 place count 27 transition count 51
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 28 with 3 rules applied. Total rules applied 2540 place count 27 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 28 with 1 rules applied. Total rules applied 2541 place count 26 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 2543 place count 24 transition count 47
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 29 with 12 rules applied. Total rules applied 2555 place count 16 transition count 43
Drop transitions removed 2 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 29 with 15 rules applied. Total rules applied 2570 place count 15 transition count 29
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 2572 place count 15 transition count 27
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 6 places and 0 transitions.
Iterating global reduction 31 with 9 rules applied. Total rules applied 2581 place count 9 transition count 24
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 5 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 31 with 12 rules applied. Total rules applied 2593 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 32 with 6 rules applied. Total rules applied 2599 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 33 with 1 Pre rules applied. Total rules applied 2599 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 2601 place count 6 transition count 7
Applied a total of 2601 rules in 720 ms. Remains 6 /1381 variables (removed 1375) and now considering 7/2035 (removed 2028) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 720 ms. Remains : 6/1381 places, 7/2035 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 157 stabilizing places and 157 stable transitions
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((X((G(p0)&&X(X(F(p1)))))||G(p2))))'
Support contains 5 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 1352 transition count 1990
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 1352 transition count 1990
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 1343 transition count 1981
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 1343 transition count 1981
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 1335 transition count 1973
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 1335 transition count 1973
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 98 place count 1330 transition count 1968
Iterating global reduction 1 with 5 rules applied. Total rules applied 103 place count 1330 transition count 1968
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 108 place count 1325 transition count 1963
Iterating global reduction 1 with 5 rules applied. Total rules applied 113 place count 1325 transition count 1963
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 117 place count 1321 transition count 1959
Iterating global reduction 1 with 4 rules applied. Total rules applied 121 place count 1321 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 124 place count 1318 transition count 1956
Iterating global reduction 1 with 3 rules applied. Total rules applied 127 place count 1318 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 1316 transition count 1954
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 1314 transition count 1952
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 1314 transition count 1952
Applied a total of 135 rules in 538 ms. Remains 1314 /1381 variables (removed 67) and now considering 1952/2035 (removed 83) transitions.
// Phase 1: matrix 1952 rows 1314 cols
[2024-05-22 18:45:49] [INFO ] Computed 79 invariants in 9 ms
[2024-05-22 18:45:50] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-22 18:45:50] [INFO ] Invariant cache hit.
[2024-05-22 18:45:51] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2024-05-22 18:45:51] [INFO ] Invariant cache hit.
[2024-05-22 18:45:53] [INFO ] Dead Transitions using invariants and state equation in 2086 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1314/1381 places, 1952/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4642 ms. Remains : 1314/1381 places, 1952/2035 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 400 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={1} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s799 0), p0:(EQ s86 0), p1:(OR (EQ s48 0) (EQ s789 0) (EQ s1084 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 51 reset in 691 ms.
Product exploration explored 100000 steps with 28 reset in 660 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), true, (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 178 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 18:45:56] [INFO ] Invariant cache hit.
[2024-05-22 18:45:56] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 18:45:56] [INFO ] [Nat]Absence check using 79 positive place invariants in 50 ms returned sat
[2024-05-22 18:45:57] [INFO ] After 885ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-22 18:45:58] [INFO ] After 1145ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-22 18:45:58] [INFO ] After 1651ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 19 ms.
Support contains 2 out of 1314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1314/1314 places, 1952/1952 transitions.
Graph (trivial) has 1246 edges and 1314 vertex of which 319 / 1314 are part of one of the 23 SCC in 2 ms
Free SCC test removed 296 places
Drop transitions removed 337 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 354 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 280 place count 1018 transition count 1319
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 330 rules applied. Total rules applied 610 place count 739 transition count 1268
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 644 place count 705 transition count 1268
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 644 place count 705 transition count 1161
Deduced a syphon composed of 107 places in 5 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 858 place count 598 transition count 1161
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 900 place count 556 transition count 984
Iterating global reduction 3 with 42 rules applied. Total rules applied 942 place count 556 transition count 984
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 957 place count 556 transition count 969
Performed 194 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 194 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 4 with 388 rules applied. Total rules applied 1345 place count 362 transition count 773
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1347 place count 362 transition count 771
Renaming transitions due to excessive name length > 1024 char.
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1365 place count 344 transition count 679
Iterating global reduction 5 with 18 rules applied. Total rules applied 1383 place count 344 transition count 679
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1401 place count 344 transition count 661
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 1499 place count 295 transition count 728
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1509 place count 295 transition count 718
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1524 place count 280 transition count 655
Iterating global reduction 7 with 15 rules applied. Total rules applied 1539 place count 280 transition count 655
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1570 place count 280 transition count 624
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1596 place count 280 transition count 598
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1600 place count 276 transition count 594
Iterating global reduction 8 with 4 rules applied. Total rules applied 1604 place count 276 transition count 594
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1608 place count 272 transition count 528
Iterating global reduction 8 with 4 rules applied. Total rules applied 1612 place count 272 transition count 528
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1616 place count 272 transition count 524
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 1620 place count 270 transition count 522
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1622 place count 268 transition count 489
Iterating global reduction 9 with 2 rules applied. Total rules applied 1624 place count 268 transition count 489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1626 place count 268 transition count 487
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1634 place count 264 transition count 515
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1639 place count 264 transition count 510
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 1661 place count 264 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1669 place count 260 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1675 place count 260 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1696 place count 260 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1704 place count 256 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1710 place count 256 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1731 place count 256 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1739 place count 252 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1745 place count 252 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1766 place count 252 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1774 place count 248 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1780 place count 248 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1801 place count 248 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1809 place count 244 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1815 place count 244 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1836 place count 244 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1844 place count 240 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1850 place count 240 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1871 place count 240 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 1879 place count 236 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1885 place count 236 transition count 510
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 1906 place count 236 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 1914 place count 232 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 1920 place count 232 transition count 510
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 1941 place count 232 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 1949 place count 228 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 1955 place count 228 transition count 510
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 1976 place count 228 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 1984 place count 224 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 1990 place count 224 transition count 510
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2011 place count 224 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2019 place count 220 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2025 place count 220 transition count 510
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2046 place count 220 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2054 place count 216 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2060 place count 216 transition count 510
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2081 place count 216 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2089 place count 212 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 2095 place count 212 transition count 510
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 2116 place count 212 transition count 489
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 2120 place count 210 transition count 494
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 2122 place count 210 transition count 492
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 25 with 5 rules applied. Total rules applied 2127 place count 210 transition count 487
Free-agglomeration rule applied 50 times.
Iterating global reduction 25 with 50 rules applied. Total rules applied 2177 place count 210 transition count 437
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Graph (complete) has 454 edges and 160 vertex of which 16 are kept as prefixes of interest. Removing 144 places using SCC suffix rule.0 ms
Discarding 144 places :
Also discarding 196 output transitions
Drop transitions removed 196 transitions
Iterating post reduction 25 with 205 rules applied. Total rules applied 2382 place count 16 transition count 87
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 26 with 60 rules applied. Total rules applied 2442 place count 16 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 27 with 2 rules applied. Total rules applied 2444 place count 16 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 27 with 1 rules applied. Total rules applied 2445 place count 15 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 2446 place count 14 transition count 24
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 2 places and 0 transitions.
Iterating global reduction 28 with 3 rules applied. Total rules applied 2449 place count 12 transition count 23
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 28 with 3 rules applied. Total rules applied 2452 place count 12 transition count 20
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 2 places and 0 transitions.
Iterating global reduction 29 with 3 rules applied. Total rules applied 2455 place count 10 transition count 19
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 3 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 29 with 3 rules applied. Total rules applied 2458 place count 9 transition count 17
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 14 edges and 9 vertex of which 7 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 30 with 7 rules applied. Total rules applied 2465 place count 7 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 2467 place count 7 transition count 9
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 32 with 2 rules applied. Total rules applied 2469 place count 7 transition count 7
Graph (complete) has 9 edges and 7 vertex of which 5 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 32 with 1 rules applied. Total rules applied 2470 place count 5 transition count 7
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 2472 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 34 with 1 Pre rules applied. Total rules applied 2472 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 2474 place count 4 transition count 4
Applied a total of 2474 rules in 482 ms. Remains 4 /1314 variables (removed 1310) and now considering 4/1952 (removed 1948) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 482 ms. Remains : 4/1314 places, 4/1952 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), true, (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p2))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 407 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p2))]
Support contains 2 out of 1314 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1314/1314 places, 1952/1952 transitions.
Graph (trivial) has 1241 edges and 1314 vertex of which 304 / 1314 are part of one of the 22 SCC in 1 ms
Free SCC test removed 282 places
Ensure Unique test removed 315 transitions
Reduce isomorphic transitions removed 315 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 285 place count 1031 transition count 1352
Reduce places removed 284 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 335 rules applied. Total rules applied 620 place count 747 transition count 1301
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 654 place count 713 transition count 1301
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 654 place count 713 transition count 1191
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 874 place count 603 transition count 1191
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 914 place count 563 transition count 1017
Iterating global reduction 3 with 40 rules applied. Total rules applied 954 place count 563 transition count 1017
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 968 place count 563 transition count 1003
Performed 194 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 4 with 388 rules applied. Total rules applied 1356 place count 369 transition count 807
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1359 place count 369 transition count 804
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1376 place count 352 transition count 728
Iterating global reduction 5 with 17 rules applied. Total rules applied 1393 place count 352 transition count 728
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1410 place count 352 transition count 711
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 6 with 2 rules applied. Total rules applied 1412 place count 351 transition count 710
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 1512 place count 301 transition count 781
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1513 place count 301 transition count 780
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1529 place count 285 transition count 708
Iterating global reduction 7 with 16 rules applied. Total rules applied 1545 place count 285 transition count 708
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1576 place count 285 transition count 677
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1590 place count 285 transition count 663
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1594 place count 281 transition count 655
Iterating global reduction 8 with 4 rules applied. Total rules applied 1598 place count 281 transition count 655
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1602 place count 277 transition count 589
Iterating global reduction 8 with 4 rules applied. Total rules applied 1606 place count 277 transition count 589
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1610 place count 277 transition count 585
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1611 place count 277 transition count 585
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1612 place count 276 transition count 584
Applied a total of 1612 rules in 199 ms. Remains 276 /1314 variables (removed 1038) and now considering 584/1952 (removed 1368) transitions.
[2024-05-22 18:45:59] [INFO ] Flow matrix only has 561 transitions (discarded 23 similar events)
// Phase 1: matrix 561 rows 276 cols
[2024-05-22 18:45:59] [INFO ] Computed 79 invariants in 4 ms
[2024-05-22 18:45:59] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-22 18:45:59] [INFO ] Flow matrix only has 561 transitions (discarded 23 similar events)
[2024-05-22 18:45:59] [INFO ] Invariant cache hit.
[2024-05-22 18:45:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 18:46:00] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-22 18:46:00] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-22 18:46:00] [INFO ] Flow matrix only has 561 transitions (discarded 23 similar events)
[2024-05-22 18:46:00] [INFO ] Invariant cache hit.
[2024-05-22 18:46:00] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 276/1314 places, 584/1952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1311 ms. Remains : 276/1314 places, 584/1952 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 316 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 2819 steps, including 1 resets, run visited all 4 properties in 40 ms. (steps per millisecond=70 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 386 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Stuttering criterion allowed to conclude after 1244 steps with 0 reset in 16 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-00 finished in 12641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&(X(p2)||F(p3))))))'
Support contains 5 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 1352 transition count 1990
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 1352 transition count 1990
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 67 place count 1344 transition count 1982
Iterating global reduction 1 with 8 rules applied. Total rules applied 75 place count 1344 transition count 1982
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 1337 transition count 1975
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 1337 transition count 1975
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 1334 transition count 1972
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 1334 transition count 1972
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 1331 transition count 1969
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 1331 transition count 1969
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 1328 transition count 1966
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 1328 transition count 1966
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 1326 transition count 1964
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 1326 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 1325 transition count 1963
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 1325 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 1324 transition count 1962
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 1324 transition count 1962
Applied a total of 115 rules in 494 ms. Remains 1324 /1381 variables (removed 57) and now considering 1962/2035 (removed 73) transitions.
// Phase 1: matrix 1962 rows 1324 cols
[2024-05-22 18:46:02] [INFO ] Computed 79 invariants in 9 ms
[2024-05-22 18:46:02] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-22 18:46:02] [INFO ] Invariant cache hit.
[2024-05-22 18:46:03] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
[2024-05-22 18:46:03] [INFO ] Invariant cache hit.
[2024-05-22 18:46:05] [INFO ] Dead Transitions using invariants and state equation in 1812 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1324/1381 places, 1962/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4125 ms. Remains : 1324/1381 places, 1962/2035 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s88 1) (EQ s968 1)) (EQ s265 1)), p1:(OR (EQ s265 1) (AND (EQ s88 1) (EQ s968 1))), p3:(NEQ s883 1), p2:(NEQ s589 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 28916 steps with 12 reset in 155 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-01 finished in 4454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U p2)))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1312 edges and 1381 vertex of which 330 / 1381 are part of one of the 23 SCC in 2 ms
Free SCC test removed 307 places
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 315 place count 1073 transition count 1378
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 365 rules applied. Total rules applied 680 place count 759 transition count 1327
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 715 place count 725 transition count 1326
Reduce places removed 1 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 3 with 3 rules applied. Total rules applied 718 place count 724 transition count 1324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 719 place count 723 transition count 1324
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 111 Pre rules applied. Total rules applied 719 place count 723 transition count 1213
Deduced a syphon composed of 111 places in 3 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 5 with 222 rules applied. Total rules applied 941 place count 612 transition count 1213
Discarding 52 places :
Symmetric choice reduction at 5 with 52 rule applications. Total rules 993 place count 560 transition count 1013
Iterating global reduction 5 with 52 rules applied. Total rules applied 1045 place count 560 transition count 1013
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1058 place count 560 transition count 1000
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 1058 place count 560 transition count 996
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1066 place count 556 transition count 996
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1068 place count 554 transition count 992
Iterating global reduction 6 with 2 rules applied. Total rules applied 1070 place count 554 transition count 992
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1072 place count 554 transition count 990
Performed 190 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 7 with 380 rules applied. Total rules applied 1452 place count 364 transition count 797
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1454 place count 364 transition count 795
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 1473 place count 345 transition count 701
Iterating global reduction 8 with 19 rules applied. Total rules applied 1492 place count 345 transition count 701
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 1511 place count 345 transition count 682
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 9 with 98 rules applied. Total rules applied 1609 place count 296 transition count 749
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 1624 place count 281 transition count 683
Iterating global reduction 9 with 15 rules applied. Total rules applied 1639 place count 281 transition count 683
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 1670 place count 281 transition count 652
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 1685 place count 281 transition count 637
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1689 place count 277 transition count 629
Iterating global reduction 10 with 4 rules applied. Total rules applied 1693 place count 277 transition count 629
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1697 place count 273 transition count 563
Iterating global reduction 10 with 4 rules applied. Total rules applied 1701 place count 273 transition count 563
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1705 place count 273 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1706 place count 272 transition count 558
Applied a total of 1706 rules in 181 ms. Remains 272 /1381 variables (removed 1109) and now considering 558/2035 (removed 1477) transitions.
[2024-05-22 18:46:06] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
// Phase 1: matrix 535 rows 272 cols
[2024-05-22 18:46:06] [INFO ] Computed 79 invariants in 2 ms
[2024-05-22 18:46:06] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-22 18:46:06] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
[2024-05-22 18:46:06] [INFO ] Invariant cache hit.
[2024-05-22 18:46:06] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 18:46:07] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2024-05-22 18:46:07] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-22 18:46:07] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
[2024-05-22 18:46:07] [INFO ] Invariant cache hit.
[2024-05-22 18:46:07] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/1381 places, 558/2035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1480 ms. Remains : 272/1381 places, 558/2035 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s77 0), p2:(EQ s46 1), p1:(EQ s77 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2924 steps with 1 reset in 21 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-03 finished in 1614 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&&G(p1))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 1352 transition count 1990
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 1352 transition count 1990
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 67 place count 1344 transition count 1982
Iterating global reduction 1 with 8 rules applied. Total rules applied 75 place count 1344 transition count 1982
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 1336 transition count 1974
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 1336 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 96 place count 1331 transition count 1969
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 1331 transition count 1969
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 1326 transition count 1964
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 1326 transition count 1964
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 115 place count 1322 transition count 1960
Iterating global reduction 1 with 4 rules applied. Total rules applied 119 place count 1322 transition count 1960
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 1319 transition count 1957
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 1319 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 1317 transition count 1955
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 1315 transition count 1953
Applied a total of 133 rules in 487 ms. Remains 1315 /1381 variables (removed 66) and now considering 1953/2035 (removed 82) transitions.
// Phase 1: matrix 1953 rows 1315 cols
[2024-05-22 18:46:08] [INFO ] Computed 79 invariants in 13 ms
[2024-05-22 18:46:08] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-22 18:46:08] [INFO ] Invariant cache hit.
[2024-05-22 18:46:10] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
[2024-05-22 18:46:10] [INFO ] Invariant cache hit.
[2024-05-22 18:46:12] [INFO ] Dead Transitions using invariants and state equation in 2087 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1315/1381 places, 1953/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4528 ms. Remains : 1315/1381 places, 1953/2035 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s698 1), p0:(EQ s694 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-04 finished in 4728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 1352 transition count 1990
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 1352 transition count 1990
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 67 place count 1344 transition count 1982
Iterating global reduction 1 with 8 rules applied. Total rules applied 75 place count 1344 transition count 1982
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 1336 transition count 1974
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 1336 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 96 place count 1331 transition count 1969
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 1331 transition count 1969
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 1326 transition count 1964
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 1326 transition count 1964
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 115 place count 1322 transition count 1960
Iterating global reduction 1 with 4 rules applied. Total rules applied 119 place count 1322 transition count 1960
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 1319 transition count 1957
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 1319 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 1317 transition count 1955
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 1315 transition count 1953
Applied a total of 133 rules in 496 ms. Remains 1315 /1381 variables (removed 66) and now considering 1953/2035 (removed 82) transitions.
// Phase 1: matrix 1953 rows 1315 cols
[2024-05-22 18:46:12] [INFO ] Computed 79 invariants in 11 ms
[2024-05-22 18:46:13] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-22 18:46:13] [INFO ] Invariant cache hit.
[2024-05-22 18:46:14] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
[2024-05-22 18:46:14] [INFO ] Invariant cache hit.
[2024-05-22 18:46:16] [INFO ] Dead Transitions using invariants and state equation in 1619 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1315/1381 places, 1953/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3953 ms. Remains : 1315/1381 places, 1953/2035 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s736 0), p0:(EQ s794 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 417 ms.
Product exploration explored 100000 steps with 11 reset in 455 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 107 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1703 steps, including 0 resets, run visited all 4 properties in 30 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1315/1315 places, 1953/1953 transitions.
Applied a total of 0 rules in 53 ms. Remains 1315 /1315 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
[2024-05-22 18:46:18] [INFO ] Invariant cache hit.
[2024-05-22 18:46:18] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-22 18:46:18] [INFO ] Invariant cache hit.
[2024-05-22 18:46:20] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
[2024-05-22 18:46:20] [INFO ] Invariant cache hit.
[2024-05-22 18:46:22] [INFO ] Dead Transitions using invariants and state equation in 2001 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3958 ms. Remains : 1315/1315 places, 1953/1953 transitions.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 682 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 206 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13 reset in 372 ms.
Product exploration explored 100000 steps with 8 reset in 446 ms.
Built C files in :
/tmp/ltsmin16007273485620336390
[2024-05-22 18:46:24] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16007273485620336390
Running compilation step : cd /tmp/ltsmin16007273485620336390;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16007273485620336390;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16007273485620336390;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1315/1315 places, 1953/1953 transitions.
Applied a total of 0 rules in 42 ms. Remains 1315 /1315 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
[2024-05-22 18:46:27] [INFO ] Invariant cache hit.
[2024-05-22 18:46:27] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-22 18:46:27] [INFO ] Invariant cache hit.
[2024-05-22 18:46:29] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2024-05-22 18:46:29] [INFO ] Invariant cache hit.
[2024-05-22 18:46:30] [INFO ] Dead Transitions using invariants and state equation in 1800 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3803 ms. Remains : 1315/1315 places, 1953/1953 transitions.
Built C files in :
/tmp/ltsmin10044016698719809977
[2024-05-22 18:46:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10044016698719809977
Running compilation step : cd /tmp/ltsmin10044016698719809977;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10044016698719809977;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10044016698719809977;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 18:46:34] [INFO ] Flatten gal took : 97 ms
[2024-05-22 18:46:34] [INFO ] Flatten gal took : 91 ms
[2024-05-22 18:46:34] [INFO ] Time to serialize gal into /tmp/LTL14000481429045302556.gal : 35 ms
[2024-05-22 18:46:34] [INFO ] Time to serialize properties into /tmp/LTL11671966883352847991.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/LTL14000481429045302556.gal' '-t' 'CGAL' '-hoa' '/tmp/aut61375931761304121.hoa' '-atoms' '/tmp/LTL11671966883352847991.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL11671966883352847991.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut61375931761304121.hoa
Detected timeout of ITS tools.
[2024-05-22 18:46:49] [INFO ] Flatten gal took : 60 ms
[2024-05-22 18:46:49] [INFO ] Flatten gal took : 65 ms
[2024-05-22 18:46:49] [INFO ] Time to serialize gal into /tmp/LTL6011500963083404662.gal : 10 ms
[2024-05-22 18:46:49] [INFO ] Time to serialize properties into /tmp/LTL12438509176783388799.ltl : 5 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/LTL6011500963083404662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12438509176783388799.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p1666==0)")||(X("(p1583==0)"))))))
Formula 0 simplified : XF(!"(p1666==0)" & X!"(p1583==0)")
Detected timeout of ITS tools.
[2024-05-22 18:47:04] [INFO ] Flatten gal took : 54 ms
[2024-05-22 18:47:04] [INFO ] Applying decomposition
[2024-05-22 18:47:04] [INFO ] Flatten gal took : 56 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/graph13434622396802976295.txt' '-o' '/tmp/graph13434622396802976295.bin' '-w' '/tmp/graph13434622396802976295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13434622396802976295.bin' '-l' '-1' '-v' '-w' '/tmp/graph13434622396802976295.weights' '-q' '0' '-e' '0.001'
[2024-05-22 18:47:05] [INFO ] Decomposing Gal with order
[2024-05-22 18:47:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 18:47:05] [INFO ] Removed a total of 1439 redundant transitions.
[2024-05-22 18:47:05] [INFO ] Flatten gal took : 228 ms
[2024-05-22 18:47:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 32 ms.
[2024-05-22 18:47:05] [INFO ] Time to serialize gal into /tmp/LTL9889003556772422129.gal : 32 ms
[2024-05-22 18:47:05] [INFO ] Time to serialize properties into /tmp/LTL15864275626115204320.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9889003556772422129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15864275626115204320.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i18.u320.p1666==0)")||(X("(i15.u296.p1583==0)"))))))
Formula 0 simplified : XF(!"(i18.u320.p1666==0)" & X!"(i15.u296.p1583==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1971745210695484402
[2024-05-22 18:47:20] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1971745210695484402
Running compilation step : cd /tmp/ltsmin1971745210695484402;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1971745210695484402;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1971745210695484402;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DLCshifumi-PT-2b-LTLFireability-05 finished in 71519 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 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 1351 transition count 1989
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 1351 transition count 1989
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 1342 transition count 1980
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 1342 transition count 1980
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 1333 transition count 1971
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 1333 transition count 1971
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 1328 transition count 1966
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 1328 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 1323 transition count 1961
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 1323 transition count 1961
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 1319 transition count 1957
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 1319 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 1316 transition count 1954
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 1314 transition count 1952
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 1314 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 1312 transition count 1950
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 1312 transition count 1950
Applied a total of 139 rules in 557 ms. Remains 1312 /1381 variables (removed 69) and now considering 1950/2035 (removed 85) transitions.
// Phase 1: matrix 1950 rows 1312 cols
[2024-05-22 18:47:24] [INFO ] Computed 79 invariants in 6 ms
[2024-05-22 18:47:25] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-22 18:47:25] [INFO ] Invariant cache hit.
[2024-05-22 18:47:26] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
[2024-05-22 18:47:26] [INFO ] Invariant cache hit.
[2024-05-22 18:47:28] [INFO ] Dead Transitions using invariants and state equation in 2148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1312/1381 places, 1950/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4700 ms. Remains : 1312/1381 places, 1950/2035 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s557 1) (EQ s1261 1)), p0:(EQ s953 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-06 finished in 5080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(!p0) U p1))))'
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1311 edges and 1381 vertex of which 330 / 1381 are part of one of the 23 SCC in 1 ms
Free SCC test removed 307 places
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 315 place count 1073 transition count 1378
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 365 rules applied. Total rules applied 680 place count 759 transition count 1327
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 714 place count 725 transition count 1327
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 714 place count 725 transition count 1214
Deduced a syphon composed of 113 places in 3 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 940 place count 612 transition count 1214
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 992 place count 560 transition count 1014
Iterating global reduction 3 with 52 rules applied. Total rules applied 1044 place count 560 transition count 1014
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1057 place count 560 transition count 1001
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1057 place count 560 transition count 997
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1065 place count 556 transition count 997
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1067 place count 554 transition count 993
Iterating global reduction 4 with 2 rules applied. Total rules applied 1069 place count 554 transition count 993
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1071 place count 554 transition count 991
Performed 189 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 189 places in 0 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 5 with 378 rules applied. Total rules applied 1449 place count 365 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1452 place count 365 transition count 797
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1471 place count 346 transition count 703
Iterating global reduction 6 with 19 rules applied. Total rules applied 1490 place count 346 transition count 703
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1509 place count 346 transition count 684
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 7 with 2 rules applied. Total rules applied 1511 place count 345 transition count 683
Performed 48 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 1607 place count 297 transition count 750
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1621 place count 283 transition count 688
Iterating global reduction 7 with 14 rules applied. Total rules applied 1635 place count 283 transition count 688
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1664 place count 283 transition count 659
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 1681 place count 283 transition count 642
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1685 place count 279 transition count 634
Iterating global reduction 8 with 4 rules applied. Total rules applied 1689 place count 279 transition count 634
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1693 place count 275 transition count 568
Iterating global reduction 8 with 4 rules applied. Total rules applied 1697 place count 275 transition count 568
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1701 place count 275 transition count 564
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1702 place count 274 transition count 563
Applied a total of 1702 rules in 179 ms. Remains 274 /1381 variables (removed 1107) and now considering 563/2035 (removed 1472) transitions.
[2024-05-22 18:47:29] [INFO ] Flow matrix only has 540 transitions (discarded 23 similar events)
// Phase 1: matrix 540 rows 274 cols
[2024-05-22 18:47:29] [INFO ] Computed 79 invariants in 5 ms
[2024-05-22 18:47:29] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 18:47:29] [INFO ] Flow matrix only has 540 transitions (discarded 23 similar events)
[2024-05-22 18:47:29] [INFO ] Invariant cache hit.
[2024-05-22 18:47:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-22 18:47:29] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2024-05-22 18:47:29] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-22 18:47:29] [INFO ] Flow matrix only has 540 transitions (discarded 23 similar events)
[2024-05-22 18:47:29] [INFO ] Invariant cache hit.
[2024-05-22 18:47:30] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/1381 places, 563/2035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1259 ms. Remains : 274/1381 places, 563/2035 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s56 1), p0:(AND (EQ s47 1) (EQ s144 1) (EQ s77 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-07 finished in 1394 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' '!(((p0 U X(X(G((p0||G(p1))))))&&F(p1)))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1364 transition count 2003
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1364 transition count 2003
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 1364 transition count 2002
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 1354 transition count 1992
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 1354 transition count 1992
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 1346 transition count 1984
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 1346 transition count 1984
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 79 place count 1338 transition count 1976
Iterating global reduction 1 with 8 rules applied. Total rules applied 87 place count 1338 transition count 1976
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 1333 transition count 1971
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 1333 transition count 1971
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 1328 transition count 1966
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 1328 transition count 1966
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 111 place count 1324 transition count 1962
Iterating global reduction 1 with 4 rules applied. Total rules applied 115 place count 1324 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 1321 transition count 1959
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 1321 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 1319 transition count 1957
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 1319 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 1317 transition count 1955
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 1317 transition count 1955
Applied a total of 129 rules in 522 ms. Remains 1317 /1381 variables (removed 64) and now considering 1955/2035 (removed 80) transitions.
// Phase 1: matrix 1955 rows 1317 cols
[2024-05-22 18:47:30] [INFO ] Computed 79 invariants in 9 ms
[2024-05-22 18:47:31] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-22 18:47:31] [INFO ] Invariant cache hit.
[2024-05-22 18:47:32] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2024-05-22 18:47:32] [INFO ] Invariant cache hit.
[2024-05-22 18:47:34] [INFO ] Dead Transitions using invariants and state equation in 1727 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1317/1381 places, 1955/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4201 ms. Remains : 1317/1381 places, 1955/2035 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s704 1), p1:(EQ s420 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]]
Stuttering criterion allowed to conclude after 9319 steps with 0 reset in 38 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-08 finished in 4511 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' '!((p0 U X(p1)))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1364 transition count 2003
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1364 transition count 2003
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 1364 transition count 2002
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 1353 transition count 1991
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 1353 transition count 1991
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 65 place count 1345 transition count 1983
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 1345 transition count 1983
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 81 place count 1337 transition count 1975
Iterating global reduction 1 with 8 rules applied. Total rules applied 89 place count 1337 transition count 1975
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 1333 transition count 1971
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 1333 transition count 1971
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 101 place count 1329 transition count 1967
Iterating global reduction 1 with 4 rules applied. Total rules applied 105 place count 1329 transition count 1967
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 1326 transition count 1964
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 1326 transition count 1964
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 1323 transition count 1961
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 1323 transition count 1961
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 1321 transition count 1959
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 1321 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 1319 transition count 1957
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 1319 transition count 1957
Applied a total of 125 rules in 496 ms. Remains 1319 /1381 variables (removed 62) and now considering 1957/2035 (removed 78) transitions.
// Phase 1: matrix 1957 rows 1319 cols
[2024-05-22 18:47:35] [INFO ] Computed 79 invariants in 6 ms
[2024-05-22 18:47:35] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-22 18:47:35] [INFO ] Invariant cache hit.
[2024-05-22 18:47:37] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
[2024-05-22 18:47:37] [INFO ] Invariant cache hit.
[2024-05-22 18:47:38] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1319/1381 places, 1957/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3817 ms. Remains : 1319/1381 places, 1957/2035 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1124 1) (EQ s1023 1)), p1:(NEQ s300 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1540 ms.
Product exploration explored 100000 steps with 50000 reset in 1542 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 24 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-2b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-2b-LTLFireability-09 finished in 7207 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 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1315 edges and 1381 vertex of which 330 / 1381 are part of one of the 23 SCC in 1 ms
Free SCC test removed 307 places
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 317 transitions
Trivial Post-agglo rules discarded 317 transitions
Performed 317 trivial Post agglomeration. Transition count delta: 317
Iterating post reduction 0 with 317 rules applied. Total rules applied 318 place count 1073 transition count 1375
Reduce places removed 317 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 371 rules applied. Total rules applied 689 place count 756 transition count 1321
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 725 place count 720 transition count 1321
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 725 place count 720 transition count 1210
Deduced a syphon composed of 111 places in 3 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 947 place count 609 transition count 1210
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 999 place count 557 transition count 1025
Iterating global reduction 3 with 52 rules applied. Total rules applied 1051 place count 557 transition count 1025
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1064 place count 557 transition count 1012
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1064 place count 557 transition count 1008
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1072 place count 553 transition count 1008
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1074 place count 551 transition count 1004
Iterating global reduction 4 with 2 rules applied. Total rules applied 1076 place count 551 transition count 1004
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1078 place count 551 transition count 1002
Performed 189 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 189 places in 0 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 5 with 378 rules applied. Total rules applied 1456 place count 362 transition count 811
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1459 place count 362 transition count 808
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1478 place count 343 transition count 714
Iterating global reduction 6 with 19 rules applied. Total rules applied 1497 place count 343 transition count 714
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1516 place count 343 transition count 695
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 7 with 2 rules applied. Total rules applied 1518 place count 342 transition count 694
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1616 place count 293 transition count 762
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1631 place count 278 transition count 696
Iterating global reduction 7 with 15 rules applied. Total rules applied 1646 place count 278 transition count 696
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1677 place count 278 transition count 665
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1691 place count 278 transition count 651
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1694 place count 275 transition count 645
Iterating global reduction 8 with 3 rules applied. Total rules applied 1697 place count 275 transition count 645
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1700 place count 272 transition count 596
Iterating global reduction 8 with 3 rules applied. Total rules applied 1703 place count 272 transition count 596
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1706 place count 272 transition count 593
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1707 place count 271 transition count 592
Applied a total of 1707 rules in 162 ms. Remains 271 /1381 variables (removed 1110) and now considering 592/2035 (removed 1443) transitions.
[2024-05-22 18:47:42] [INFO ] Flow matrix only has 568 transitions (discarded 24 similar events)
// Phase 1: matrix 568 rows 271 cols
[2024-05-22 18:47:42] [INFO ] Computed 79 invariants in 1 ms
[2024-05-22 18:47:42] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 18:47:42] [INFO ] Flow matrix only has 568 transitions (discarded 24 similar events)
[2024-05-22 18:47:42] [INFO ] Invariant cache hit.
[2024-05-22 18:47:42] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 18:47:42] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-22 18:47:42] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-22 18:47:42] [INFO ] Flow matrix only has 568 transitions (discarded 24 similar events)
[2024-05-22 18:47:42] [INFO ] Invariant cache hit.
[2024-05-22 18:47:43] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/1381 places, 592/2035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1253 ms. Remains : 271/1381 places, 592/2035 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-10 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:(AND (EQ s77 1) (EQ s102 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 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-10 finished in 1355 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 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1362 transition count 2001
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1362 transition count 2001
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1362 transition count 2000
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 1350 transition count 1988
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 1350 transition count 1988
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 72 place count 1341 transition count 1979
Iterating global reduction 1 with 9 rules applied. Total rules applied 81 place count 1341 transition count 1979
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 90 place count 1332 transition count 1970
Iterating global reduction 1 with 9 rules applied. Total rules applied 99 place count 1332 transition count 1970
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 1327 transition count 1965
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 1327 transition count 1965
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 114 place count 1322 transition count 1960
Iterating global reduction 1 with 5 rules applied. Total rules applied 119 place count 1322 transition count 1960
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 123 place count 1318 transition count 1956
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 1318 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 1315 transition count 1953
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 1315 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 1313 transition count 1951
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 1313 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 1311 transition count 1949
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 1311 transition count 1949
Applied a total of 141 rules in 484 ms. Remains 1311 /1381 variables (removed 70) and now considering 1949/2035 (removed 86) transitions.
// Phase 1: matrix 1949 rows 1311 cols
[2024-05-22 18:47:43] [INFO ] Computed 79 invariants in 11 ms
[2024-05-22 18:47:44] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-22 18:47:44] [INFO ] Invariant cache hit.
[2024-05-22 18:47:45] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
[2024-05-22 18:47:45] [INFO ] Invariant cache hit.
[2024-05-22 18:47:47] [INFO ] Dead Transitions using invariants and state equation in 1762 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1311/1381 places, 1949/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4066 ms. Remains : 1311/1381 places, 1949/2035 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s927 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 888 steps with 0 reset in 3 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-11 finished in 4175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X((G(p2) U !p1)))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 1352 transition count 1990
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 1352 transition count 1990
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 1343 transition count 1981
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 1343 transition count 1981
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 1334 transition count 1972
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 1334 transition count 1972
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 100 place count 1329 transition count 1967
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 1329 transition count 1967
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 110 place count 1324 transition count 1962
Iterating global reduction 1 with 5 rules applied. Total rules applied 115 place count 1324 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 119 place count 1320 transition count 1958
Iterating global reduction 1 with 4 rules applied. Total rules applied 123 place count 1320 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 1317 transition count 1955
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 1315 transition count 1953
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 1315 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 1313 transition count 1951
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 1313 transition count 1951
Applied a total of 137 rules in 488 ms. Remains 1313 /1381 variables (removed 68) and now considering 1951/2035 (removed 84) transitions.
// Phase 1: matrix 1951 rows 1313 cols
[2024-05-22 18:47:48] [INFO ] Computed 79 invariants in 5 ms
[2024-05-22 18:47:48] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-22 18:47:48] [INFO ] Invariant cache hit.
[2024-05-22 18:47:49] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
[2024-05-22 18:47:49] [INFO ] Invariant cache hit.
[2024-05-22 18:47:51] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1313/1381 places, 1951/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4198 ms. Remains : 1313/1381 places, 1951/2035 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), p1]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s958 1), p0:(EQ s253 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 98 reset in 493 ms.
Product exploration explored 100000 steps with 98 reset in 419 ms.
Computed a total of 144 stabilizing places and 144 stable transitions
Computed a total of 144 stabilizing places and 144 stable transitions
Detected a total of 144/1313 stabilizing places and 144/1951 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 149 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p1]
Finished random walk after 923 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=153 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 220 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p1]
Stuttering acceptance computed with spot in 41 ms :[p1]
[2024-05-22 18:47:53] [INFO ] Invariant cache hit.
[2024-05-22 18:47:54] [INFO ] [Real]Absence check using 79 positive place invariants in 95 ms returned sat
[2024-05-22 18:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 18:47:57] [INFO ] [Real]Absence check using state equation in 3062 ms returned sat
[2024-05-22 18:47:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:47:59] [INFO ] [Nat]Absence check using 79 positive place invariants in 107 ms returned sat
[2024-05-22 18:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 18:48:02] [INFO ] [Nat]Absence check using state equation in 2698 ms returned sat
[2024-05-22 18:48:02] [INFO ] Computed and/alt/rep : 1892/3089/1892 causal constraints (skipped 58 transitions) in 337 ms.
[2024-05-22 18:48:14] [INFO ] Deduced a trap composed of 8 places in 1021 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-22 18:48:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p1
Could not prove EG p1
Support contains 1 out of 1313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1313/1313 places, 1951/1951 transitions.
Graph (trivial) has 1238 edges and 1313 vertex of which 305 / 1313 are part of one of the 24 SCC in 0 ms
Free SCC test removed 281 places
Ensure Unique test removed 314 transitions
Reduce isomorphic transitions removed 314 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 282 place count 1031 transition count 1355
Reduce places removed 281 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 332 rules applied. Total rules applied 614 place count 750 transition count 1304
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 36 rules applied. Total rules applied 650 place count 716 transition count 1302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 652 place count 714 transition count 1302
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 108 Pre rules applied. Total rules applied 652 place count 714 transition count 1194
Deduced a syphon composed of 108 places in 3 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 868 place count 606 transition count 1194
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 907 place count 567 transition count 1035
Iterating global reduction 4 with 39 rules applied. Total rules applied 946 place count 567 transition count 1035
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 961 place count 567 transition count 1020
Performed 198 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 5 with 396 rules applied. Total rules applied 1357 place count 369 transition count 820
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1359 place count 369 transition count 818
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1377 place count 351 transition count 740
Iterating global reduction 6 with 18 rules applied. Total rules applied 1395 place count 351 transition count 740
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1412 place count 351 transition count 723
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 7 with 2 rules applied. Total rules applied 1414 place count 350 transition count 722
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1512 place count 301 transition count 794
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1527 place count 286 transition count 730
Iterating global reduction 7 with 15 rules applied. Total rules applied 1542 place count 286 transition count 730
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1574 place count 286 transition count 698
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 1586 place count 286 transition count 686
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1588 place count 284 transition count 682
Iterating global reduction 8 with 2 rules applied. Total rules applied 1590 place count 284 transition count 682
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1592 place count 282 transition count 650
Iterating global reduction 8 with 2 rules applied. Total rules applied 1594 place count 282 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1596 place count 282 transition count 648
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1597 place count 281 transition count 647
Applied a total of 1597 rules in 130 ms. Remains 281 /1313 variables (removed 1032) and now considering 647/1951 (removed 1304) transitions.
[2024-05-22 18:48:14] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
// Phase 1: matrix 617 rows 281 cols
[2024-05-22 18:48:14] [INFO ] Computed 79 invariants in 2 ms
[2024-05-22 18:48:14] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-22 18:48:14] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
[2024-05-22 18:48:14] [INFO ] Invariant cache hit.
[2024-05-22 18:48:14] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 18:48:15] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2024-05-22 18:48:15] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-22 18:48:15] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
[2024-05-22 18:48:15] [INFO ] Invariant cache hit.
[2024-05-22 18:48:15] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/1313 places, 647/1951 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1367 ms. Remains : 281/1313 places, 647/1951 transitions.
Computed a total of 3 stabilizing places and 18 stable transitions
Computed a total of 3 stabilizing places and 18 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p1]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p1]
Stuttering acceptance computed with spot in 39 ms :[p1]
[2024-05-22 18:48:15] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
[2024-05-22 18:48:15] [INFO ] Invariant cache hit.
[2024-05-22 18:48:16] [INFO ] [Real]Absence check using 79 positive place invariants in 34 ms returned sat
[2024-05-22 18:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 18:48:16] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2024-05-22 18:48:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:48:17] [INFO ] [Nat]Absence check using 79 positive place invariants in 30 ms returned sat
[2024-05-22 18:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 18:48:17] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2024-05-22 18:48:17] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 18:48:17] [INFO ] [Nat]Added 49 Read/Feed constraints in 23 ms returned sat
[2024-05-22 18:48:17] [INFO ] Computed and/alt/rep : 383/839/383 causal constraints (skipped 169 transitions) in 58 ms.
[2024-05-22 18:48:17] [INFO ] Added : 16 causal constraints over 4 iterations in 252 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 43 ms :[p1]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-12 finished in 30044 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||G(F(p1)))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1314 edges and 1381 vertex of which 330 / 1381 are part of one of the 23 SCC in 1 ms
Free SCC test removed 307 places
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 317 place count 1073 transition count 1376
Reduce places removed 316 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 370 rules applied. Total rules applied 687 place count 757 transition count 1322
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 723 place count 721 transition count 1322
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 723 place count 721 transition count 1211
Deduced a syphon composed of 111 places in 2 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 945 place count 610 transition count 1211
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 996 place count 559 transition count 1012
Iterating global reduction 3 with 51 rules applied. Total rules applied 1047 place count 559 transition count 1012
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1060 place count 559 transition count 999
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1060 place count 559 transition count 996
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1066 place count 556 transition count 996
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1067 place count 555 transition count 994
Iterating global reduction 4 with 1 rules applied. Total rules applied 1068 place count 555 transition count 994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1069 place count 555 transition count 993
Performed 190 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 5 with 380 rules applied. Total rules applied 1449 place count 365 transition count 801
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1452 place count 365 transition count 798
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1471 place count 346 transition count 704
Iterating global reduction 6 with 19 rules applied. Total rules applied 1490 place count 346 transition count 704
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1509 place count 346 transition count 685
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 7 with 2 rules applied. Total rules applied 1511 place count 345 transition count 684
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 1611 place count 295 transition count 759
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1626 place count 280 transition count 693
Iterating global reduction 7 with 15 rules applied. Total rules applied 1641 place count 280 transition count 693
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1673 place count 280 transition count 661
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 1691 place count 280 transition count 643
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1695 place count 276 transition count 635
Iterating global reduction 8 with 4 rules applied. Total rules applied 1699 place count 276 transition count 635
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1703 place count 272 transition count 567
Iterating global reduction 8 with 4 rules applied. Total rules applied 1707 place count 272 transition count 567
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1711 place count 272 transition count 563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1712 place count 271 transition count 562
Applied a total of 1712 rules in 150 ms. Remains 271 /1381 variables (removed 1110) and now considering 562/2035 (removed 1473) transitions.
[2024-05-22 18:48:17] [INFO ] Flow matrix only has 537 transitions (discarded 25 similar events)
// Phase 1: matrix 537 rows 271 cols
[2024-05-22 18:48:17] [INFO ] Computed 79 invariants in 1 ms
[2024-05-22 18:48:18] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-22 18:48:18] [INFO ] Flow matrix only has 537 transitions (discarded 25 similar events)
[2024-05-22 18:48:18] [INFO ] Invariant cache hit.
[2024-05-22 18:48:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 18:48:18] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-05-22 18:48:18] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-22 18:48:18] [INFO ] Flow matrix only has 537 transitions (discarded 25 similar events)
[2024-05-22 18:48:18] [INFO ] Invariant cache hit.
[2024-05-22 18:48:18] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/1381 places, 562/2035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1244 ms. Remains : 271/1381 places, 562/2035 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s42 1), p1:(EQ s168 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-13 finished in 1338 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 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1363 transition count 2002
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1363 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1363 transition count 2001
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 1351 transition count 1989
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 1351 transition count 1989
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 1342 transition count 1980
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 1342 transition count 1980
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 1333 transition count 1971
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 1333 transition count 1971
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 1328 transition count 1966
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 1328 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 1323 transition count 1961
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 1323 transition count 1961
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 1319 transition count 1957
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 1319 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 1316 transition count 1954
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 1314 transition count 1952
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 1314 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 1312 transition count 1950
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 1312 transition count 1950
Applied a total of 139 rules in 499 ms. Remains 1312 /1381 variables (removed 69) and now considering 1950/2035 (removed 85) transitions.
// Phase 1: matrix 1950 rows 1312 cols
[2024-05-22 18:48:19] [INFO ] Computed 79 invariants in 5 ms
[2024-05-22 18:48:20] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-22 18:48:20] [INFO ] Invariant cache hit.
[2024-05-22 18:48:21] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
[2024-05-22 18:48:21] [INFO ] Invariant cache hit.
[2024-05-22 18:48:22] [INFO ] Dead Transitions using invariants and state equation in 1464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1312/1381 places, 1950/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3910 ms. Remains : 1312/1381 places, 1950/2035 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-14 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 s1111 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 5728 steps with 1 reset in 21 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-14 finished in 4028 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((G(p1)&&X(F((p2||G(p3))))))))'
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1365 transition count 2019
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1365 transition count 2019
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1365 transition count 2018
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 1355 transition count 2008
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 place count 1355 transition count 2008
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 1348 transition count 2001
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 1348 transition count 2001
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 1341 transition count 1994
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 1341 transition count 1994
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 1337 transition count 1990
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 1337 transition count 1990
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 1333 transition count 1986
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 1333 transition count 1986
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 101 place count 1329 transition count 1982
Iterating global reduction 1 with 4 rules applied. Total rules applied 105 place count 1329 transition count 1982
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 1326 transition count 1979
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 1326 transition count 1979
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 1324 transition count 1977
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 1324 transition count 1977
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 1322 transition count 1975
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 1322 transition count 1975
Applied a total of 119 rules in 484 ms. Remains 1322 /1381 variables (removed 59) and now considering 1975/2035 (removed 60) transitions.
// Phase 1: matrix 1975 rows 1322 cols
[2024-05-22 18:48:23] [INFO ] Computed 79 invariants in 5 ms
[2024-05-22 18:48:24] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-22 18:48:24] [INFO ] Invariant cache hit.
[2024-05-22 18:48:25] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 1970 ms to find 0 implicit places.
[2024-05-22 18:48:25] [INFO ] Invariant cache hit.
[2024-05-22 18:48:27] [INFO ] Dead Transitions using invariants and state equation in 2108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1322/1381 places, 1975/2035 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4565 ms. Remains : 1322/1381 places, 1975/2035 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s779 0) (EQ s1104 0)), p1:(AND (EQ s779 1) (EQ s1104 1)), p2:(EQ s369 1), p3:(EQ s882 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-15 finished in 4920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Found a Lengthening insensitive property : DLCshifumi-PT-2b-LTLFireability-05
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1381/1381 places, 2035/2035 transitions.
Graph (trivial) has 1313 edges and 1381 vertex of which 326 / 1381 are part of one of the 23 SCC in 1 ms
Free SCC test removed 303 places
Ensure Unique test removed 337 transitions
Reduce isomorphic transitions removed 337 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 320 place count 1077 transition count 1378
Reduce places removed 319 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 373 rules applied. Total rules applied 693 place count 758 transition count 1324
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 729 place count 722 transition count 1324
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 729 place count 722 transition count 1213
Deduced a syphon composed of 111 places in 2 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 951 place count 611 transition count 1213
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1003 place count 559 transition count 1013
Iterating global reduction 3 with 52 rules applied. Total rules applied 1055 place count 559 transition count 1013
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1068 place count 559 transition count 1000
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1068 place count 559 transition count 996
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1076 place count 555 transition count 996
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1078 place count 553 transition count 992
Iterating global reduction 4 with 2 rules applied. Total rules applied 1080 place count 553 transition count 992
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1082 place count 553 transition count 990
Performed 189 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 189 places in 0 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 5 with 378 rules applied. Total rules applied 1460 place count 364 transition count 799
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1463 place count 364 transition count 796
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1481 place count 346 transition count 718
Iterating global reduction 6 with 18 rules applied. Total rules applied 1499 place count 346 transition count 718
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1517 place count 346 transition count 700
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 7 with 2 rules applied. Total rules applied 1519 place count 345 transition count 699
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1617 place count 296 transition count 768
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1632 place count 281 transition count 702
Iterating global reduction 7 with 15 rules applied. Total rules applied 1647 place count 281 transition count 702
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1678 place count 281 transition count 671
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1682 place count 281 transition count 667
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1683 place count 280 transition count 666
Applied a total of 1683 rules in 134 ms. Remains 280 /1381 variables (removed 1101) and now considering 666/2035 (removed 1369) transitions.
[2024-05-22 18:48:28] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
// Phase 1: matrix 637 rows 280 cols
[2024-05-22 18:48:28] [INFO ] Computed 79 invariants in 2 ms
[2024-05-22 18:48:28] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-22 18:48:28] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-05-22 18:48:28] [INFO ] Invariant cache hit.
[2024-05-22 18:48:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 18:48:28] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-22 18:48:28] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-05-22 18:48:28] [INFO ] Invariant cache hit.
[2024-05-22 18:48:29] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 280/1381 places, 666/2035 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1244 ms. Remains : 280/1381 places, 666/2035 transitions.
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s76 0), p0:(EQ s85 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 546 ms.
Product exploration explored 100000 steps with 0 reset in 692 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 254 steps, including 0 resets, run visited all 4 properties in 11 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 315 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 666/666 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2024-05-22 18:48:31] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-05-22 18:48:31] [INFO ] Invariant cache hit.
[2024-05-22 18:48:31] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-22 18:48:31] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-05-22 18:48:31] [INFO ] Invariant cache hit.
[2024-05-22 18:48:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 18:48:32] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-22 18:48:32] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-05-22 18:48:32] [INFO ] Invariant cache hit.
[2024-05-22 18:48:32] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1200 ms. Remains : 280/280 places, 666/666 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 321 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 788 steps, including 0 resets, run visited all 4 properties in 28 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 311 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3 reset in 552 ms.
Product exploration explored 100000 steps with 2 reset in 657 ms.
Built C files in :
/tmp/ltsmin6464237519433323651
[2024-05-22 18:48:35] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6464237519433323651
Running compilation step : cd /tmp/ltsmin6464237519433323651;'/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 1627 ms.
Running link step : cd /tmp/ltsmin6464237519433323651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6464237519433323651;'/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/stateBased1994596495989704985.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 666/666 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2024-05-22 18:48:50] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-05-22 18:48:50] [INFO ] Invariant cache hit.
[2024-05-22 18:48:50] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-22 18:48:50] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-05-22 18:48:50] [INFO ] Invariant cache hit.
[2024-05-22 18:48:50] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 18:48:51] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2024-05-22 18:48:51] [INFO ] Flow matrix only has 637 transitions (discarded 29 similar events)
[2024-05-22 18:48:51] [INFO ] Invariant cache hit.
[2024-05-22 18:48:51] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1164 ms. Remains : 280/280 places, 666/666 transitions.
Built C files in :
/tmp/ltsmin15665424590566649698
[2024-05-22 18:48:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15665424590566649698
Running compilation step : cd /tmp/ltsmin15665424590566649698;'/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 1580 ms.
Running link step : cd /tmp/ltsmin15665424590566649698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15665424590566649698;'/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/stateBased14141079344987695758.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 18:49:06] [INFO ] Flatten gal took : 37 ms
[2024-05-22 18:49:06] [INFO ] Flatten gal took : 37 ms
[2024-05-22 18:49:06] [INFO ] Time to serialize gal into /tmp/LTL5288344229592895567.gal : 6 ms
[2024-05-22 18:49:06] [INFO ] Time to serialize properties into /tmp/LTL14222095595119229464.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5288344229592895567.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6355379668923610639.hoa' '-atoms' '/tmp/LTL14222095595119229464.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...318
Loading property file /tmp/LTL14222095595119229464.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6355379668923610639.hoa
Reverse transition relation is NOT exact ! Due to transitions t413, t418, t424, t429, t442, t447, t502, t507, t513, t518, t531, t536, t540, t1.t7.t13.t19.t...10368
Detected timeout of ITS tools.
[2024-05-22 18:49:21] [INFO ] Flatten gal took : 44 ms
[2024-05-22 18:49:22] [INFO ] Flatten gal took : 33 ms
[2024-05-22 18:49:22] [INFO ] Time to serialize gal into /tmp/LTL2828077636531844487.gal : 8 ms
[2024-05-22 18:49:22] [INFO ] Time to serialize properties into /tmp/LTL3464990621248337662.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/LTL2828077636531844487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3464990621248337662.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...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p1666==0)")||(X("(p1583==0)"))))))
Formula 0 simplified : XF(!"(p1666==0)" & X!"(p1583==0)")
Reverse transition relation is NOT exact ! Due to transitions t413, t418, t424, t429, t442, t447, t502, t507, t513, t518, t531, t536, t540, t1.t7.t13.t19.t...10368
Detected timeout of ITS tools.
[2024-05-22 18:49:37] [INFO ] Flatten gal took : 38 ms
[2024-05-22 18:49:37] [INFO ] Applying decomposition
[2024-05-22 18:49:37] [INFO ] Flatten gal took : 29 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/graph5772898775567322115.txt' '-o' '/tmp/graph5772898775567322115.bin' '-w' '/tmp/graph5772898775567322115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5772898775567322115.bin' '-l' '-1' '-v' '-w' '/tmp/graph5772898775567322115.weights' '-q' '0' '-e' '0.001'
[2024-05-22 18:49:37] [INFO ] Decomposing Gal with order
[2024-05-22 18:49:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 18:49:37] [INFO ] Removed a total of 1566 redundant transitions.
[2024-05-22 18:49:37] [INFO ] Flatten gal took : 61 ms
[2024-05-22 18:49:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 187 ms.
[2024-05-22 18:49:37] [INFO ] Time to serialize gal into /tmp/LTL5971613630413246453.gal : 6 ms
[2024-05-22 18:49:37] [INFO ] Time to serialize properties into /tmp/LTL314912443065426494.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/LTL5971613630413246453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL314912443065426494.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...253
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i11.u20.p1666==0)")||(X("(i11.u15.p1583==0)"))))))
Formula 0 simplified : XF(!"(i11.u20.p1666==0)" & X!"(i11.u15.p1583==0)")
Reverse transition relation is NOT exact ! Due to transitions t1_t7_t13_t19_t25_t31_t37_t43_t49_t55_t61_t67_t73_t79_t85_t91_t97_t103_t109_t115_t121_t127_t1...949
Computing Next relation with stutter on 589824 deadlock states
3 unique states visited
0 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
15 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.235773,21772,1,0,10255,143,2967,10809,190,274,22306
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property DLCshifumi-PT-2b-LTLFireability-05 finished in 69849 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2024-05-22 18:49:37] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15400981556228133931
[2024-05-22 18:49:37] [INFO ] Too many transitions (2035) to apply POR reductions. Disabling POR matrices.
[2024-05-22 18:49:37] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15400981556228133931
[2024-05-22 18:49:37] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin15400981556228133931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 18:49:37] [INFO ] Flatten gal took : 54 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/graph9148878479216250540.txt' '-o' '/tmp/graph9148878479216250540.bin' '-w' '/tmp/graph9148878479216250540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9148878479216250540.bin' '-l' '-1' '-v' '-w' '/tmp/graph9148878479216250540.weights' '-q' '0' '-e' '0.001'
[2024-05-22 18:49:38] [INFO ] Decomposing Gal with order
[2024-05-22 18:49:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 18:49:38] [INFO ] Removed a total of 1457 redundant transitions.
[2024-05-22 18:49:38] [INFO ] Flatten gal took : 126 ms
[2024-05-22 18:49:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 23 ms.
[2024-05-22 18:49:38] [INFO ] Time to serialize gal into /tmp/LTLFireability9684863345862663116.gal : 21 ms
[2024-05-22 18:49:38] [INFO ] Time to serialize properties into /tmp/LTLFireability11465927213786578063.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9684863345862663116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11465927213786578063.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i18.i2.i1.u350.p1666==0)")||(X("(i16.u327.p1583==0)"))))))
Formula 0 simplified : XF(!"(i18.i2.i1.u350.p1666==0)" & X!"(i16.u327.p1583==0)")
Compilation finished in 7263 ms.
Running link step : cd /tmp/ltsmin15400981556228133931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15400981556228133931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-22 19:11:00] [INFO ] Applying decomposition
[2024-05-22 19:11:01] [INFO ] Flatten gal took : 117 ms
[2024-05-22 19:11:01] [INFO ] Decomposing Gal with order
[2024-05-22 19:11:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:11:01] [INFO ] Removed a total of 1011 redundant transitions.
[2024-05-22 19:11:01] [INFO ] Flatten gal took : 189 ms
[2024-05-22 19:11:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4119 labels/synchronizations in 1014 ms.
[2024-05-22 19:11:02] [INFO ] Time to serialize gal into /tmp/LTLFireability14073721788810652192.gal : 27 ms
[2024-05-22 19:11:02] [INFO ] Time to serialize properties into /tmp/LTLFireability7126865185669376670.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/LTLFireability14073721788810652192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7126865185669376670.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i0.i0.u32.p1666==0)")||(X("(i0.i0.u32.p1583==0)"))))))
Formula 0 simplified : XF(!"(i0.i0.u32.p1666==0)" & X!"(i0.i0.u32.p1583==0)")
Detected timeout of ITS tools.
[2024-05-22 19:32:27] [INFO ] Flatten gal took : 651 ms
[2024-05-22 19:32:33] [INFO ] Input system was already deterministic with 2035 transitions.
[2024-05-22 19:32:33] [INFO ] Transformed 1381 places.
[2024-05-22 19:32:34] [INFO ] Transformed 2035 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 19:32:34] [INFO ] Time to serialize gal into /tmp/LTLFireability599469063933542918.gal : 37 ms
[2024-05-22 19:32:34] [INFO ] Time to serialize properties into /tmp/LTLFireability10597880160147894273.ltl : 5 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/LTLFireability599469063933542918.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10597880160147894273.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("(p1666==0)")||(X("(p1583==0)"))))))
Formula 0 simplified : XF(!"(p1666==0)" & X!"(p1583==0)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8178436 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15875236 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCshifumi-PT-2b"
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 DLCshifumi-PT-2b, 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 r131-smll-171624288500188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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