fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r101-tall-167814475700676
Last Updated
May 14, 2023

About the Execution of ITS-Tools for DLCround-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2405.560 209093.00 285862.00 10225.20 FFFFFFFFFTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475700676.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DLCround-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475700676
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.5K Feb 25 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 813K Mar 5 18:22 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 DLCround-PT-06b-LTLFireability-00
FORMULA_NAME DLCround-PT-06b-LTLFireability-01
FORMULA_NAME DLCround-PT-06b-LTLFireability-02
FORMULA_NAME DLCround-PT-06b-LTLFireability-03
FORMULA_NAME DLCround-PT-06b-LTLFireability-04
FORMULA_NAME DLCround-PT-06b-LTLFireability-05
FORMULA_NAME DLCround-PT-06b-LTLFireability-06
FORMULA_NAME DLCround-PT-06b-LTLFireability-07
FORMULA_NAME DLCround-PT-06b-LTLFireability-08
FORMULA_NAME DLCround-PT-06b-LTLFireability-09
FORMULA_NAME DLCround-PT-06b-LTLFireability-10
FORMULA_NAME DLCround-PT-06b-LTLFireability-11
FORMULA_NAME DLCround-PT-06b-LTLFireability-12
FORMULA_NAME DLCround-PT-06b-LTLFireability-13
FORMULA_NAME DLCround-PT-06b-LTLFireability-14
FORMULA_NAME DLCround-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678305754484

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 20:02:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 20:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:02:36] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-08 20:02:36] [INFO ] Transformed 2340 places.
[2023-03-08 20:02:36] [INFO ] Transformed 3456 transitions.
[2023-03-08 20:02:36] [INFO ] Found NUPN structural information;
[2023-03-08 20:02:36] [INFO ] Parsed PT model containing 2340 places and 3456 transitions and 9288 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-06b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 2340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Discarding 402 places :
Symmetric choice reduction at 0 with 402 rule applications. Total rules 402 place count 1938 transition count 3054
Iterating global reduction 0 with 402 rules applied. Total rules applied 804 place count 1938 transition count 3054
Discarding 312 places :
Symmetric choice reduction at 0 with 312 rule applications. Total rules 1116 place count 1626 transition count 2742
Iterating global reduction 0 with 312 rules applied. Total rules applied 1428 place count 1626 transition count 2742
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 1435 place count 1626 transition count 2735
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 1485 place count 1576 transition count 2637
Iterating global reduction 1 with 50 rules applied. Total rules applied 1535 place count 1576 transition count 2637
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 1568 place count 1543 transition count 2604
Iterating global reduction 1 with 33 rules applied. Total rules applied 1601 place count 1543 transition count 2604
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1604 place count 1543 transition count 2601
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1622 place count 1525 transition count 2583
Iterating global reduction 2 with 18 rules applied. Total rules applied 1640 place count 1525 transition count 2583
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1658 place count 1507 transition count 2565
Iterating global reduction 2 with 18 rules applied. Total rules applied 1676 place count 1507 transition count 2565
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1694 place count 1489 transition count 2547
Iterating global reduction 2 with 18 rules applied. Total rules applied 1712 place count 1489 transition count 2547
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1724 place count 1477 transition count 2535
Iterating global reduction 2 with 12 rules applied. Total rules applied 1736 place count 1477 transition count 2535
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1744 place count 1469 transition count 2527
Iterating global reduction 2 with 8 rules applied. Total rules applied 1752 place count 1469 transition count 2527
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1760 place count 1461 transition count 2519
Iterating global reduction 2 with 8 rules applied. Total rules applied 1768 place count 1461 transition count 2519
Applied a total of 1768 rules in 1080 ms. Remains 1461 /2340 variables (removed 879) and now considering 2519/3456 (removed 937) transitions.
// Phase 1: matrix 2519 rows 1461 cols
[2023-03-08 20:02:38] [INFO ] Computed 109 place invariants in 34 ms
[2023-03-08 20:02:38] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-08 20:02:38] [INFO ] Invariant cache hit.
[2023-03-08 20:02:39] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
[2023-03-08 20:02:39] [INFO ] Invariant cache hit.
[2023-03-08 20:02:41] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1461/2340 places, 2519/3456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3841 ms. Remains : 1461/2340 places, 2519/3456 transitions.
Support contains 52 out of 1461 places after structural reductions.
[2023-03-08 20:02:41] [INFO ] Flatten gal took : 155 ms
[2023-03-08 20:02:41] [INFO ] Flatten gal took : 101 ms
[2023-03-08 20:02:41] [INFO ] Input system was already deterministic with 2519 transitions.
Support contains 48 out of 1461 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 37) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-08 20:02:42] [INFO ] Invariant cache hit.
[2023-03-08 20:02:43] [INFO ] [Real]Absence check using 109 positive place invariants in 64 ms returned sat
[2023-03-08 20:02:43] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 20:02:43] [INFO ] [Nat]Absence check using 109 positive place invariants in 58 ms returned sat
[2023-03-08 20:02:45] [INFO ] After 1297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-08 20:02:46] [INFO ] After 2543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 622 ms.
[2023-03-08 20:02:46] [INFO ] After 3891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 8 properties in 61 ms.
Support contains 4 out of 1461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Graph (trivial) has 1319 edges and 1461 vertex of which 391 / 1461 are part of one of the 32 SCC in 6 ms
Free SCC test removed 359 places
Drop transitions removed 408 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 420 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 1102 transition count 1862
Reduce places removed 237 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 270 rules applied. Total rules applied 508 place count 865 transition count 1829
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 531 place count 843 transition count 1828
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 532 place count 842 transition count 1828
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 532 place count 842 transition count 1723
Deduced a syphon composed of 105 places in 4 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 742 place count 737 transition count 1723
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 803 place count 676 transition count 1386
Iterating global reduction 4 with 61 rules applied. Total rules applied 864 place count 676 transition count 1386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 868 place count 676 transition count 1382
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 868 place count 676 transition count 1373
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 886 place count 667 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 887 place count 666 transition count 1363
Iterating global reduction 5 with 1 rules applied. Total rules applied 888 place count 666 transition count 1363
Performed 248 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 248 places in 1 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 5 with 496 rules applied. Total rules applied 1384 place count 418 transition count 1108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1390 place count 418 transition count 1102
Renaming transitions due to excessive name length > 1024 char.
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1408 place count 400 transition count 934
Iterating global reduction 6 with 18 rules applied. Total rules applied 1426 place count 400 transition count 934
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1444 place count 400 transition count 916
Performed 37 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 7 with 74 rules applied. Total rules applied 1518 place count 363 transition count 1210
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1531 place count 363 transition count 1197
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 1548 place count 346 transition count 876
Iterating global reduction 8 with 17 rules applied. Total rules applied 1565 place count 346 transition count 876
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 1607 place count 346 transition count 834
Drop transitions removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 9 with 91 rules applied. Total rules applied 1698 place count 346 transition count 743
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1705 place count 339 transition count 672
Iterating global reduction 9 with 7 rules applied. Total rules applied 1712 place count 339 transition count 672
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1719 place count 339 transition count 665
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 10 with 8 rules applied. Total rules applied 1727 place count 335 transition count 692
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1732 place count 335 transition count 687
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 1754 place count 335 transition count 665
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 11 with 8 rules applied. Total rules applied 1762 place count 331 transition count 693
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1768 place count 331 transition count 687
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1789 place count 331 transition count 666
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 1797 place count 327 transition count 693
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1803 place count 327 transition count 687
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1824 place count 327 transition count 666
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 13 with 8 rules applied. Total rules applied 1832 place count 323 transition count 694
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1838 place count 323 transition count 688
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1859 place count 323 transition count 667
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 1867 place count 319 transition count 694
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1873 place count 319 transition count 688
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1894 place count 319 transition count 667
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
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 1902 place count 315 transition count 695
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1908 place count 315 transition count 689
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1929 place count 315 transition count 668
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 1937 place count 311 transition count 695
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1943 place count 311 transition count 689
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1964 place count 311 transition count 668
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
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 1972 place count 307 transition count 700
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1978 place count 307 transition count 694
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 1999 place count 307 transition count 673
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2007 place count 303 transition count 704
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2013 place count 303 transition count 698
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2034 place count 303 transition count 677
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
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 2042 place count 299 transition count 705
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2048 place count 299 transition count 699
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2069 place count 299 transition count 678
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 2077 place count 295 transition count 705
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2083 place count 295 transition count 699
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2104 place count 295 transition count 678
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 2112 place count 291 transition count 706
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2118 place count 291 transition count 700
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2139 place count 291 transition count 679
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 2147 place count 287 transition count 706
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2153 place count 287 transition count 700
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2174 place count 287 transition count 679
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
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 2182 place count 283 transition count 698
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 2186 place count 283 transition count 694
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 24 with 19 rules applied. Total rules applied 2205 place count 283 transition count 675
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 2213 place count 279 transition count 694
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 2217 place count 279 transition count 690
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2236 place count 279 transition count 671
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 2244 place count 275 transition count 690
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 2248 place count 275 transition count 686
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 2267 place count 275 transition count 667
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 2275 place count 271 transition count 686
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2279 place count 271 transition count 682
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 27 with 19 rules applied. Total rules applied 2298 place count 271 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 2306 place count 267 transition count 682
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2310 place count 267 transition count 678
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 28 with 19 rules applied. Total rules applied 2329 place count 267 transition count 659
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 2337 place count 263 transition count 678
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2341 place count 263 transition count 674
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 2360 place count 263 transition count 655
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 29 with 8 rules applied. Total rules applied 2368 place count 259 transition count 682
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2372 place count 259 transition count 678
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 2391 place count 259 transition count 659
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 2399 place count 255 transition count 680
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 2403 place count 255 transition count 676
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 2422 place count 255 transition count 657
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 2430 place count 251 transition count 676
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 2434 place count 251 transition count 672
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 2453 place count 251 transition count 653
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 2461 place count 247 transition count 672
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 2465 place count 247 transition count 668
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 2484 place count 247 transition count 649
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 33 with 2 rules applied. Total rules applied 2486 place count 246 transition count 651
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 2487 place count 246 transition count 650
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 34 with 2 rules applied. Total rules applied 2489 place count 246 transition count 648
Free-agglomeration rule applied 29 times with reduction of 1 identical transitions.
Iterating global reduction 34 with 29 rules applied. Total rules applied 2518 place count 246 transition count 618
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 223 transitions
Reduce isomorphic transitions removed 223 transitions.
Graph (complete) has 628 edges and 217 vertex of which 145 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.1 ms
Discarding 72 places :
Also discarding 0 output transitions
Iterating post reduction 34 with 253 rules applied. Total rules applied 2771 place count 145 transition count 395
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 35 with 72 rules applied. Total rules applied 2843 place count 145 transition count 323
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 36 with 38 rules applied. Total rules applied 2881 place count 145 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 36 with 1 rules applied. Total rules applied 2882 place count 144 transition count 284
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 36 with 5 rules applied. Total rules applied 2887 place count 139 transition count 284
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 37 with 60 rules applied. Total rules applied 2947 place count 99 transition count 264
Drop transitions removed 20 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 37 with 65 rules applied. Total rules applied 3012 place count 99 transition count 199
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 38 with 72 rules applied. Total rules applied 3084 place count 51 transition count 175
Drop transitions removed 40 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 70 transitions.
Graph (trivial) has 11 edges and 51 vertex of which 10 / 51 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 38 with 71 rules applied. Total rules applied 3155 place count 46 transition count 105
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 31 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 80 edges and 43 vertex of which 21 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Iterating post reduction 39 with 51 rules applied. Total rules applied 3206 place count 21 transition count 49
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 40 with 13 rules applied. Total rules applied 3219 place count 21 transition count 36
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 41 with 9 rules applied. Total rules applied 3228 place count 15 transition count 33
Drop transitions removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 41 with 9 rules applied. Total rules applied 3237 place count 15 transition count 24
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 42 with 6 rules applied. Total rules applied 3243 place count 15 transition count 18
Graph (complete) has 28 edges and 15 vertex of which 13 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 42 with 1 rules applied. Total rules applied 3244 place count 13 transition count 18
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 43 with 2 rules applied. Total rules applied 3246 place count 13 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 44 with 1 rules applied. Total rules applied 3247 place count 13 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 44 with 1 rules applied. Total rules applied 3248 place count 12 transition count 15
Applied a total of 3248 rules in 855 ms. Remains 12 /1461 variables (removed 1449) and now considering 15/2519 (removed 2504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 855 ms. Remains : 12/1461 places, 15/2519 transitions.
Finished random walk after 44 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=44 )
Computed a total of 217 stabilizing places and 217 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(p1)||(p2 U G(p3))))))'
Support contains 5 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1447 transition count 2486
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1447 transition count 2486
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1439 transition count 2478
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1439 transition count 2478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 1439 transition count 2477
Applied a total of 45 rules in 118 ms. Remains 1439 /1461 variables (removed 22) and now considering 2477/2519 (removed 42) transitions.
// Phase 1: matrix 2477 rows 1439 cols
[2023-03-08 20:02:48] [INFO ] Computed 109 place invariants in 18 ms
[2023-03-08 20:02:48] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-08 20:02:48] [INFO ] Invariant cache hit.
[2023-03-08 20:02:49] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2023-03-08 20:02:49] [INFO ] Invariant cache hit.
[2023-03-08 20:02:50] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1439/1461 places, 2477/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2581 ms. Remains : 1439/1461 places, 2477/2519 transitions.
Stuttering acceptance computed with spot in 2180 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), true, (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p3), acceptance={} source=9 dest: 6}, { cond=p3, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p3 p2), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p3) p2), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(AND (NEQ s588 1) (EQ s738 1) (EQ s1407 1)), p3:(EQ s588 1), p2:(AND (EQ s588 1) (EQ s1090 1)), p1:(EQ s936 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-01 finished in 4833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((!(p0 U !p1)&&G((X(p0)&&G(p2))))))))'
Support contains 4 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1447 transition count 2495
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1447 transition count 2495
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1439 transition count 2487
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1439 transition count 2487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 1439 transition count 2486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1438 transition count 2485
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1438 transition count 2485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1437 transition count 2484
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1437 transition count 2484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1436 transition count 2483
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1436 transition count 2483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1435 transition count 2482
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1435 transition count 2482
Applied a total of 53 rules in 307 ms. Remains 1435 /1461 variables (removed 26) and now considering 2482/2519 (removed 37) transitions.
// Phase 1: matrix 2482 rows 1435 cols
[2023-03-08 20:02:53] [INFO ] Computed 109 place invariants in 27 ms
[2023-03-08 20:02:53] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-08 20:02:53] [INFO ] Invariant cache hit.
[2023-03-08 20:02:54] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
[2023-03-08 20:02:54] [INFO ] Invariant cache hit.
[2023-03-08 20:02:55] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1435/1461 places, 2482/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2771 ms. Remains : 1435/1461 places, 2482/2519 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(EQ s732 1), p1:(AND (EQ s305 1) (EQ s941 1)), p0:(EQ s263 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-02 finished in 3012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1444 transition count 2483
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1444 transition count 2483
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1434 transition count 2473
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1434 transition count 2473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1430 transition count 2468
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1430 transition count 2468
Applied a total of 63 rules in 274 ms. Remains 1430 /1461 variables (removed 31) and now considering 2468/2519 (removed 51) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2023-03-08 20:02:56] [INFO ] Computed 109 place invariants in 17 ms
[2023-03-08 20:02:56] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-08 20:02:56] [INFO ] Invariant cache hit.
[2023-03-08 20:02:57] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
[2023-03-08 20:02:57] [INFO ] Invariant cache hit.
[2023-03-08 20:02:58] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1430/1461 places, 2468/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2685 ms. Remains : 1430/1461 places, 2468/2519 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-03 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:(OR (EQ s301 0) (EQ s1218 0)), p0:(EQ s149 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-03 finished in 2843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G((F(p1)&&F(G(p2)))))))'
Support contains 3 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1445 transition count 2484
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1445 transition count 2484
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 1435 transition count 2474
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1435 transition count 2474
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1435 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1431 transition count 2469
Applied a total of 61 rules in 275 ms. Remains 1431 /1461 variables (removed 30) and now considering 2469/2519 (removed 50) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2023-03-08 20:02:59] [INFO ] Computed 109 place invariants in 15 ms
[2023-03-08 20:02:59] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-08 20:02:59] [INFO ] Invariant cache hit.
[2023-03-08 20:03:00] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
[2023-03-08 20:03:00] [INFO ] Invariant cache hit.
[2023-03-08 20:03:01] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1431/1461 places, 2469/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2733 ms. Remains : 1431/1461 places, 2469/2519 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s652 0), p1:(EQ s938 0), p2:(OR (EQ s652 0) (EQ s1086 0))], 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]]
Product exploration explored 100000 steps with 1 reset in 533 ms.
Product exploration explored 100000 steps with 14 reset in 516 ms.
Computed a total of 214 stabilizing places and 214 stable transitions
Computed a total of 214 stabilizing places and 214 stable transitions
Detected a total of 214/1431 stabilizing places and 214/2469 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p2), (X p1), (X (X p2)), true, (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 412 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 1494 steps, including 0 resets, run visited all 2 properties in 22 ms. (steps per millisecond=67 )
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X p2), (X p1), (X (X p2)), true, (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 359 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 4 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1431/1431 places, 2469/2469 transitions.
Graph (trivial) has 1289 edges and 1431 vertex of which 375 / 1431 are part of one of the 33 SCC in 3 ms
Free SCC test removed 342 places
Ensure Unique test removed 368 transitions
Reduce isomorphic transitions removed 368 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 229 rules applied. Total rules applied 230 place count 1088 transition count 1871
Reduce places removed 229 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 262 rules applied. Total rules applied 492 place count 859 transition count 1838
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 516 place count 837 transition count 1836
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 518 place count 835 transition count 1836
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 111 Pre rules applied. Total rules applied 518 place count 835 transition count 1725
Deduced a syphon composed of 111 places in 4 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 4 with 222 rules applied. Total rules applied 740 place count 724 transition count 1725
Discarding 47 places :
Symmetric choice reduction at 4 with 47 rule applications. Total rules 787 place count 677 transition count 1411
Iterating global reduction 4 with 47 rules applied. Total rules applied 834 place count 677 transition count 1411
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 838 place count 677 transition count 1407
Performed 256 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 256 places in 0 ms
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 5 with 512 rules applied. Total rules applied 1350 place count 421 transition count 1144
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1357 place count 421 transition count 1137
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1374 place count 404 transition count 979
Iterating global reduction 6 with 17 rules applied. Total rules applied 1391 place count 404 transition count 979
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1407 place count 404 transition count 963
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1409 place count 403 transition count 962
Performed 18 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1445 place count 385 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1446 place count 385 transition count 1105
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1450 place count 381 transition count 1043
Iterating global reduction 8 with 4 rules applied. Total rules applied 1454 place count 381 transition count 1043
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 1484 place count 381 transition count 1013
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 1515 place count 381 transition count 982
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1527 place count 369 transition count 958
Iterating global reduction 9 with 12 rules applied. Total rules applied 1539 place count 369 transition count 958
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1551 place count 357 transition count 834
Iterating global reduction 9 with 12 rules applied. Total rules applied 1563 place count 357 transition count 834
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1575 place count 357 transition count 822
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1576 place count 356 transition count 821
Applied a total of 1576 rules in 204 ms. Remains 356 /1431 variables (removed 1075) and now considering 821/2469 (removed 1648) transitions.
[2023-03-08 20:03:04] [INFO ] Flow matrix only has 796 transitions (discarded 25 similar events)
// Phase 1: matrix 796 rows 356 cols
[2023-03-08 20:03:04] [INFO ] Computed 109 place invariants in 11 ms
[2023-03-08 20:03:04] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 20:03:04] [INFO ] Flow matrix only has 796 transitions (discarded 25 similar events)
[2023-03-08 20:03:04] [INFO ] Invariant cache hit.
[2023-03-08 20:03:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 20:03:05] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-08 20:03:05] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-08 20:03:05] [INFO ] Flow matrix only has 796 transitions (discarded 25 similar events)
[2023-03-08 20:03:05] [INFO ] Invariant cache hit.
[2023-03-08 20:03:05] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 356/1431 places, 821/2469 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1018 ms. Remains : 356/1431 places, 821/2469 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Detected a total of 3/356 stabilizing places and 19/821 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 336 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 4 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 479 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 327 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 4 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 606 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering criterion allowed to conclude after 141 steps with 0 reset in 7 ms.
FORMULA DLCround-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-04 finished in 8398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((G(p1) U (p0&&G(p1))))) U p2))'
Support contains 5 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1445 transition count 2485
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1445 transition count 2485
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 1436 transition count 2476
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 1436 transition count 2476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1435 transition count 2475
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1435 transition count 2475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1434 transition count 2474
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1434 transition count 2474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1433 transition count 2473
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1433 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1432 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1432 transition count 2472
Applied a total of 58 rules in 272 ms. Remains 1432 /1461 variables (removed 29) and now considering 2472/2519 (removed 47) transitions.
// Phase 1: matrix 2472 rows 1432 cols
[2023-03-08 20:03:07] [INFO ] Computed 109 place invariants in 12 ms
[2023-03-08 20:03:08] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-08 20:03:08] [INFO ] Invariant cache hit.
[2023-03-08 20:03:09] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
[2023-03-08 20:03:09] [INFO ] Invariant cache hit.
[2023-03-08 20:03:10] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1432/1461 places, 2472/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2708 ms. Remains : 1432/1461 places, 2472/2519 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s548 1) (EQ s1328 1)), p0:(EQ s106 1), p1:(AND (EQ s50 1) (EQ s676 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-05 finished in 2871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 3 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1444 transition count 2483
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1444 transition count 2483
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1434 transition count 2473
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1434 transition count 2473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1430 transition count 2468
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1430 transition count 2468
Applied a total of 63 rules in 284 ms. Remains 1430 /1461 variables (removed 31) and now considering 2468/2519 (removed 51) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2023-03-08 20:03:10] [INFO ] Computed 109 place invariants in 11 ms
[2023-03-08 20:03:11] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-08 20:03:11] [INFO ] Invariant cache hit.
[2023-03-08 20:03:12] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2023-03-08 20:03:12] [INFO ] Invariant cache hit.
[2023-03-08 20:03:12] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1430/1461 places, 2468/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2672 ms. Remains : 1430/1461 places, 2468/2519 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s1111 1), p0:(AND (EQ s702 1) (EQ s1164 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-06 finished in 2849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p1)&&p0))||X(p2)))'
Support contains 5 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1444 transition count 2483
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1444 transition count 2483
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1434 transition count 2473
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1434 transition count 2473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1430 transition count 2468
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1430 transition count 2468
Applied a total of 63 rules in 277 ms. Remains 1430 /1461 variables (removed 31) and now considering 2468/2519 (removed 51) transitions.
[2023-03-08 20:03:13] [INFO ] Invariant cache hit.
[2023-03-08 20:03:13] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-08 20:03:13] [INFO ] Invariant cache hit.
[2023-03-08 20:03:14] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2023-03-08 20:03:14] [INFO ] Invariant cache hit.
[2023-03-08 20:03:15] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1430/1461 places, 2468/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2716 ms. Remains : 1430/1461 places, 2468/2519 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s202 1) (EQ s1206 1)), p2:(AND (EQ s418 1) (EQ s202 1) (EQ s1206 1)), p1:(AND (EQ s126 1) (EQ s1163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-07 finished in 2983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(p1)||G(p2)))))'
Support contains 3 out of 1461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Graph (trivial) has 1323 edges and 1461 vertex of which 395 / 1461 are part of one of the 32 SCC in 3 ms
Free SCC test removed 363 places
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 1097 transition count 1888
Reduce places removed 237 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 272 rules applied. Total rules applied 510 place count 860 transition count 1853
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 533 place count 837 transition count 1853
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 533 place count 837 transition count 1748
Deduced a syphon composed of 105 places in 4 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 743 place count 732 transition count 1748
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 804 place count 671 transition count 1402
Iterating global reduction 3 with 61 rules applied. Total rules applied 865 place count 671 transition count 1402
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 869 place count 671 transition count 1398
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 869 place count 671 transition count 1390
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 885 place count 663 transition count 1390
Performed 246 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 246 places in 0 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 4 with 492 rules applied. Total rules applied 1377 place count 417 transition count 1137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1383 place count 417 transition count 1131
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1401 place count 399 transition count 963
Iterating global reduction 5 with 18 rules applied. Total rules applied 1419 place count 399 transition count 963
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1437 place count 399 transition count 945
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1471 place count 382 transition count 1075
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1475 place count 378 transition count 1013
Iterating global reduction 6 with 4 rules applied. Total rules applied 1479 place count 378 transition count 1013
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1508 place count 378 transition count 984
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 7 with 31 rules applied. Total rules applied 1539 place count 378 transition count 953
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1551 place count 366 transition count 929
Iterating global reduction 7 with 12 rules applied. Total rules applied 1563 place count 366 transition count 929
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1575 place count 354 transition count 805
Iterating global reduction 7 with 12 rules applied. Total rules applied 1587 place count 354 transition count 805
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1599 place count 354 transition count 793
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1601 place count 354 transition count 793
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1602 place count 354 transition count 792
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1603 place count 353 transition count 790
Iterating global reduction 8 with 1 rules applied. Total rules applied 1604 place count 353 transition count 790
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1605 place count 352 transition count 780
Iterating global reduction 8 with 1 rules applied. Total rules applied 1606 place count 352 transition count 780
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1607 place count 352 transition count 779
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1608 place count 351 transition count 778
Applied a total of 1608 rules in 317 ms. Remains 351 /1461 variables (removed 1110) and now considering 778/2519 (removed 1741) transitions.
[2023-03-08 20:03:16] [INFO ] Flow matrix only has 755 transitions (discarded 23 similar events)
// Phase 1: matrix 755 rows 351 cols
[2023-03-08 20:03:16] [INFO ] Computed 109 place invariants in 3 ms
[2023-03-08 20:03:16] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 20:03:16] [INFO ] Flow matrix only has 755 transitions (discarded 23 similar events)
[2023-03-08 20:03:16] [INFO ] Invariant cache hit.
[2023-03-08 20:03:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-08 20:03:16] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-08 20:03:16] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 20:03:16] [INFO ] Flow matrix only has 755 transitions (discarded 23 similar events)
[2023-03-08 20:03:16] [INFO ] Invariant cache hit.
[2023-03-08 20:03:17] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/1461 places, 778/2519 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1081 ms. Remains : 351/1461 places, 778/2519 transitions.
Stuttering acceptance computed with spot in 919 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s268 1)), p1:(OR (EQ s34 0) (EQ s268 0)), p2:(AND (EQ s341 1) (EQ s34 1) (EQ s268 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 DLCround-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-08 finished in 2024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F((G(F(!p1))||(!p0&&F(!p1)))))))'
Support contains 3 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1445 transition count 2484
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1445 transition count 2484
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 1436 transition count 2475
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 1436 transition count 2475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 1436 transition count 2474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1435 transition count 2473
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1435 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2470
Applied a total of 59 rules in 277 ms. Remains 1432 /1461 variables (removed 29) and now considering 2470/2519 (removed 49) transitions.
// Phase 1: matrix 2470 rows 1432 cols
[2023-03-08 20:03:18] [INFO ] Computed 109 place invariants in 13 ms
[2023-03-08 20:03:18] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-08 20:03:18] [INFO ] Invariant cache hit.
[2023-03-08 20:03:19] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
[2023-03-08 20:03:19] [INFO ] Invariant cache hit.
[2023-03-08 20:03:20] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1432/1461 places, 2470/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2638 ms. Remains : 1432/1461 places, 2470/2519 transitions.
Stuttering acceptance computed with spot in 215 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s706 1) (EQ s1154 1)), p0:(EQ s948 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 931 ms.
Product exploration explored 100000 steps with 50000 reset in 937 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-09 finished in 5084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Graph (trivial) has 1325 edges and 1461 vertex of which 395 / 1461 are part of one of the 32 SCC in 2 ms
Free SCC test removed 363 places
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1097 transition count 1887
Reduce places removed 238 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 273 rules applied. Total rules applied 512 place count 859 transition count 1852
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 535 place count 836 transition count 1852
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 535 place count 836 transition count 1748
Deduced a syphon composed of 104 places in 4 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 743 place count 732 transition count 1748
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 805 place count 670 transition count 1392
Iterating global reduction 3 with 62 rules applied. Total rules applied 867 place count 670 transition count 1392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 871 place count 670 transition count 1388
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 871 place count 670 transition count 1380
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 887 place count 662 transition count 1380
Performed 247 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 247 places in 0 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 4 with 494 rules applied. Total rules applied 1381 place count 415 transition count 1126
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1388 place count 415 transition count 1119
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1406 place count 397 transition count 951
Iterating global reduction 5 with 18 rules applied. Total rules applied 1424 place count 397 transition count 951
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1442 place count 397 transition count 933
Performed 16 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1474 place count 381 transition count 1058
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1478 place count 377 transition count 996
Iterating global reduction 6 with 4 rules applied. Total rules applied 1482 place count 377 transition count 996
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1511 place count 377 transition count 967
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 1541 place count 377 transition count 937
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1555 place count 363 transition count 909
Iterating global reduction 7 with 14 rules applied. Total rules applied 1569 place count 363 transition count 909
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1583 place count 349 transition count 767
Iterating global reduction 7 with 14 rules applied. Total rules applied 1597 place count 349 transition count 767
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1611 place count 349 transition count 753
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1612 place count 348 transition count 752
Applied a total of 1612 rules in 155 ms. Remains 348 /1461 variables (removed 1113) and now considering 752/2519 (removed 1767) transitions.
[2023-03-08 20:03:23] [INFO ] Flow matrix only has 730 transitions (discarded 22 similar events)
// Phase 1: matrix 730 rows 348 cols
[2023-03-08 20:03:23] [INFO ] Computed 109 place invariants in 5 ms
[2023-03-08 20:03:23] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 20:03:23] [INFO ] Flow matrix only has 730 transitions (discarded 22 similar events)
[2023-03-08 20:03:23] [INFO ] Invariant cache hit.
[2023-03-08 20:03:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-08 20:03:23] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-08 20:03:23] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 20:03:23] [INFO ] Flow matrix only has 730 transitions (discarded 22 similar events)
[2023-03-08 20:03:23] [INFO ] Invariant cache hit.
[2023-03-08 20:03:24] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 348/1461 places, 752/2519 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 933 ms. Remains : 348/1461 places, 752/2519 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-10 finished in 983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1445 transition count 2493
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1445 transition count 2493
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 1435 transition count 2483
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1435 transition count 2483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1435 transition count 2482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1434 transition count 2481
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1434 transition count 2481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2480
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2479
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2479
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1431 transition count 2478
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1431 transition count 2478
Applied a total of 61 rules in 254 ms. Remains 1431 /1461 variables (removed 30) and now considering 2478/2519 (removed 41) transitions.
// Phase 1: matrix 2478 rows 1431 cols
[2023-03-08 20:03:24] [INFO ] Computed 109 place invariants in 14 ms
[2023-03-08 20:03:24] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-08 20:03:24] [INFO ] Invariant cache hit.
[2023-03-08 20:03:25] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
[2023-03-08 20:03:25] [INFO ] Invariant cache hit.
[2023-03-08 20:03:26] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1431/1461 places, 2478/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2680 ms. Remains : 1431/1461 places, 2478/2519 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-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:(OR (EQ s459 0) (EQ s1291 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 9919 steps with 0 reset in 49 ms.
FORMULA DLCround-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-11 finished in 2827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Graph (trivial) has 1325 edges and 1461 vertex of which 395 / 1461 are part of one of the 32 SCC in 0 ms
Free SCC test removed 363 places
Ensure Unique test removed 393 transitions
Reduce isomorphic transitions removed 393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1097 transition count 1887
Reduce places removed 238 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 273 rules applied. Total rules applied 512 place count 859 transition count 1852
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 535 place count 836 transition count 1852
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 535 place count 836 transition count 1748
Deduced a syphon composed of 104 places in 4 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 743 place count 732 transition count 1748
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 805 place count 670 transition count 1392
Iterating global reduction 3 with 62 rules applied. Total rules applied 867 place count 670 transition count 1392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 871 place count 670 transition count 1388
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 871 place count 670 transition count 1380
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 887 place count 662 transition count 1380
Performed 247 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 247 places in 0 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 4 with 494 rules applied. Total rules applied 1381 place count 415 transition count 1126
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1388 place count 415 transition count 1119
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1406 place count 397 transition count 951
Iterating global reduction 5 with 18 rules applied. Total rules applied 1424 place count 397 transition count 951
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1442 place count 397 transition count 933
Performed 16 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1474 place count 381 transition count 1057
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1478 place count 377 transition count 997
Iterating global reduction 6 with 4 rules applied. Total rules applied 1482 place count 377 transition count 997
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 1512 place count 377 transition count 967
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 7 with 31 rules applied. Total rules applied 1543 place count 377 transition count 936
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1557 place count 363 transition count 908
Iterating global reduction 7 with 14 rules applied. Total rules applied 1571 place count 363 transition count 908
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1585 place count 349 transition count 766
Iterating global reduction 7 with 14 rules applied. Total rules applied 1599 place count 349 transition count 766
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1613 place count 349 transition count 752
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1614 place count 348 transition count 751
Applied a total of 1614 rules in 139 ms. Remains 348 /1461 variables (removed 1113) and now considering 751/2519 (removed 1768) transitions.
[2023-03-08 20:03:27] [INFO ] Flow matrix only has 731 transitions (discarded 20 similar events)
// Phase 1: matrix 731 rows 348 cols
[2023-03-08 20:03:27] [INFO ] Computed 109 place invariants in 13 ms
[2023-03-08 20:03:28] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-08 20:03:28] [INFO ] Flow matrix only has 731 transitions (discarded 20 similar events)
[2023-03-08 20:03:28] [INFO ] Invariant cache hit.
[2023-03-08 20:03:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 20:03:28] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
[2023-03-08 20:03:28] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 20:03:28] [INFO ] Flow matrix only has 731 transitions (discarded 20 similar events)
[2023-03-08 20:03:28] [INFO ] Invariant cache hit.
[2023-03-08 20:03:28] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 348/1461 places, 751/2519 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1826 ms. Remains : 348/1461 places, 751/2519 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s63 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 DLCround-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-12 finished in 1919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((!p1||X(p2))))))'
Support contains 5 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1447 transition count 2486
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1447 transition count 2486
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 1438 transition count 2477
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 1438 transition count 2477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1438 transition count 2476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1437 transition count 2475
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1437 transition count 2475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1436 transition count 2474
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1436 transition count 2474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1435 transition count 2473
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1435 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1434 transition count 2472
Applied a total of 55 rules in 263 ms. Remains 1434 /1461 variables (removed 27) and now considering 2472/2519 (removed 47) transitions.
// Phase 1: matrix 2472 rows 1434 cols
[2023-03-08 20:03:29] [INFO ] Computed 109 place invariants in 14 ms
[2023-03-08 20:03:29] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-08 20:03:29] [INFO ] Invariant cache hit.
[2023-03-08 20:03:30] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2023-03-08 20:03:30] [INFO ] Invariant cache hit.
[2023-03-08 20:03:31] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1434/1461 places, 2472/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2737 ms. Remains : 1434/1461 places, 2472/2519 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), true, (AND p1 (NOT p2))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(AND (NEQ s398 1) (EQ s731 1) (EQ s1395 1)), p0:(EQ s1006 1), p2:(NEQ s1059 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 65500 steps with 37 reset in 257 ms.
FORMULA DLCround-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-13 finished in 3209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(X(F(p1))))))))'
Support contains 1 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1445 transition count 2484
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1445 transition count 2484
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 1435 transition count 2474
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1435 transition count 2474
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1435 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1431 transition count 2469
Applied a total of 61 rules in 288 ms. Remains 1431 /1461 variables (removed 30) and now considering 2469/2519 (removed 50) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2023-03-08 20:03:32] [INFO ] Computed 109 place invariants in 14 ms
[2023-03-08 20:03:32] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-08 20:03:32] [INFO ] Invariant cache hit.
[2023-03-08 20:03:33] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
[2023-03-08 20:03:33] [INFO ] Invariant cache hit.
[2023-03-08 20:03:34] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1431/1461 places, 2469/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2799 ms. Remains : 1431/1461 places, 2469/2519 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s70 1), p0:(EQ s70 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 27 reset in 378 ms.
Product exploration explored 100000 steps with 41 reset in 410 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1619 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=202 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-08 20:03:36] [INFO ] Invariant cache hit.
[2023-03-08 20:03:37] [INFO ] [Real]Absence check using 109 positive place invariants in 82 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-14 finished in 5640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&X((!p1&&F(p2))))) U p3))'
Support contains 5 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1444 transition count 2483
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1444 transition count 2483
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1434 transition count 2473
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1434 transition count 2473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1430 transition count 2468
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1430 transition count 2468
Applied a total of 63 rules in 274 ms. Remains 1430 /1461 variables (removed 31) and now considering 2468/2519 (removed 51) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2023-03-08 20:03:38] [INFO ] Computed 109 place invariants in 15 ms
[2023-03-08 20:03:38] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-08 20:03:38] [INFO ] Invariant cache hit.
[2023-03-08 20:03:39] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2023-03-08 20:03:39] [INFO ] Invariant cache hit.
[2023-03-08 20:03:40] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1430/1461 places, 2468/2519 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2786 ms. Remains : 1430/1461 places, 2468/2519 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p3), (OR (NOT p2) p1 p0), (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s498 1) (EQ s1020 1)), p0:(OR (AND (EQ s104 1) (EQ s911 1)) (EQ s726 1)), p1:(AND (EQ s104 1) (EQ s911 1)), p2:(NEQ s726 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33263 reset in 676 ms.
Product exploration explored 100000 steps with 33450 reset in 687 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 707 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p3), (OR (NOT p2) p1 p0), (OR (NOT p2) p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:03:43] [INFO ] Invariant cache hit.
[2023-03-08 20:03:43] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F p0), (F (AND (NOT p1) (NOT p2))), (F p3), (F (NOT (AND (NOT p3) (NOT p0)))), (F (AND (NOT p3) p0)), (F (NOT p2))]
Knowledge based reduction with 17 factoid took 3623 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p3), (OR (NOT p2) p1 p0), (OR (NOT p2) p1), (NOT p2)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p3), (OR (NOT p2) p1 p0), (OR (NOT p2) p1), (NOT p2)]
[2023-03-08 20:03:47] [INFO ] Invariant cache hit.
[2023-03-08 20:03:48] [INFO ] [Real]Absence check using 109 positive place invariants in 106 ms returned sat
[2023-03-08 20:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:03:51] [INFO ] [Real]Absence check using state equation in 2635 ms returned sat
[2023-03-08 20:03:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:03:52] [INFO ] [Nat]Absence check using 109 positive place invariants in 118 ms returned sat
[2023-03-08 20:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:03:54] [INFO ] [Nat]Absence check using state equation in 2787 ms returned sat
[2023-03-08 20:03:55] [INFO ] Computed and/alt/rep : 2306/3936/2306 causal constraints (skipped 161 transitions) in 239 ms.
[2023-03-08 20:04:06] [INFO ] Deduced a trap composed of 11 places in 703 ms of which 1 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-08 20:04:06] [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 (NOT p3)
Could not prove EG (NOT p3)
Support contains 5 out of 1430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1430/1430 places, 2468/2468 transitions.
Applied a total of 0 rules in 33 ms. Remains 1430 /1430 variables (removed 0) and now considering 2468/2468 (removed 0) transitions.
[2023-03-08 20:04:07] [INFO ] Invariant cache hit.
[2023-03-08 20:04:07] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-08 20:04:07] [INFO ] Invariant cache hit.
[2023-03-08 20:04:08] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
[2023-03-08 20:04:08] [INFO ] Invariant cache hit.
[2023-03-08 20:04:09] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2462 ms. Remains : 1430/1430 places, 2468/2468 transitions.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND (NOT p3) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 547 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p3), (OR (NOT p2) p1 p0), (OR (NOT p2) p1), (NOT p2)]
Finished random walk after 5017 steps, including 1 resets, run visited all 7 properties in 48 ms. (steps per millisecond=104 )
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND (NOT p3) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F p3), (F (NOT (AND (NOT p3) (NOT p0)))), (F (AND (NOT p3) p0))]
Knowledge based reduction with 14 factoid took 1740 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p3), (OR (NOT p2) p1 p0), (OR (NOT p2) p1), (NOT p2)]
Stuttering acceptance computed with spot in 346 ms :[(NOT p3), (OR (NOT p2) p1 p0), (OR (NOT p2) p1), (NOT p2)]
[2023-03-08 20:04:12] [INFO ] Invariant cache hit.
[2023-03-08 20:04:13] [INFO ] [Real]Absence check using 109 positive place invariants in 100 ms returned sat
[2023-03-08 20:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:04:15] [INFO ] [Real]Absence check using state equation in 2475 ms returned sat
[2023-03-08 20:04:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:04:16] [INFO ] [Nat]Absence check using 109 positive place invariants in 110 ms returned sat
[2023-03-08 20:04:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:04:19] [INFO ] [Nat]Absence check using state equation in 2708 ms returned sat
[2023-03-08 20:04:19] [INFO ] Computed and/alt/rep : 2306/3936/2306 causal constraints (skipped 161 transitions) in 115 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
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:261)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-08 20:04:31] [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 (NOT p3)
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 172 ms :[(NOT p3), (OR (NOT p2) p1 p0), (OR (NOT p2) p1), (NOT p2)]
Product exploration explored 100000 steps with 33501 reset in 663 ms.
Product exploration explored 100000 steps with 33197 reset in 711 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 155 ms :[(NOT p3), (OR (NOT p2) p1 p0), (OR (NOT p2) p1), (NOT p2)]
Support contains 5 out of 1430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1430/1430 places, 2468/2468 transitions.
Graph (trivial) has 1285 edges and 1430 vertex of which 374 / 1430 are part of one of the 31 SCC in 1 ms
Free SCC test removed 343 places
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 370 transitions.
Performed 231 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 231 rules applied. Total rules applied 232 place count 1087 transition count 2098
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 22 rules applied. Total rules applied 254 place count 1087 transition count 2087
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 254 place count 1087 transition count 2091
Deduced a syphon composed of 250 places in 5 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 262 place count 1087 transition count 2091
Discarding 120 places :
Symmetric choice reduction at 2 with 120 rule applications. Total rules 382 place count 967 transition count 1701
Deduced a syphon composed of 178 places in 4 ms
Iterating global reduction 2 with 120 rules applied. Total rules applied 502 place count 967 transition count 1701
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 505 place count 967 transition count 1698
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 534 places in 0 ms
Iterating global reduction 3 with 356 rules applied. Total rules applied 861 place count 967 transition count 1706
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 869 place count 967 transition count 1698
Renaming transitions due to excessive name length > 1024 char.
Discarding 267 places :
Symmetric choice reduction at 4 with 267 rule applications. Total rules 1136 place count 700 transition count 1290
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 4 with 267 rules applied. Total rules applied 1403 place count 700 transition count 1290
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1420 place count 700 transition count 1273
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1426 place count 694 transition count 1267
Deduced a syphon composed of 278 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1432 place count 694 transition count 1267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 279 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1433 place count 694 transition count 1267
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1435 place count 692 transition count 1265
Deduced a syphon composed of 277 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1437 place count 692 transition count 1265
Performed 30 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 307 places in 0 ms
Iterating global reduction 5 with 30 rules applied. Total rules applied 1467 place count 692 transition count 1498
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1483 place count 692 transition count 1482
Discarding 43 places :
Symmetric choice reduction at 6 with 43 rule applications. Total rules 1526 place count 649 transition count 1325
Deduced a syphon composed of 269 places in 0 ms
Iterating global reduction 6 with 43 rules applied. Total rules applied 1569 place count 649 transition count 1325
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1601 place count 649 transition count 1293
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1610 place count 640 transition count 1275
Deduced a syphon composed of 260 places in 0 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1619 place count 640 transition count 1275
Deduced a syphon composed of 260 places in 0 ms
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 7 with 32 rules applied. Total rules applied 1651 place count 640 transition count 1243
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1663 place count 628 transition count 1219
Deduced a syphon composed of 260 places in 16 ms
Iterating global reduction 7 with 12 rules applied. Total rules applied 1675 place count 628 transition count 1219
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1687 place count 616 transition count 1097
Deduced a syphon composed of 260 places in 1 ms
Iterating global reduction 7 with 12 rules applied. Total rules applied 1699 place count 616 transition count 1097
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1717 place count 616 transition count 1079
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1729 place count 604 transition count 1061
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 1741 place count 604 transition count 1061
Deduced a syphon composed of 248 places in 1 ms
Applied a total of 1741 rules in 1052 ms. Remains 604 /1430 variables (removed 826) and now considering 1061/2468 (removed 1407) transitions.
[2023-03-08 20:04:33] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-08 20:04:33] [INFO ] Flow matrix only has 1039 transitions (discarded 22 similar events)
// Phase 1: matrix 1039 rows 604 cols
[2023-03-08 20:04:33] [INFO ] Computed 109 place invariants in 12 ms
[2023-03-08 20:04:34] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 604/1430 places, 1061/2468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1889 ms. Remains : 604/1430 places, 1061/2468 transitions.
Built C files in :
/tmp/ltsmin5695254659113420103
[2023-03-08 20:04:34] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5695254659113420103
Running compilation step : cd /tmp/ltsmin5695254659113420103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin5695254659113420103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5695254659113420103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 5 out of 1430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1430/1430 places, 2468/2468 transitions.
Applied a total of 0 rules in 27 ms. Remains 1430 /1430 variables (removed 0) and now considering 2468/2468 (removed 0) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2023-03-08 20:04:37] [INFO ] Computed 109 place invariants in 4 ms
[2023-03-08 20:04:38] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-08 20:04:38] [INFO ] Invariant cache hit.
[2023-03-08 20:04:39] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
[2023-03-08 20:04:39] [INFO ] Invariant cache hit.
[2023-03-08 20:04:40] [INFO ] Dead Transitions using invariants and state equation in 1094 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2535 ms. Remains : 1430/1430 places, 2468/2468 transitions.
Built C files in :
/tmp/ltsmin1009137209388843269
[2023-03-08 20:04:40] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1009137209388843269
Running compilation step : cd /tmp/ltsmin1009137209388843269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin1009137209388843269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1009137209388843269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2023-03-08 20:04:43] [INFO ] Flatten gal took : 114 ms
[2023-03-08 20:04:43] [INFO ] Flatten gal took : 95 ms
[2023-03-08 20:04:43] [INFO ] Time to serialize gal into /tmp/LTL14541411454756424376.gal : 31 ms
[2023-03-08 20:04:43] [INFO ] Time to serialize properties into /tmp/LTL13291385650155442091.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14541411454756424376.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8260580421704748817.hoa' '-atoms' '/tmp/LTL13291385650155442091.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13291385650155442091.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8260580421704748817.hoa
Detected timeout of ITS tools.
[2023-03-08 20:04:59] [INFO ] Flatten gal took : 59 ms
[2023-03-08 20:04:59] [INFO ] Flatten gal took : 58 ms
[2023-03-08 20:04:59] [INFO ] Time to serialize gal into /tmp/LTL8056339650347665302.gal : 14 ms
[2023-03-08 20:04:59] [INFO ] Time to serialize properties into /tmp/LTL3250626450581673021.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8056339650347665302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3250626450581673021.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F((!("(((p207==1)&&(p1473==1))||(p1229==1))"))&&(X((!("((p207==1)&&(p1473==1))"))&&(F("(p1229!=1)"))))))U("((p880==1)&&(p1656==1))...159
Formula 0 simplified : G("(((p207==1)&&(p1473==1))||(p1229==1))" | X("((p207==1)&&(p1473==1))" | G!"(p1229!=1)")) R !"((p880==1)&&(p1656==1))"
Detected timeout of ITS tools.
[2023-03-08 20:05:14] [INFO ] Flatten gal took : 53 ms
[2023-03-08 20:05:14] [INFO ] Applying decomposition
[2023-03-08 20:05:14] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15785005146975791261.txt' '-o' '/tmp/graph15785005146975791261.bin' '-w' '/tmp/graph15785005146975791261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15785005146975791261.bin' '-l' '-1' '-v' '-w' '/tmp/graph15785005146975791261.weights' '-q' '0' '-e' '0.001'
[2023-03-08 20:05:14] [INFO ] Decomposing Gal with order
[2023-03-08 20:05:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 20:05:15] [INFO ] Removed a total of 2185 redundant transitions.
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 1361 ms
[2023-03-08 20:05:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 70 ms.
[2023-03-08 20:05:16] [INFO ] Time to serialize gal into /tmp/LTL14957391780826138771.gal : 54 ms
[2023-03-08 20:05:16] [INFO ] Time to serialize properties into /tmp/LTL5942870789149928263.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14957391780826138771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5942870789149928263.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F((!("(((i1.i0.i0.u43.p207==1)&&(i6.u375.p1473==1))||(i17.u305.p1229==1))"))&&(X((!("((i1.i0.i0.u43.p207==1)&&(i6.u375.p1473==1))"...237
Formula 0 simplified : G("(((i1.i0.i0.u43.p207==1)&&(i6.u375.p1473==1))||(i17.u305.p1229==1))" | X("((i1.i0.i0.u43.p207==1)&&(i6.u375.p1473==1))" | G!"(i17...220
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13608659966711540380
[2023-03-08 20:05:31] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13608659966711540380
Running compilation step : cd /tmp/ltsmin13608659966711540380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin13608659966711540380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13608659966711540380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 DLCround-PT-06b-LTLFireability-15 finished in 116939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&X((!p1&&F(p2))))) U p3))'
Found a Shortening insensitive property : DLCround-PT-06b-LTLFireability-15
Stuttering acceptance computed with spot in 162 ms :[(NOT p3), (OR (NOT p2) p1 p0), (OR (NOT p2) p1), (NOT p2)]
Support contains 5 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1461/1461 places, 2519/2519 transitions.
Graph (trivial) has 1316 edges and 1461 vertex of which 380 / 1461 are part of one of the 31 SCC in 0 ms
Free SCC test removed 349 places
Ensure Unique test removed 377 transitions
Reduce isomorphic transitions removed 377 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1111 transition count 1899
Reduce places removed 242 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 276 rules applied. Total rules applied 519 place count 869 transition count 1865
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 543 place count 847 transition count 1863
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 545 place count 845 transition count 1863
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 106 Pre rules applied. Total rules applied 545 place count 845 transition count 1757
Deduced a syphon composed of 106 places in 14 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 757 place count 739 transition count 1757
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 818 place count 678 transition count 1408
Iterating global reduction 4 with 61 rules applied. Total rules applied 879 place count 678 transition count 1408
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 882 place count 678 transition count 1405
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 882 place count 678 transition count 1396
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 900 place count 669 transition count 1396
Performed 249 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 249 places in 0 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 5 with 498 rules applied. Total rules applied 1398 place count 420 transition count 1140
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1405 place count 420 transition count 1133
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1422 place count 403 transition count 975
Iterating global reduction 6 with 17 rules applied. Total rules applied 1439 place count 403 transition count 975
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1456 place count 403 transition count 958
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1458 place count 402 transition count 957
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1492 place count 385 transition count 1090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1493 place count 385 transition count 1089
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1498 place count 380 transition count 1011
Iterating global reduction 8 with 5 rules applied. Total rules applied 1503 place count 380 transition count 1011
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 1532 place count 380 transition count 982
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1536 place count 380 transition count 978
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1537 place count 379 transition count 977
Applied a total of 1537 rules in 141 ms. Remains 379 /1461 variables (removed 1082) and now considering 977/2519 (removed 1542) transitions.
[2023-03-08 20:05:35] [INFO ] Flow matrix only has 942 transitions (discarded 35 similar events)
// Phase 1: matrix 942 rows 379 cols
[2023-03-08 20:05:35] [INFO ] Computed 109 place invariants in 2 ms
[2023-03-08 20:05:35] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-08 20:05:35] [INFO ] Flow matrix only has 942 transitions (discarded 35 similar events)
[2023-03-08 20:05:35] [INFO ] Invariant cache hit.
[2023-03-08 20:05:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 20:05:36] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
[2023-03-08 20:05:36] [INFO ] Flow matrix only has 942 transitions (discarded 35 similar events)
[2023-03-08 20:05:36] [INFO ] Invariant cache hit.
[2023-03-08 20:05:36] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 379/1461 places, 977/2519 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1436 ms. Remains : 379/1461 places, 977/2519 transitions.
Running random walk in product with property : DLCround-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s56 1) (EQ s174 1)), p0:(OR (AND (EQ s10 1) (EQ s119 1)) (EQ s85 1)), p1:(AND (EQ s10 1) (EQ s119 1)), p2:(NEQ s85 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property DLCround-PT-06b-LTLFireability-15 finished in 1689 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-08 20:05:36] [INFO ] Flatten gal took : 118 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4918042058599984275
[2023-03-08 20:05:36] [INFO ] Too many transitions (2519) to apply POR reductions. Disabling POR matrices.
[2023-03-08 20:05:36] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4918042058599984275
Running compilation step : cd /tmp/ltsmin4918042058599984275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-08 20:05:36] [INFO ] Applying decomposition
[2023-03-08 20:05:36] [INFO ] Flatten gal took : 117 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10758454250785180082.txt' '-o' '/tmp/graph10758454250785180082.bin' '-w' '/tmp/graph10758454250785180082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10758454250785180082.bin' '-l' '-1' '-v' '-w' '/tmp/graph10758454250785180082.weights' '-q' '0' '-e' '0.001'
[2023-03-08 20:05:37] [INFO ] Decomposing Gal with order
[2023-03-08 20:05:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 20:05:37] [INFO ] Removed a total of 2190 redundant transitions.
[2023-03-08 20:05:37] [INFO ] Flatten gal took : 229 ms
[2023-03-08 20:05:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 34 ms.
[2023-03-08 20:05:38] [INFO ] Time to serialize gal into /tmp/LTLFireability8790700665735337074.gal : 219 ms
[2023-03-08 20:05:38] [INFO ] Time to serialize properties into /tmp/LTLFireability11462820342169067457.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8790700665735337074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11462820342169067457.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F((!("(((i2.u47.p207==1)&&(i9.u384.p1473==1))||(i19.u314.p1229==1))"))&&(X((!("((i2.u47.p207==1)&&(i9.u384.p1473==1))"))&&(F("(i19...225
Formula 0 simplified : G("(((i2.u47.p207==1)&&(i9.u384.p1473==1))||(i19.u314.p1229==1))" | X("((i2.u47.p207==1)&&(i9.u384.p1473==1))" | G!"(i19.u314.p1229!...208
Compilation finished in 6391 ms.
Running link step : cd /tmp/ltsmin4918042058599984275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin4918042058599984275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((!(LTLAPp0==true)&&X((!(LTLAPp1==true)&&<>((LTLAPp2==true)))))) U (LTLAPp3==true))' '--buchi-type=spotba'
LTSmin run took 9863 ms.
FORMULA DLCround-PT-06b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 196469 ms.

BK_STOP 1678305963577

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DLCround-PT-06b, 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 r101-tall-167814475700676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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