Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 07:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 547K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-04b-LTLFireability-00
FORMULA_NAME DLCround-PT-04b-LTLFireability-01
FORMULA_NAME DLCround-PT-04b-LTLFireability-02
FORMULA_NAME DLCround-PT-04b-LTLFireability-03
FORMULA_NAME DLCround-PT-04b-LTLFireability-04
FORMULA_NAME DLCround-PT-04b-LTLFireability-05
FORMULA_NAME DLCround-PT-04b-LTLFireability-06
FORMULA_NAME DLCround-PT-04b-LTLFireability-07
FORMULA_NAME DLCround-PT-04b-LTLFireability-08
FORMULA_NAME DLCround-PT-04b-LTLFireability-09
FORMULA_NAME DLCround-PT-04b-LTLFireability-10
FORMULA_NAME DLCround-PT-04b-LTLFireability-11
FORMULA_NAME DLCround-PT-04b-LTLFireability-12
FORMULA_NAME DLCround-PT-04b-LTLFireability-13
FORMULA_NAME DLCround-PT-04b-LTLFireability-14
FORMULA_NAME DLCround-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652567199889

Running Version 202205111006
[2022-05-14 22:26:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 22:26:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 22:26:41] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2022-05-14 22:26:41] [INFO ] Transformed 1680 places.
[2022-05-14 22:26:41] [INFO ] Transformed 2364 transitions.
[2022-05-14 22:26:41] [INFO ] Found NUPN structural information;
[2022-05-14 22:26:41] [INFO ] Parsed PT model containing 1680 places and 2364 transitions in 278 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 4 formulas.
FORMULA DLCround-PT-04b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 1680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1680/1680 places, 2364/2364 transitions.
Discarding 283 places :
Symmetric choice reduction at 0 with 283 rule applications. Total rules 283 place count 1397 transition count 2081
Iterating global reduction 0 with 283 rules applied. Total rules applied 566 place count 1397 transition count 2081
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 778 place count 1185 transition count 1869
Iterating global reduction 0 with 212 rules applied. Total rules applied 990 place count 1185 transition count 1869
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 995 place count 1185 transition count 1864
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 1040 place count 1140 transition count 1780
Iterating global reduction 1 with 45 rules applied. Total rules applied 1085 place count 1140 transition count 1780
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 1113 place count 1112 transition count 1752
Iterating global reduction 1 with 28 rules applied. Total rules applied 1141 place count 1112 transition count 1752
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1145 place count 1112 transition count 1748
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1159 place count 1098 transition count 1734
Iterating global reduction 2 with 14 rules applied. Total rules applied 1173 place count 1098 transition count 1734
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1187 place count 1084 transition count 1720
Iterating global reduction 2 with 14 rules applied. Total rules applied 1201 place count 1084 transition count 1720
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1215 place count 1070 transition count 1706
Iterating global reduction 2 with 14 rules applied. Total rules applied 1229 place count 1070 transition count 1706
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1238 place count 1061 transition count 1697
Iterating global reduction 2 with 9 rules applied. Total rules applied 1247 place count 1061 transition count 1697
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1252 place count 1056 transition count 1692
Iterating global reduction 2 with 5 rules applied. Total rules applied 1257 place count 1056 transition count 1692
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1262 place count 1051 transition count 1687
Iterating global reduction 2 with 5 rules applied. Total rules applied 1267 place count 1051 transition count 1687
Applied a total of 1267 rules in 866 ms. Remains 1051 /1680 variables (removed 629) and now considering 1687/2364 (removed 677) transitions.
// Phase 1: matrix 1687 rows 1051 cols
[2022-05-14 22:26:42] [INFO ] Computed 69 place invariants in 31 ms
[2022-05-14 22:26:42] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 1687 rows 1051 cols
[2022-05-14 22:26:42] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:26:43] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
// Phase 1: matrix 1687 rows 1051 cols
[2022-05-14 22:26:43] [INFO ] Computed 69 place invariants in 6 ms
[2022-05-14 22:26:44] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1051/1680 places, 1687/2364 transitions.
Finished structural reductions, in 1 iterations. Remains : 1051/1680 places, 1687/2364 transitions.
Support contains 41 out of 1051 places after structural reductions.
[2022-05-14 22:26:44] [INFO ] Flatten gal took : 126 ms
[2022-05-14 22:26:44] [INFO ] Flatten gal took : 76 ms
[2022-05-14 22:26:44] [INFO ] Input system was already deterministic with 1687 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 36) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1687 rows 1051 cols
[2022-05-14 22:26:45] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:26:45] [INFO ] [Real]Absence check using 69 positive place invariants in 37 ms returned sat
[2022-05-14 22:26:46] [INFO ] After 973ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-14 22:26:46] [INFO ] [Nat]Absence check using 69 positive place invariants in 29 ms returned sat
[2022-05-14 22:26:47] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-14 22:26:47] [INFO ] After 973ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 209 ms.
[2022-05-14 22:26:47] [INFO ] After 1467ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 3 properties in 17 ms.
Support contains 1 out of 1051 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Graph (trivial) has 976 edges and 1051 vertex of which 294 / 1051 are part of one of the 23 SCC in 5 ms
Free SCC test removed 271 places
Drop transitions removed 308 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 317 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 192 place count 780 transition count 1179
Reduce places removed 191 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 218 rules applied. Total rules applied 410 place count 589 transition count 1152
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 428 place count 571 transition count 1152
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 428 place count 571 transition count 1084
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 564 place count 503 transition count 1084
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 609 place count 458 transition count 915
Iterating global reduction 3 with 45 rules applied. Total rules applied 654 place count 458 transition count 915
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 657 place count 458 transition count 912
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 657 place count 458 transition count 903
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 675 place count 449 transition count 903
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 676 place count 448 transition count 895
Iterating global reduction 4 with 1 rules applied. Total rules applied 677 place count 448 transition count 895
Performed 166 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 4 with 332 rules applied. Total rules applied 1009 place count 282 transition count 724
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1014 place count 282 transition count 719
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1032 place count 264 transition count 590
Iterating global reduction 5 with 18 rules applied. Total rules applied 1050 place count 264 transition count 590
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1065 place count 264 transition count 575
Performed 31 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 1127 place count 233 transition count 762
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1140 place count 233 transition count 749
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1153 place count 220 transition count 560
Iterating global reduction 7 with 13 rules applied. Total rules applied 1166 place count 220 transition count 560
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 1196 place count 220 transition count 530
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 8 with 61 rules applied. Total rules applied 1257 place count 220 transition count 469
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1262 place count 215 transition count 428
Iterating global reduction 8 with 5 rules applied. Total rules applied 1267 place count 215 transition count 428
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1272 place count 215 transition count 423
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 9 with 8 rules applied. Total rules applied 1280 place count 211 transition count 450
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1285 place count 211 transition count 445
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 1307 place count 211 transition count 423
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1315 place count 207 transition count 454
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1321 place count 207 transition count 448
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 1342 place count 207 transition count 427
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
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 1350 place count 203 transition count 458
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1356 place count 203 transition count 452
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1377 place count 203 transition count 431
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 1385 place count 199 transition count 458
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1391 place count 199 transition count 452
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1412 place count 199 transition count 431
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1420 place count 195 transition count 458
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1426 place count 195 transition count 452
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1447 place count 195 transition count 431
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1455 place count 191 transition count 458
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1461 place count 191 transition count 452
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1482 place count 191 transition count 431
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1490 place count 187 transition count 458
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1496 place count 187 transition count 452
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1517 place count 187 transition count 431
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 1525 place count 183 transition count 458
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1531 place count 183 transition count 452
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1552 place count 183 transition count 431
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 1560 place count 179 transition count 458
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1566 place count 179 transition count 452
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 1587 place count 179 transition count 431
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 18 with 8 rules applied. Total rules applied 1595 place count 175 transition count 450
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 1599 place count 175 transition count 446
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 19 with 19 rules applied. Total rules applied 1618 place count 175 transition count 427
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 1626 place count 171 transition count 454
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 1630 place count 171 transition count 450
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 20 with 19 rules applied. Total rules applied 1649 place count 171 transition count 431
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 20 with 8 rules applied. Total rules applied 1657 place count 167 transition count 450
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 1661 place count 167 transition count 446
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 21 with 19 rules applied. Total rules applied 1680 place count 167 transition count 427
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 21 with 8 rules applied. Total rules applied 1688 place count 163 transition count 446
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 1692 place count 163 transition count 442
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 22 with 19 rules applied. Total rules applied 1711 place count 163 transition count 423
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 22 with 8 rules applied. Total rules applied 1719 place count 159 transition count 442
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 1723 place count 159 transition count 438
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 23 with 19 rules applied. Total rules applied 1742 place count 159 transition count 419
Free-agglomeration rule applied 23 times.
Iterating global reduction 23 with 23 rules applied. Total rules applied 1765 place count 159 transition count 396
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 148 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (complete) has 389 edges and 136 vertex of which 104 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 0 output transitions
Iterating post reduction 23 with 180 rules applied. Total rules applied 1945 place count 104 transition count 240
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 24 with 32 rules applied. Total rules applied 1977 place count 104 transition count 208
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 25 with 20 rules applied. Total rules applied 1997 place count 104 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 25 with 1 rules applied. Total rules applied 1998 place count 103 transition count 187
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 2002 place count 99 transition count 187
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 26 with 48 rules applied. Total rules applied 2050 place count 67 transition count 171
Drop transitions removed 16 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 26 with 44 rules applied. Total rules applied 2094 place count 67 transition count 127
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 27 with 60 rules applied. Total rules applied 2154 place count 27 transition count 107
Drop transitions removed 36 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 55 transitions.
Graph (trivial) has 9 edges and 27 vertex of which 8 / 27 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 56 rules applied. Total rules applied 2210 place count 23 transition count 52
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 32 edges and 19 vertex of which 11 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 28 with 29 rules applied. Total rules applied 2239 place count 11 transition count 24
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2243 place count 11 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 30 with 12 rules applied. Total rules applied 2255 place count 3 transition count 16
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 30 with 12 rules applied. Total rules applied 2267 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 2269 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 2270 place count 2 transition count 2
Applied a total of 2270 rules in 498 ms. Remains 2 /1051 variables (removed 1049) and now considering 2/1687 (removed 1685) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1051 places, 2/1687 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 153 stabilizing places and 153 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U (p1 U p2))&&(X(p3)||G(p2))))'
Support contains 5 out of 1051 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1035 transition count 1671
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1035 transition count 1671
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 1025 transition count 1661
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1025 transition count 1661
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1021 transition count 1657
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1021 transition count 1657
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1017 transition count 1653
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1017 transition count 1653
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 1014 transition count 1650
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 1014 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 1012 transition count 1648
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 1012 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 1010 transition count 1646
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1009 transition count 1645
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1009 transition count 1645
Applied a total of 84 rules in 371 ms. Remains 1009 /1051 variables (removed 42) and now considering 1645/1687 (removed 42) transitions.
// Phase 1: matrix 1645 rows 1009 cols
[2022-05-14 22:26:49] [INFO ] Computed 69 place invariants in 8 ms
[2022-05-14 22:26:49] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 1645 rows 1009 cols
[2022-05-14 22:26:49] [INFO ] Computed 69 place invariants in 5 ms
[2022-05-14 22:26:50] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
// Phase 1: matrix 1645 rows 1009 cols
[2022-05-14 22:26:50] [INFO ] Computed 69 place invariants in 5 ms
[2022-05-14 22:26:50] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1009/1051 places, 1645/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1009/1051 places, 1645/1687 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p3) p2), true, p2, p2, (NOT p3)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}]], initial=0, aps=[p2:(EQ s723 1), p0:(EQ s461 1), p1:(AND (EQ s31 1) (EQ s656 1)), p3:(EQ s776 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 4 ms.
FORMULA DLCround-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-01 finished in 2377 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(p0) U p1)||(true U p2)))))'
Support contains 4 out of 1051 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1033 transition count 1669
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1033 transition count 1669
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1023 transition count 1659
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1023 transition count 1659
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1019 transition count 1655
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1019 transition count 1655
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 1015 transition count 1651
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 1015 transition count 1651
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 1012 transition count 1648
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 1012 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 1010 transition count 1646
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1010 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 1008 transition count 1644
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1008 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1007 transition count 1643
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1007 transition count 1643
Applied a total of 88 rules in 191 ms. Remains 1007 /1051 variables (removed 44) and now considering 1643/1687 (removed 44) transitions.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:26:51] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:26:51] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:26:51] [INFO ] Computed 69 place invariants in 6 ms
[2022-05-14 22:26:52] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:26:52] [INFO ] Computed 69 place invariants in 8 ms
[2022-05-14 22:26:52] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1007/1051 places, 1643/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1007/1051 places, 1643/1687 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s676 1), p2:(EQ s372 1), p0:(AND (EQ s212 1) (EQ s650 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]]
Product exploration explored 100000 steps with 17 reset in 476 ms.
Product exploration explored 100000 steps with 24 reset in 434 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:26:54] [INFO ] Computed 69 place invariants in 13 ms
[2022-05-14 22:26:54] [INFO ] [Real]Absence check using 69 positive place invariants in 26 ms returned sat
[2022-05-14 22:26:54] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 22:26:54] [INFO ] [Nat]Absence check using 69 positive place invariants in 27 ms returned sat
[2022-05-14 22:26:55] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-14 22:26:55] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-14 22:26:55] [INFO ] After 777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 299 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=149 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 (NOT p2)))]
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:26:56] [INFO ] Computed 69 place invariants in 10 ms
[2022-05-14 22:26:56] [INFO ] [Real]Absence check using 69 positive place invariants in 51 ms returned sat
[2022-05-14 22:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:26:58] [INFO ] [Real]Absence check using state equation in 1342 ms returned sat
[2022-05-14 22:26:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:26:58] [INFO ] [Nat]Absence check using 69 positive place invariants in 50 ms returned sat
[2022-05-14 22:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:26:59] [INFO ] [Nat]Absence check using state equation in 1322 ms returned sat
[2022-05-14 22:27:00] [INFO ] Computed and/alt/rep : 1597/3102/1597 causal constraints (skipped 45 transitions) in 83 ms.
[2022-05-14 22:27:13] [INFO ] Added : 745 causal constraints over 149 iterations in 13099 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 1007 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1007/1007 places, 1643/1643 transitions.
Applied a total of 0 rules in 30 ms. Remains 1007 /1007 variables (removed 0) and now considering 1643/1643 (removed 0) transitions.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:27:13] [INFO ] Computed 69 place invariants in 10 ms
[2022-05-14 22:27:13] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:27:13] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:27:14] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:27:14] [INFO ] Computed 69 place invariants in 12 ms
[2022-05-14 22:27:14] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1007/1007 places, 1643/1643 transitions.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 279 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Finished random walk after 9754 steps, including 2 resets, run visited all 4 properties in 71 ms. (steps per millisecond=137 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:27:16] [INFO ] Computed 69 place invariants in 11 ms
[2022-05-14 22:27:16] [INFO ] [Real]Absence check using 69 positive place invariants in 47 ms returned sat
[2022-05-14 22:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:27:17] [INFO ] [Real]Absence check using state equation in 1352 ms returned sat
[2022-05-14 22:27:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:27:18] [INFO ] [Nat]Absence check using 69 positive place invariants in 48 ms returned sat
[2022-05-14 22:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:27:19] [INFO ] [Nat]Absence check using state equation in 1225 ms returned sat
[2022-05-14 22:27:19] [INFO ] Computed and/alt/rep : 1597/3102/1597 causal constraints (skipped 45 transitions) in 84 ms.
[2022-05-14 22:27:32] [INFO ] Added : 740 causal constraints over 148 iterations in 13257 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 18 reset in 291 ms.
Product exploration explored 100000 steps with 16 reset in 335 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 4 out of 1007 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1007/1007 places, 1643/1643 transitions.
Graph (trivial) has 928 edges and 1007 vertex of which 289 / 1007 are part of one of the 23 SCC in 6 ms
Free SCC test removed 266 places
Ensure Unique test removed 289 transitions
Reduce isomorphic transitions removed 289 transitions.
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 741 transition count 1354
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 18 rules applied. Total rules applied 186 place count 741 transition count 1345
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 186 place count 741 transition count 1350
Deduced a syphon composed of 186 places in 2 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 196 place count 741 transition count 1350
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 294 place count 643 transition count 1103
Deduced a syphon composed of 125 places in 2 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 392 place count 643 transition count 1103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 396 place count 643 transition count 1099
Performed 227 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 352 places in 1 ms
Iterating global reduction 3 with 227 rules applied. Total rules applied 623 place count 643 transition count 1104
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 628 place count 643 transition count 1099
Renaming transitions due to excessive name length > 1024 char.
Discarding 174 places :
Symmetric choice reduction at 4 with 174 rule applications. Total rules 802 place count 469 transition count 846
Deduced a syphon composed of 191 places in 0 ms
Iterating global reduction 4 with 174 rules applied. Total rules applied 976 place count 469 transition count 846
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 989 place count 469 transition count 833
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 994 place count 464 transition count 828
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 999 place count 464 transition count 828
Performed 27 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 5 with 27 rules applied. Total rules applied 1026 place count 464 transition count 1030
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1039 place count 464 transition count 1017
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 1076 place count 427 transition count 900
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 6 with 37 rules applied. Total rules applied 1113 place count 427 transition count 900
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 1137 place count 427 transition count 876
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1145 place count 419 transition count 860
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1153 place count 419 transition count 860
Deduced a syphon composed of 172 places in 0 ms
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 7 with 27 rules applied. Total rules applied 1180 place count 419 transition count 833
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1189 place count 410 transition count 815
Deduced a syphon composed of 172 places in 1 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1198 place count 410 transition count 815
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1207 place count 401 transition count 737
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1216 place count 401 transition count 737
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1229 place count 401 transition count 724
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1238 place count 392 transition count 711
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 8 with 9 rules applied. Total rules applied 1247 place count 392 transition count 711
Deduced a syphon composed of 163 places in 0 ms
Applied a total of 1247 rules in 322 ms. Remains 392 /1007 variables (removed 615) and now considering 711/1643 (removed 932) transitions.
[2022-05-14 22:27:34] [INFO ] Redundant transitions in 49 ms returned []
[2022-05-14 22:27:34] [INFO ] Flow matrix only has 695 transitions (discarded 16 similar events)
// Phase 1: matrix 695 rows 392 cols
[2022-05-14 22:27:34] [INFO ] Computed 69 place invariants in 8 ms
[2022-05-14 22:27:34] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/1007 places, 711/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/1007 places, 711/1643 transitions.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-02 finished in 43669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(F(p0))) U G(X((G(p1)&&F(p2)))))))'
Support contains 4 out of 1051 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1033 transition count 1669
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1033 transition count 1669
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1024 transition count 1660
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1024 transition count 1660
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1021 transition count 1657
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1021 transition count 1657
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1018 transition count 1654
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1018 transition count 1654
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 1015 transition count 1651
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 1015 transition count 1651
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1013 transition count 1649
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1013 transition count 1649
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1011 transition count 1647
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1010 transition count 1646
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1010 transition count 1646
Applied a total of 82 rules in 176 ms. Remains 1010 /1051 variables (removed 41) and now considering 1646/1687 (removed 41) transitions.
// Phase 1: matrix 1646 rows 1010 cols
[2022-05-14 22:27:34] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:27:35] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 1646 rows 1010 cols
[2022-05-14 22:27:35] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:27:35] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
// Phase 1: matrix 1646 rows 1010 cols
[2022-05-14 22:27:35] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:27:36] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1010/1051 places, 1646/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1051 places, 1646/1687 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s137 1), p0:(EQ s60 1), p2:(AND (EQ s381 1) (EQ s756 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]]
Product exploration explored 100000 steps with 39 reset in 343 ms.
Product exploration explored 100000 steps with 39 reset in 365 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1646 rows 1010 cols
[2022-05-14 22:27:37] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:27:38] [INFO ] [Real]Absence check using 69 positive place invariants in 27 ms returned sat
[2022-05-14 22:27:38] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-14 22:27:38] [INFO ] [Nat]Absence check using 69 positive place invariants in 26 ms returned sat
[2022-05-14 22:27:39] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-14 22:27:39] [INFO ] After 651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-05-14 22:27:39] [INFO ] After 941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 164 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p0), (F p1), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
// Phase 1: matrix 1646 rows 1010 cols
[2022-05-14 22:27:40] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:27:40] [INFO ] [Real]Absence check using 69 positive place invariants in 41 ms returned sat
[2022-05-14 22:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:27:41] [INFO ] [Real]Absence check using state equation in 1026 ms returned sat
[2022-05-14 22:27:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:27:42] [INFO ] [Nat]Absence check using 69 positive place invariants in 46 ms returned sat
[2022-05-14 22:27:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:27:43] [INFO ] [Nat]Absence check using state equation in 1253 ms returned sat
[2022-05-14 22:27:43] [INFO ] Computed and/alt/rep : 1600/3105/1600 causal constraints (skipped 45 transitions) in 75 ms.
[2022-05-14 22:27:56] [INFO ] Added : 755 causal constraints over 151 iterations in 13197 ms. Result :unknown
Could not prove EG (NOT p1)
// Phase 1: matrix 1646 rows 1010 cols
[2022-05-14 22:27:56] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:27:57] [INFO ] [Real]Absence check using 69 positive place invariants in 41 ms returned sat
[2022-05-14 22:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:27:58] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2022-05-14 22:27:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:27:59] [INFO ] [Nat]Absence check using 69 positive place invariants in 45 ms returned sat
[2022-05-14 22:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:28:00] [INFO ] [Nat]Absence check using state equation in 1227 ms returned sat
[2022-05-14 22:28:00] [INFO ] Computed and/alt/rep : 1600/3105/1600 causal constraints (skipped 45 transitions) in 85 ms.
[2022-05-14 22:28:13] [INFO ] Deduced a trap composed of 8 places in 374 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-14 22:28:13] [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 p0)
Could not prove EG (NOT p0)
// Phase 1: matrix 1646 rows 1010 cols
[2022-05-14 22:28:13] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:28:14] [INFO ] [Real]Absence check using 69 positive place invariants in 8 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p0), (F p1), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA DLCround-PT-04b-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLFireability-03 finished in 39818 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(p0))) U G(!F(p1))))'
Support contains 2 out of 1051 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Graph (trivial) has 976 edges and 1051 vertex of which 300 / 1051 are part of one of the 24 SCC in 3 ms
Free SCC test removed 276 places
Ensure Unique test removed 299 transitions
Reduce isomorphic transitions removed 299 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 189 place count 774 transition count 1199
Reduce places removed 188 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 215 rules applied. Total rules applied 404 place count 586 transition count 1172
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 422 place count 568 transition count 1172
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 422 place count 568 transition count 1104
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 558 place count 500 transition count 1104
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 601 place count 457 transition count 937
Iterating global reduction 3 with 43 rules applied. Total rules applied 644 place count 457 transition count 937
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 647 place count 457 transition count 934
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 647 place count 457 transition count 926
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 663 place count 449 transition count 926
Performed 164 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 4 with 328 rules applied. Total rules applied 991 place count 285 transition count 757
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 996 place count 285 transition count 752
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1013 place count 268 transition count 628
Iterating global reduction 5 with 17 rules applied. Total rules applied 1030 place count 268 transition count 628
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1044 place count 268 transition count 614
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 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 1076 place count 252 transition count 707
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1080 place count 248 transition count 661
Iterating global reduction 6 with 4 rules applied. Total rules applied 1084 place count 248 transition count 661
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1105 place count 248 transition count 640
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 7 with 23 rules applied. Total rules applied 1128 place count 248 transition count 617
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1137 place count 239 transition count 599
Iterating global reduction 7 with 9 rules applied. Total rules applied 1146 place count 239 transition count 599
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1155 place count 230 transition count 525
Iterating global reduction 7 with 9 rules applied. Total rules applied 1164 place count 230 transition count 525
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1173 place count 230 transition count 516
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1174 place count 229 transition count 515
Applied a total of 1174 rules in 118 ms. Remains 229 /1051 variables (removed 822) and now considering 515/1687 (removed 1172) transitions.
[2022-05-14 22:28:14] [INFO ] Flow matrix only has 496 transitions (discarded 19 similar events)
// Phase 1: matrix 496 rows 229 cols
[2022-05-14 22:28:14] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:28:14] [INFO ] Implicit Places using invariants in 101 ms returned []
[2022-05-14 22:28:14] [INFO ] Flow matrix only has 496 transitions (discarded 19 similar events)
// Phase 1: matrix 496 rows 229 cols
[2022-05-14 22:28:14] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-14 22:28:14] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-14 22:28:15] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2022-05-14 22:28:15] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-14 22:28:15] [INFO ] Flow matrix only has 496 transitions (discarded 19 similar events)
// Phase 1: matrix 496 rows 229 cols
[2022-05-14 22:28:15] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:28:15] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 229/1051 places, 515/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/1051 places, 515/1687 transitions.
Stuttering acceptance computed with spot in 71 ms :[p1, (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s33 1), p0:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 234 steps with 0 reset in 4 ms.
FORMULA DLCround-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-04 finished in 718 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(F((X(F(!p0))||p1)))))'
Support contains 2 out of 1051 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1033 transition count 1669
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1033 transition count 1669
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1024 transition count 1660
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1024 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1020 transition count 1656
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1020 transition count 1656
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1016 transition count 1652
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1016 transition count 1652
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 1013 transition count 1649
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 1013 transition count 1649
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1011 transition count 1647
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1011 transition count 1647
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 1009 transition count 1645
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 1009 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1008 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1008 transition count 1644
Applied a total of 86 rules in 191 ms. Remains 1008 /1051 variables (removed 43) and now considering 1644/1687 (removed 43) transitions.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:28:15] [INFO ] Computed 69 place invariants in 10 ms
[2022-05-14 22:28:15] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:28:15] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:28:16] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:28:16] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:28:17] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1008/1051 places, 1644/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1008/1051 places, 1644/1687 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s322 1), p0:(NEQ s952 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][false, false, false]]
Product exploration explored 100000 steps with 824 reset in 269 ms.
Product exploration explored 100000 steps with 799 reset in 273 ms.
Computed a total of 135 stabilizing places and 135 stable transitions
Computed a total of 135 stabilizing places and 135 stable transitions
Detected a total of 135/1008 stabilizing places and 135/1644 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 121 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:28:18] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:28:18] [INFO ] [Real]Absence check using 69 positive place invariants in 49 ms returned sat
[2022-05-14 22:28:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:28:20] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2022-05-14 22:28:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:28:20] [INFO ] [Nat]Absence check using 69 positive place invariants in 46 ms returned sat
[2022-05-14 22:28:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:28:21] [INFO ] [Nat]Absence check using state equation in 1315 ms returned sat
[2022-05-14 22:28:22] [INFO ] Computed and/alt/rep : 1598/3105/1598 causal constraints (skipped 45 transitions) in 96 ms.
[2022-05-14 22:28:35] [INFO ] Added : 740 causal constraints over 148 iterations in 13164 ms. Result :unknown
Could not prove EG (AND (NOT p1) p0)
Support contains 2 out of 1008 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1008/1008 places, 1644/1644 transitions.
Applied a total of 0 rules in 21 ms. Remains 1008 /1008 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:28:35] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:28:35] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:28:35] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:28:36] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:28:36] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:28:36] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1008/1008 places, 1644/1644 transitions.
Computed a total of 135 stabilizing places and 135 stable transitions
Computed a total of 135 stabilizing places and 135 stable transitions
Detected a total of 135/1008 stabilizing places and 135/1644 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 139 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:28:37] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:28:37] [INFO ] [Real]Absence check using 69 positive place invariants in 40 ms returned sat
[2022-05-14 22:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:28:38] [INFO ] [Real]Absence check using state equation in 1124 ms returned sat
[2022-05-14 22:28:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:28:39] [INFO ] [Nat]Absence check using 69 positive place invariants in 47 ms returned sat
[2022-05-14 22:28:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:28:40] [INFO ] [Nat]Absence check using state equation in 1293 ms returned sat
[2022-05-14 22:28:40] [INFO ] Computed and/alt/rep : 1598/3105/1598 causal constraints (skipped 45 transitions) in 78 ms.
[2022-05-14 22:28:54] [INFO ] Deduced a trap composed of 12 places in 336 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-14 22:28:54] [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 (AND (NOT p1) p0)
Could not prove EG (AND (NOT p1) p0)
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 804 reset in 264 ms.
Stack based approach found an accepted trace after 2434 steps with 20 reset with depth 25 and stack size 25 in 7 ms.
FORMULA DLCround-PT-04b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DLCround-PT-04b-LTLFireability-05 finished in 39353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0)&&G(!X(p1))) U X(p2)))'
Support contains 4 out of 1051 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1033 transition count 1669
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1033 transition count 1669
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1023 transition count 1659
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1023 transition count 1659
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1019 transition count 1655
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1019 transition count 1655
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 1015 transition count 1651
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 1015 transition count 1651
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 1012 transition count 1648
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 1012 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 1010 transition count 1646
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1010 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 1008 transition count 1644
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1008 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1007 transition count 1643
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1007 transition count 1643
Applied a total of 88 rules in 192 ms. Remains 1007 /1051 variables (removed 44) and now considering 1643/1687 (removed 44) transitions.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:28:54] [INFO ] Computed 69 place invariants in 10 ms
[2022-05-14 22:28:55] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:28:55] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:28:55] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:28:55] [INFO ] Computed 69 place invariants in 5 ms
[2022-05-14 22:28:56] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1007/1051 places, 1643/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1007/1051 places, 1643/1687 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s376 1), p2:(OR (EQ s856 1) (AND (EQ s33 1) (EQ s698 1))), p1:(EQ s856 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 311 reset in 291 ms.
Product exploration explored 100000 steps with 310 reset in 339 ms.
Computed a total of 134 stabilizing places and 134 stable transitions
Computed a total of 134 stabilizing places and 134 stable transitions
Detected a total of 134/1007 stabilizing places and 134/1643 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 714 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:28:58] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:28:58] [INFO ] After 100ms 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 p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F p2), (F (AND (NOT p2) (NOT p1) p0))]
Knowledge based reduction with 18 factoid took 847 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) p0)]
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:28:59] [INFO ] Computed 69 place invariants in 5 ms
[2022-05-14 22:29:00] [INFO ] [Real]Absence check using 69 positive place invariants in 54 ms returned sat
[2022-05-14 22:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:29:01] [INFO ] [Real]Absence check using state equation in 1175 ms returned sat
[2022-05-14 22:29:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:29:01] [INFO ] [Nat]Absence check using 69 positive place invariants in 45 ms returned sat
[2022-05-14 22:29:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:29:03] [INFO ] [Nat]Absence check using state equation in 1236 ms returned sat
[2022-05-14 22:29:03] [INFO ] Computed and/alt/rep : 1597/3102/1597 causal constraints (skipped 45 transitions) in 73 ms.
[2022-05-14 22:29:16] [INFO ] Added : 745 causal constraints over 149 iterations in 13218 ms. Result :unknown
Could not prove EG (NOT p2)
Support contains 4 out of 1007 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1007/1007 places, 1643/1643 transitions.
Applied a total of 0 rules in 19 ms. Remains 1007 /1007 variables (removed 0) and now considering 1643/1643 (removed 0) transitions.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:29:16] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:29:16] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:29:16] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:29:17] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:29:17] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:29:17] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1007/1007 places, 1643/1643 transitions.
Computed a total of 134 stabilizing places and 134 stable transitions
Computed a total of 134 stabilizing places and 134 stable transitions
Detected a total of 134/1007 stabilizing places and 134/1643 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 577 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) p0)]
Finished random walk after 624 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 13 factoid took 537 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) p0)]
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:29:19] [INFO ] Computed 69 place invariants in 5 ms
[2022-05-14 22:29:19] [INFO ] [Real]Absence check using 69 positive place invariants in 43 ms returned sat
[2022-05-14 22:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:29:21] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2022-05-14 22:29:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:29:21] [INFO ] [Nat]Absence check using 69 positive place invariants in 48 ms returned sat
[2022-05-14 22:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:29:22] [INFO ] [Nat]Absence check using state equation in 1246 ms returned sat
[2022-05-14 22:29:23] [INFO ] Computed and/alt/rep : 1597/3102/1597 causal constraints (skipped 45 transitions) in 87 ms.
[2022-05-14 22:29:36] [INFO ] Deduced a trap composed of 14 places in 346 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-14 22:29:36] [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 p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 307 reset in 277 ms.
Product exploration explored 100000 steps with 309 reset in 290 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) p0)]
Support contains 4 out of 1007 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1007/1007 places, 1643/1643 transitions.
Graph (trivial) has 928 edges and 1007 vertex of which 289 / 1007 are part of one of the 23 SCC in 3 ms
Free SCC test removed 266 places
Ensure Unique test removed 289 transitions
Reduce isomorphic transitions removed 289 transitions.
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 166 rules applied. Total rules applied 167 place count 741 transition count 1354
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 18 rules applied. Total rules applied 185 place count 741 transition count 1345
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 185 place count 741 transition count 1350
Deduced a syphon composed of 185 places in 2 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 195 place count 741 transition count 1350
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 291 place count 645 transition count 1109
Deduced a syphon composed of 125 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 387 place count 645 transition count 1109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 390 place count 645 transition count 1106
Performed 227 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 352 places in 0 ms
Iterating global reduction 3 with 227 rules applied. Total rules applied 617 place count 645 transition count 1111
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 622 place count 645 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Discarding 176 places :
Symmetric choice reduction at 4 with 176 rule applications. Total rules 798 place count 469 transition count 837
Deduced a syphon composed of 191 places in 0 ms
Iterating global reduction 4 with 176 rules applied. Total rules applied 974 place count 469 transition count 837
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 988 place count 469 transition count 823
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 993 place count 464 transition count 818
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 998 place count 464 transition count 818
Performed 27 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 5 with 27 rules applied. Total rules applied 1025 place count 464 transition count 1008
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1038 place count 464 transition count 995
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 1075 place count 427 transition count 878
Deduced a syphon composed of 180 places in 0 ms
Iterating global reduction 6 with 37 rules applied. Total rules applied 1112 place count 427 transition count 878
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 1136 place count 427 transition count 854
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1144 place count 419 transition count 838
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1152 place count 419 transition count 838
Deduced a syphon composed of 172 places in 1 ms
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 1182 place count 419 transition count 808
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1191 place count 410 transition count 790
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1200 place count 410 transition count 790
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1209 place count 401 transition count 712
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 1218 place count 401 transition count 712
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1231 place count 401 transition count 699
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1240 place count 392 transition count 686
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 8 with 9 rules applied. Total rules applied 1249 place count 392 transition count 686
Deduced a syphon composed of 163 places in 0 ms
Applied a total of 1249 rules in 204 ms. Remains 392 /1007 variables (removed 615) and now considering 686/1643 (removed 957) transitions.
[2022-05-14 22:29:37] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-14 22:29:37] [INFO ] Flow matrix only has 669 transitions (discarded 17 similar events)
// Phase 1: matrix 669 rows 392 cols
[2022-05-14 22:29:37] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:29:38] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/1007 places, 686/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/1007 places, 686/1643 transitions.
Stuttering criterion allowed to conclude after 1196 steps with 18 reset in 9 ms.
FORMULA DLCround-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-06 finished in 43417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((p0 U (X(G(X(p1)))||p2))||G(p3))))))'
Support contains 5 out of 1051 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Graph (trivial) has 971 edges and 1051 vertex of which 288 / 1051 are part of one of the 22 SCC in 1 ms
Free SCC test removed 266 places
Ensure Unique test removed 289 transitions
Reduce isomorphic transitions removed 289 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 191 place count 784 transition count 1207
Reduce places removed 190 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 217 rules applied. Total rules applied 408 place count 594 transition count 1180
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 426 place count 576 transition count 1180
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 426 place count 576 transition count 1109
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 568 place count 505 transition count 1109
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 611 place count 462 transition count 942
Iterating global reduction 3 with 43 rules applied. Total rules applied 654 place count 462 transition count 942
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 657 place count 462 transition count 939
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 657 place count 462 transition count 931
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 673 place count 454 transition count 931
Performed 166 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 4 with 332 rules applied. Total rules applied 1005 place count 288 transition count 760
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1010 place count 288 transition count 755
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1028 place count 270 transition count 626
Iterating global reduction 5 with 18 rules applied. Total rules applied 1046 place count 270 transition count 626
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1061 place count 270 transition count 611
Performed 18 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1097 place count 252 transition count 726
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1101 place count 248 transition count 680
Iterating global reduction 6 with 4 rules applied. Total rules applied 1105 place count 248 transition count 680
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1126 place count 248 transition count 659
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 7 with 22 rules applied. Total rules applied 1148 place count 248 transition count 637
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1156 place count 240 transition count 621
Iterating global reduction 7 with 8 rules applied. Total rules applied 1164 place count 240 transition count 621
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1172 place count 232 transition count 555
Iterating global reduction 7 with 8 rules applied. Total rules applied 1180 place count 232 transition count 555
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1188 place count 232 transition count 547
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1189 place count 231 transition count 546
Applied a total of 1189 rules in 90 ms. Remains 231 /1051 variables (removed 820) and now considering 546/1687 (removed 1141) transitions.
[2022-05-14 22:29:38] [INFO ] Flow matrix only has 528 transitions (discarded 18 similar events)
// Phase 1: matrix 528 rows 231 cols
[2022-05-14 22:29:38] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:29:38] [INFO ] Implicit Places using invariants in 101 ms returned []
[2022-05-14 22:29:38] [INFO ] Flow matrix only has 528 transitions (discarded 18 similar events)
// Phase 1: matrix 528 rows 231 cols
[2022-05-14 22:29:38] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:29:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-14 22:29:38] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2022-05-14 22:29:38] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-14 22:29:38] [INFO ] Flow matrix only has 528 transitions (discarded 18 similar events)
// Phase 1: matrix 528 rows 231 cols
[2022-05-14 22:29:38] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:29:38] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/1051 places, 546/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/1051 places, 546/1687 transitions.
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={2} source=0 dest: 0}, { cond=(NOT p3), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p3 (NOT p2) p0), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1, 2} source=0 dest: 2}], [{ cond=(AND p3 (NOT p2) (NOT p0)), acceptance={1, 2} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 3}, { cond=p3, acceptance={2} source=1 dest: 4}, { cond=(NOT p3), acceptance={0, 2} source=1 dest: 4}, { cond=(AND p3 (NOT p2) p0), acceptance={1, 2} source=1 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1, 2} source=1 dest: 5}], [{ cond=(AND p3 (NOT p2) (NOT p0)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 3}, { cond=(AND p3 (NOT p2) p0), acceptance={1, 2} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1, 2} source=2 dest: 5}], [{ cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p3 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={2} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0, 2} source=3 dest: 4}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=3 dest: 5}], [{ cond=(AND p3 (NOT p1)), acceptance={2} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0, 2} source=4 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={1, 2} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p3 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={1, 2} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s12 1) (EQ s91 1)), p2:(EQ s16 1), p0:(EQ s32 1), p1:(EQ s43 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-08 finished in 1014 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(G(p1))||p2)))'
Support contains 3 out of 1051 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1033 transition count 1669
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1033 transition count 1669
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1023 transition count 1659
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1023 transition count 1659
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1019 transition count 1655
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1019 transition count 1655
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 1015 transition count 1651
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 1015 transition count 1651
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 1012 transition count 1648
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 1012 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 1010 transition count 1646
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1010 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 1008 transition count 1644
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1008 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1007 transition count 1643
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1007 transition count 1643
Applied a total of 88 rules in 177 ms. Remains 1007 /1051 variables (removed 44) and now considering 1643/1687 (removed 44) transitions.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:29:39] [INFO ] Computed 69 place invariants in 10 ms
[2022-05-14 22:29:39] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:29:39] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:29:40] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
// Phase 1: matrix 1643 rows 1007 cols
[2022-05-14 22:29:40] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:29:40] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1007/1051 places, 1643/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1007/1051 places, 1643/1687 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (NEQ s98 1) (EQ s334 1)), p0:(EQ s25 1), p2:(EQ s334 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 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-10 finished in 1877 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||p0))||G(p1)))'
Support contains 2 out of 1051 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Graph (trivial) has 975 edges and 1051 vertex of which 295 / 1051 are part of one of the 24 SCC in 3 ms
Free SCC test removed 271 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 192 place count 779 transition count 1202
Reduce places removed 191 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 218 rules applied. Total rules applied 410 place count 588 transition count 1175
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 428 place count 570 transition count 1175
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 428 place count 570 transition count 1107
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 564 place count 502 transition count 1107
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 607 place count 459 transition count 940
Iterating global reduction 3 with 43 rules applied. Total rules applied 650 place count 459 transition count 940
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 653 place count 459 transition count 937
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 653 place count 459 transition count 930
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 667 place count 452 transition count 930
Performed 166 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 4 with 332 rules applied. Total rules applied 999 place count 286 transition count 759
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1004 place count 286 transition count 754
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1023 place count 267 transition count 617
Iterating global reduction 5 with 19 rules applied. Total rules applied 1042 place count 267 transition count 617
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1057 place count 267 transition count 602
Performed 17 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1091 place count 250 transition count 700
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1095 place count 246 transition count 654
Iterating global reduction 6 with 4 rules applied. Total rules applied 1099 place count 246 transition count 654
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1120 place count 246 transition count 633
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 1146 place count 246 transition count 607
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1156 place count 236 transition count 587
Iterating global reduction 7 with 10 rules applied. Total rules applied 1166 place count 236 transition count 587
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1176 place count 226 transition count 503
Iterating global reduction 7 with 10 rules applied. Total rules applied 1186 place count 226 transition count 503
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1196 place count 226 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1197 place count 225 transition count 492
Applied a total of 1197 rules in 112 ms. Remains 225 /1051 variables (removed 826) and now considering 492/1687 (removed 1195) transitions.
[2022-05-14 22:29:41] [INFO ] Flow matrix only has 474 transitions (discarded 18 similar events)
// Phase 1: matrix 474 rows 225 cols
[2022-05-14 22:29:41] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:29:41] [INFO ] Implicit Places using invariants in 104 ms returned []
[2022-05-14 22:29:41] [INFO ] Flow matrix only has 474 transitions (discarded 18 similar events)
// Phase 1: matrix 474 rows 225 cols
[2022-05-14 22:29:41] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-14 22:29:41] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-14 22:29:41] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2022-05-14 22:29:41] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-14 22:29:41] [INFO ] Flow matrix only has 474 transitions (discarded 18 similar events)
// Phase 1: matrix 474 rows 225 cols
[2022-05-14 22:29:41] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-14 22:29:41] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 225/1051 places, 492/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 225/1051 places, 492/1687 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s221 1), p1:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-11 finished in 692 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(F(p1))))||F((X(F(p2))&&p3))))'
Support contains 3 out of 1051 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1033 transition count 1669
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1033 transition count 1669
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1024 transition count 1660
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1024 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1020 transition count 1656
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1020 transition count 1656
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1016 transition count 1652
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1016 transition count 1652
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 1013 transition count 1649
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 1013 transition count 1649
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1011 transition count 1647
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1011 transition count 1647
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 1009 transition count 1645
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 1009 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1008 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1008 transition count 1644
Applied a total of 86 rules in 185 ms. Remains 1008 /1051 variables (removed 43) and now considering 1644/1687 (removed 43) transitions.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:29:41] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:29:42] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:29:42] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:29:42] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:29:42] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:29:43] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1008/1051 places, 1644/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1008/1051 places, 1644/1687 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p3 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s839 1), p1:(NEQ s317 1), p2:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 149 reset in 322 ms.
Product exploration explored 100000 steps with 153 reset in 335 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Detected a total of 133/1008 stabilizing places and 133/1644 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p1 p2), (X p2), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p3 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 603 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1644 rows 1008 cols
[2022-05-14 22:29:45] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 22:29:45] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-14 22:29:45] [INFO ] [Nat]Absence check using 69 positive place invariants in 26 ms returned sat
[2022-05-14 22:29:45] [INFO ] After 145ms SMT Verify possible using all constraints in natural 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) p1 p2), (X p2), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p3 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F p3), (F (AND (NOT p3) (NOT p1))), (F (AND p3 (NOT p1)))]
Knowledge based reduction with 13 factoid took 552 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Support contains 2 out of 1008 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1008/1008 places, 1644/1644 transitions.
Graph (trivial) has 931 edges and 1008 vertex of which 281 / 1008 are part of one of the 25 SCC in 1 ms
Free SCC test removed 256 places
Ensure Unique test removed 276 transitions
Reduce isomorphic transitions removed 276 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 172 place count 751 transition count 1196
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 198 rules applied. Total rules applied 370 place count 580 transition count 1169
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 389 place count 562 transition count 1168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 390 place count 561 transition count 1168
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 72 Pre rules applied. Total rules applied 390 place count 561 transition count 1096
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 534 place count 489 transition count 1096
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 569 place count 454 transition count 912
Iterating global reduction 4 with 35 rules applied. Total rules applied 604 place count 454 transition count 912
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 608 place count 454 transition count 908
Performed 167 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 167 places in 1 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 5 with 334 rules applied. Total rules applied 942 place count 287 transition count 736
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 947 place count 287 transition count 731
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 960 place count 274 transition count 639
Iterating global reduction 6 with 13 rules applied. Total rules applied 973 place count 274 transition count 639
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 985 place count 274 transition count 627
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 987 place count 273 transition count 626
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1019 place count 257 transition count 719
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1023 place count 253 transition count 673
Iterating global reduction 7 with 4 rules applied. Total rules applied 1027 place count 253 transition count 673
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1048 place count 253 transition count 652
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 1070 place count 253 transition count 630
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1078 place count 245 transition count 614
Iterating global reduction 8 with 8 rules applied. Total rules applied 1086 place count 245 transition count 614
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1094 place count 237 transition count 548
Iterating global reduction 8 with 8 rules applied. Total rules applied 1102 place count 237 transition count 548
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1110 place count 237 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1111 place count 236 transition count 539
Applied a total of 1111 rules in 87 ms. Remains 236 /1008 variables (removed 772) and now considering 539/1644 (removed 1105) transitions.
[2022-05-14 22:29:46] [INFO ] Flow matrix only has 518 transitions (discarded 21 similar events)
// Phase 1: matrix 518 rows 236 cols
[2022-05-14 22:29:46] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:29:46] [INFO ] Implicit Places using invariants in 112 ms returned []
[2022-05-14 22:29:46] [INFO ] Flow matrix only has 518 transitions (discarded 21 similar events)
// Phase 1: matrix 518 rows 236 cols
[2022-05-14 22:29:46] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-14 22:29:46] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-14 22:29:46] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2022-05-14 22:29:46] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-14 22:29:46] [INFO ] Flow matrix only has 518 transitions (discarded 21 similar events)
// Phase 1: matrix 518 rows 236 cols
[2022-05-14 22:29:46] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:29:46] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/1008 places, 539/1644 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/1008 places, 539/1644 transitions.
Computed a total of 3 stabilizing places and 18 stable transitions
Computed a total of 3 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p3) p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Finished random walk after 366 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p3) p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT p3)))]
False Knowledge obtained : [(F p3), (F (AND (NOT p1) (NOT p3)))]
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 3 ms.
FORMULA DLCround-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-12 finished in 5787 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&p1))))'
Support contains 3 out of 1051 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1032 transition count 1668
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1032 transition count 1668
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 1022 transition count 1658
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 1022 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1018 transition count 1654
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1018 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 1014 transition count 1650
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 1014 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 1011 transition count 1647
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 1011 transition count 1647
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 1009 transition count 1645
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 1009 transition count 1645
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 1007 transition count 1643
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 1007 transition count 1643
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1006 transition count 1642
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1006 transition count 1642
Applied a total of 90 rules in 183 ms. Remains 1006 /1051 variables (removed 45) and now considering 1642/1687 (removed 45) transitions.
// Phase 1: matrix 1642 rows 1006 cols
[2022-05-14 22:29:47] [INFO ] Computed 69 place invariants in 4 ms
[2022-05-14 22:29:47] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 1642 rows 1006 cols
[2022-05-14 22:29:47] [INFO ] Computed 69 place invariants in 5 ms
[2022-05-14 22:29:48] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 917 ms to find 0 implicit places.
// Phase 1: matrix 1642 rows 1006 cols
[2022-05-14 22:29:48] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 22:29:49] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1006/1051 places, 1642/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1051 places, 1642/1687 transitions.
Stuttering acceptance computed with spot in 321 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s481 0) (EQ s974 0)), p1:(EQ s987 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6510 steps with 0 reset in 30 ms.
FORMULA DLCround-PT-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-13 finished in 2074 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((X(X(X(p0))) U p1)))||(p1 U p2))))'
Support contains 2 out of 1051 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1051/1051 places, 1687/1687 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1035 transition count 1671
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1035 transition count 1671
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1028 transition count 1664
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1028 transition count 1664
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 1025 transition count 1661
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 1025 transition count 1661
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1022 transition count 1658
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1022 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 1020 transition count 1656
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 1020 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1019 transition count 1655
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1019 transition count 1655
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1018 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1018 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1017 transition count 1653
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1017 transition count 1653
Applied a total of 68 rules in 179 ms. Remains 1017 /1051 variables (removed 34) and now considering 1653/1687 (removed 34) transitions.
// Phase 1: matrix 1653 rows 1017 cols
[2022-05-14 22:29:49] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:29:49] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 1653 rows 1017 cols
[2022-05-14 22:29:49] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:29:50] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
// Phase 1: matrix 1653 rows 1017 cols
[2022-05-14 22:29:50] [INFO ] Computed 69 place invariants in 10 ms
[2022-05-14 22:29:51] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1017/1051 places, 1653/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1017/1051 places, 1653/1687 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p2:(EQ s669 1), p1:(EQ s989 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 309 ms.
Product exploration explored 100000 steps with 52 reset in 350 ms.
Computed a total of 140 stabilizing places and 140 stable transitions
Computed a total of 140 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1306 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=130 )
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
// Phase 1: matrix 1653 rows 1017 cols
[2022-05-14 22:29:52] [INFO ] Computed 69 place invariants in 10 ms
[2022-05-14 22:29:53] [INFO ] [Real]Absence check using 69 positive place invariants in 44 ms returned sat
[2022-05-14 22:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:29:54] [INFO ] [Real]Absence check using state equation in 1372 ms returned sat
[2022-05-14 22:29:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:29:55] [INFO ] [Nat]Absence check using 69 positive place invariants in 49 ms returned sat
[2022-05-14 22:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:29:56] [INFO ] [Nat]Absence check using state equation in 1338 ms returned sat
[2022-05-14 22:29:56] [INFO ] Computed and/alt/rep : 1608/3127/1608 causal constraints (skipped 44 transitions) in 87 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-14 22:30:09] [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 p1)
Could not prove EG (NOT p1)
Support contains 1 out of 1017 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1017/1017 places, 1653/1653 transitions.
Graph (trivial) has 939 edges and 1017 vertex of which 295 / 1017 are part of one of the 24 SCC in 0 ms
Free SCC test removed 271 places
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 294 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 172 place count 745 transition count 1187
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 198 rules applied. Total rules applied 370 place count 574 transition count 1160
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 388 place count 556 transition count 1160
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 388 place count 556 transition count 1089
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 530 place count 485 transition count 1089
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 568 place count 447 transition count 895
Iterating global reduction 3 with 38 rules applied. Total rules applied 606 place count 447 transition count 895
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 610 place count 447 transition count 891
Performed 164 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 164 places in 1 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 4 with 328 rules applied. Total rules applied 938 place count 283 transition count 722
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 943 place count 283 transition count 717
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 957 place count 269 transition count 617
Iterating global reduction 5 with 14 rules applied. Total rules applied 971 place count 269 transition count 617
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 985 place count 269 transition count 603
Performed 16 Post agglomeration using F-continuation condition with reduction of 20 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 1017 place count 253 transition count 692
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1021 place count 249 transition count 648
Iterating global reduction 6 with 4 rules applied. Total rules applied 1025 place count 249 transition count 648
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1046 place count 249 transition count 627
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 7 with 24 rules applied. Total rules applied 1070 place count 249 transition count 603
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1080 place count 239 transition count 583
Iterating global reduction 7 with 10 rules applied. Total rules applied 1090 place count 239 transition count 583
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1100 place count 229 transition count 501
Iterating global reduction 7 with 10 rules applied. Total rules applied 1110 place count 229 transition count 501
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1120 place count 229 transition count 491
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1121 place count 228 transition count 490
Applied a total of 1121 rules in 80 ms. Remains 228 /1017 variables (removed 789) and now considering 490/1653 (removed 1163) transitions.
[2022-05-14 22:30:09] [INFO ] Flow matrix only has 473 transitions (discarded 17 similar events)
// Phase 1: matrix 473 rows 228 cols
[2022-05-14 22:30:09] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:30:09] [INFO ] Implicit Places using invariants in 113 ms returned []
[2022-05-14 22:30:09] [INFO ] Flow matrix only has 473 transitions (discarded 17 similar events)
// Phase 1: matrix 473 rows 228 cols
[2022-05-14 22:30:09] [INFO ] Computed 69 place invariants in 9 ms
[2022-05-14 22:30:09] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-14 22:30:10] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2022-05-14 22:30:10] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-14 22:30:10] [INFO ] Flow matrix only has 473 transitions (discarded 17 similar events)
// Phase 1: matrix 473 rows 228 cols
[2022-05-14 22:30:10] [INFO ] Computed 69 place invariants in 1 ms
[2022-05-14 22:30:10] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/1017 places, 490/1653 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/1017 places, 490/1653 transitions.
Computed a total of 3 stabilizing places and 18 stable transitions
Computed a total of 3 stabilizing places and 18 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Finished random walk after 414 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=69 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
[2022-05-14 22:30:10] [INFO ] Flow matrix only has 473 transitions (discarded 17 similar events)
// Phase 1: matrix 473 rows 228 cols
[2022-05-14 22:30:10] [INFO ] Computed 69 place invariants in 3 ms
[2022-05-14 22:30:10] [INFO ] [Real]Absence check using 69 positive place invariants in 12 ms returned sat
[2022-05-14 22:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 22:30:10] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2022-05-14 22:30:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 22:30:11] [INFO ] [Nat]Absence check using 69 positive place invariants in 13 ms returned sat
[2022-05-14 22:30:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 22:30:11] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2022-05-14 22:30:11] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-14 22:30:11] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2022-05-14 22:30:11] [INFO ] Computed and/alt/rep : 286/700/286 causal constraints (skipped 145 transitions) in 25 ms.
[2022-05-14 22:30:11] [INFO ] Added : 5 causal constraints over 1 iterations in 77 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-15 finished in 21744 ms.
All properties solved by simple procedures.
Total runtime 210252 ms.

BK_STOP 1652567411385

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-04b"
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-4028"
echo " Executing tool itstools"
echo " Input is DLCround-PT-04b, 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 r060-tall-165254771600140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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