About the Execution of ITS-Tools for CloudReconfiguration-PT-316
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3529.031 | 279632.00 | 752272.00 | 749.30 | FFFFFFFFFTFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r101-tall-167814474900123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CloudReconfiguration-PT-316, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814474900123
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678230123731
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-316
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-07 23:02:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 23:02:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 23:02:05] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-07 23:02:05] [INFO ] Transformed 2585 places.
[2023-03-07 23:02:05] [INFO ] Transformed 3095 transitions.
[2023-03-07 23:02:05] [INFO ] Found NUPN structural information;
[2023-03-07 23:02:05] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 519 places :
Symmetric choice reduction at 0 with 519 rule applications. Total rules 519 place count 2066 transition count 2576
Iterating global reduction 0 with 519 rules applied. Total rules applied 1038 place count 2066 transition count 2576
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1066 place count 2066 transition count 2548
Discarding 242 places :
Symmetric choice reduction at 1 with 242 rule applications. Total rules 1308 place count 1824 transition count 2306
Iterating global reduction 1 with 242 rules applied. Total rules applied 1550 place count 1824 transition count 2306
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1638 place count 1736 transition count 2218
Iterating global reduction 1 with 88 rules applied. Total rules applied 1726 place count 1736 transition count 2218
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1744 place count 1736 transition count 2200
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1790 place count 1690 transition count 2154
Iterating global reduction 2 with 46 rules applied. Total rules applied 1836 place count 1690 transition count 2154
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1844 place count 1690 transition count 2146
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1880 place count 1654 transition count 2105
Iterating global reduction 3 with 36 rules applied. Total rules applied 1916 place count 1654 transition count 2105
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1943 place count 1627 transition count 2078
Iterating global reduction 3 with 27 rules applied. Total rules applied 1970 place count 1627 transition count 2078
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1995 place count 1602 transition count 2053
Iterating global reduction 3 with 25 rules applied. Total rules applied 2020 place count 1602 transition count 2053
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 2043 place count 1579 transition count 2030
Iterating global reduction 3 with 23 rules applied. Total rules applied 2066 place count 1579 transition count 2030
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2086 place count 1559 transition count 1998
Iterating global reduction 3 with 20 rules applied. Total rules applied 2106 place count 1559 transition count 1998
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2114 place count 1551 transition count 1984
Iterating global reduction 3 with 8 rules applied. Total rules applied 2122 place count 1551 transition count 1984
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2130 place count 1543 transition count 1973
Iterating global reduction 3 with 8 rules applied. Total rules applied 2138 place count 1543 transition count 1973
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2141 place count 1543 transition count 1970
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2144 place count 1540 transition count 1967
Iterating global reduction 4 with 3 rules applied. Total rules applied 2147 place count 1540 transition count 1967
Applied a total of 2147 rules in 1631 ms. Remains 1540 /2585 variables (removed 1045) and now considering 1967/3095 (removed 1128) transitions.
// Phase 1: matrix 1967 rows 1540 cols
[2023-03-07 23:02:07] [INFO ] Computed 4 place invariants in 46 ms
[2023-03-07 23:02:07] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-07 23:02:07] [INFO ] Invariant cache hit.
[2023-03-07 23:02:08] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
[2023-03-07 23:02:08] [INFO ] Invariant cache hit.
[2023-03-07 23:02:09] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1540/2585 places, 1967/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3872 ms. Remains : 1540/2585 places, 1967/3095 transitions.
Support contains 28 out of 1540 places after structural reductions.
[2023-03-07 23:02:09] [INFO ] Flatten gal took : 125 ms
[2023-03-07 23:02:09] [INFO ] Flatten gal took : 67 ms
[2023-03-07 23:02:10] [INFO ] Input system was already deterministic with 1967 transitions.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 249905 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249905 steps, saw 71627 distinct states, run finished after 3005 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-07 23:02:13] [INFO ] Invariant cache hit.
[2023-03-07 23:02:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-07 23:02:15] [INFO ] After 1098ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:13
[2023-03-07 23:02:15] [INFO ] After 1364ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-07 23:02:15] [INFO ] After 2098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-07 23:02:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-07 23:02:18] [INFO ] After 1682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-07 23:02:19] [INFO ] After 3290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 879 ms.
[2023-03-07 23:02:20] [INFO ] After 5049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 8 properties in 227 ms.
Support contains 10 out of 1540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Graph (trivial) has 1861 edges and 1540 vertex of which 663 / 1540 are part of one of the 61 SCC in 7 ms
Free SCC test removed 602 places
Drop transitions removed 756 transitions
Reduce isomorphic transitions removed 756 transitions.
Graph (complete) has 1384 edges and 938 vertex of which 929 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 516 transitions
Trivial Post-agglo rules discarded 516 transitions
Performed 516 trivial Post agglomeration. Transition count delta: 516
Iterating post reduction 0 with 523 rules applied. Total rules applied 525 place count 929 transition count 684
Reduce places removed 516 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 575 rules applied. Total rules applied 1100 place count 413 transition count 625
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 41 rules applied. Total rules applied 1141 place count 375 transition count 622
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1144 place count 374 transition count 620
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1148 place count 373 transition count 617
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 1153 place count 371 transition count 614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1157 place count 368 transition count 613
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 52 Pre rules applied. Total rules applied 1157 place count 368 transition count 561
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 1261 place count 316 transition count 561
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1270 place count 307 transition count 549
Iterating global reduction 7 with 9 rules applied. Total rules applied 1279 place count 307 transition count 549
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 3 rules applied. Total rules applied 1282 place count 307 transition count 546
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1284 place count 305 transition count 546
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1289 place count 300 transition count 541
Iterating global reduction 9 with 5 rules applied. Total rules applied 1294 place count 300 transition count 541
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1299 place count 300 transition count 536
Performed 155 Post agglomeration using F-continuation condition with reduction of 102 identical transitions.
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 10 with 310 rules applied. Total rules applied 1609 place count 145 transition count 279
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 1628 place count 145 transition count 260
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1631 place count 142 transition count 257
Iterating global reduction 11 with 3 rules applied. Total rules applied 1634 place count 142 transition count 257
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 1656 place count 131 transition count 245
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1670 place count 131 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1672 place count 130 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1675 place count 130 transition count 227
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 13 with 2 rules applied. Total rules applied 1677 place count 129 transition count 226
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1678 place count 129 transition count 225
Performed 35 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 14 with 70 rules applied. Total rules applied 1748 place count 94 transition count 260
Drop transitions removed 9 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 14 with 35 rules applied. Total rules applied 1783 place count 94 transition count 225
Discarding 20 places :
Symmetric choice reduction at 15 with 20 rule applications. Total rules 1803 place count 74 transition count 191
Iterating global reduction 15 with 20 rules applied. Total rules applied 1823 place count 74 transition count 191
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 15 with 13 rules applied. Total rules applied 1836 place count 74 transition count 178
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 1838 place count 72 transition count 174
Iterating global reduction 16 with 2 rules applied. Total rules applied 1840 place count 72 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 1842 place count 72 transition count 172
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 17 with 16 rules applied. Total rules applied 1858 place count 72 transition count 156
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 1860 place count 70 transition count 152
Iterating global reduction 17 with 2 rules applied. Total rules applied 1862 place count 70 transition count 152
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1863 place count 69 transition count 151
Iterating global reduction 17 with 1 rules applied. Total rules applied 1864 place count 69 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1865 place count 69 transition count 150
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1866 place count 69 transition count 149
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 1870 place count 69 transition count 145
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 1876 place count 65 transition count 143
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 1878 place count 65 transition count 143
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1879 place count 65 transition count 142
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1880 place count 64 transition count 141
Iterating global reduction 19 with 1 rules applied. Total rules applied 1881 place count 64 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1882 place count 63 transition count 140
Applied a total of 1882 rules in 161 ms. Remains 63 /1540 variables (removed 1477) and now considering 140/1967 (removed 1827) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 63/1540 places, 140/1967 transitions.
Finished random walk after 2753 steps, including 28 resets, run visited all 7 properties in 31 ms. (steps per millisecond=88 )
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2145 edges and 1540 vertex of which 1531 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.23 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)&&p0)))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1529 transition count 1956
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1529 transition count 1956
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1529 transition count 1955
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1522 transition count 1947
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1522 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 1522 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 1519 transition count 1943
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 1519 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 1517 transition count 1941
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 1517 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 1515 transition count 1939
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 1513 transition count 1937
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 1511 transition count 1934
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1510 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1510 transition count 1932
Applied a total of 62 rules in 448 ms. Remains 1510 /1540 variables (removed 30) and now considering 1932/1967 (removed 35) transitions.
// Phase 1: matrix 1932 rows 1510 cols
[2023-03-07 23:02:21] [INFO ] Computed 4 place invariants in 20 ms
[2023-03-07 23:02:22] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-07 23:02:22] [INFO ] Invariant cache hit.
[2023-03-07 23:02:23] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
[2023-03-07 23:02:23] [INFO ] Invariant cache hit.
[2023-03-07 23:02:23] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1540 places, 1932/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2263 ms. Remains : 1510/1540 places, 1932/1967 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (EQ s1475 0) (EQ s1300 1)), p1:(AND (EQ s1475 0) (EQ s1300 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-01 finished in 2600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((p0||G(p1)))))&&F(p2)))'
Support contains 4 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1530 transition count 1957
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1530 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1530 transition count 1956
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 1523 transition count 1948
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 1523 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 1523 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 1519 transition count 1943
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 1519 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 1516 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 1516 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 1514 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 1514 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 1512 transition count 1936
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 1510 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1509 transition count 1931
Applied a total of 64 rules in 421 ms. Remains 1509 /1540 variables (removed 31) and now considering 1931/1967 (removed 36) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2023-03-07 23:02:24] [INFO ] Computed 4 place invariants in 21 ms
[2023-03-07 23:02:24] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-07 23:02:24] [INFO ] Invariant cache hit.
[2023-03-07 23:02:25] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
[2023-03-07 23:02:25] [INFO ] Invariant cache hit.
[2023-03-07 23:02:26] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1540 places, 1931/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2272 ms. Remains : 1509/1540 places, 1931/1967 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s895 0) (EQ s60 1)), p0:(AND (EQ s60 0) (EQ s895 1)), p1:(AND (EQ s423 0) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-04 finished in 2517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Graph (trivial) has 1876 edges and 1540 vertex of which 695 / 1540 are part of one of the 63 SCC in 6 ms
Free SCC test removed 632 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1405 edges and 908 vertex of which 899 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 898 transition count 731
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 522 rules applied. Total rules applied 1020 place count 402 transition count 705
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 1034 place count 389 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1035 place count 388 transition count 704
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1035 place count 388 transition count 657
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1129 place count 341 transition count 657
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1144 place count 326 transition count 635
Iterating global reduction 4 with 15 rules applied. Total rules applied 1159 place count 326 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1162 place count 326 transition count 632
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1164 place count 324 transition count 632
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1174 place count 314 transition count 618
Iterating global reduction 6 with 10 rules applied. Total rules applied 1184 place count 314 transition count 618
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1190 place count 314 transition count 612
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1191 place count 313 transition count 610
Iterating global reduction 7 with 1 rules applied. Total rules applied 1192 place count 313 transition count 610
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1193 place count 312 transition count 608
Iterating global reduction 7 with 1 rules applied. Total rules applied 1194 place count 312 transition count 608
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1195 place count 311 transition count 606
Iterating global reduction 7 with 1 rules applied. Total rules applied 1196 place count 311 transition count 606
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1197 place count 310 transition count 604
Iterating global reduction 7 with 1 rules applied. Total rules applied 1198 place count 310 transition count 604
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1199 place count 309 transition count 602
Iterating global reduction 7 with 1 rules applied. Total rules applied 1200 place count 309 transition count 602
Performed 142 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1484 place count 167 transition count 378
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1500 place count 167 transition count 362
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1507 place count 160 transition count 349
Iterating global reduction 8 with 7 rules applied. Total rules applied 1514 place count 160 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1515 place count 160 transition count 348
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1516 place count 159 transition count 346
Iterating global reduction 9 with 1 rules applied. Total rules applied 1517 place count 159 transition count 346
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1518 place count 158 transition count 344
Iterating global reduction 9 with 1 rules applied. Total rules applied 1519 place count 158 transition count 344
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1520 place count 157 transition count 342
Iterating global reduction 9 with 1 rules applied. Total rules applied 1521 place count 157 transition count 342
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1522 place count 156 transition count 340
Iterating global reduction 9 with 1 rules applied. Total rules applied 1523 place count 156 transition count 340
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1547 place count 144 transition count 327
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1559 place count 144 transition count 315
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1561 place count 142 transition count 307
Iterating global reduction 10 with 2 rules applied. Total rules applied 1563 place count 142 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1597 place count 125 transition count 342
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 1615 place count 125 transition count 324
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1624 place count 116 transition count 306
Iterating global reduction 11 with 9 rules applied. Total rules applied 1633 place count 116 transition count 306
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1638 place count 116 transition count 301
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 12 with 35 rules applied. Total rules applied 1673 place count 116 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1674 place count 115 transition count 265
Applied a total of 1674 rules in 253 ms. Remains 115 /1540 variables (removed 1425) and now considering 265/1967 (removed 1702) transitions.
[2023-03-07 23:02:26] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 115 cols
[2023-03-07 23:02:26] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-07 23:02:26] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-07 23:02:26] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2023-03-07 23:02:26] [INFO ] Invariant cache hit.
[2023-03-07 23:02:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 23:02:27] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 218 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1540 places, 265/1967 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 263
Applied a total of 2 rules in 9 ms. Remains 111 /113 variables (removed 2) and now considering 263/265 (removed 2) transitions.
[2023-03-07 23:02:27] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 111 cols
[2023-03-07 23:02:27] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 23:02:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-07 23:02:27] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2023-03-07 23:02:27] [INFO ] Invariant cache hit.
[2023-03-07 23:02:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 23:02:27] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1540 places, 263/1967 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 604 ms. Remains : 111/1540 places, 263/1967 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s86 0) (EQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-05 finished in 653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U !p0)))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1528 transition count 1955
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1528 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1528 transition count 1954
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 1520 transition count 1945
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 1520 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 1520 transition count 1944
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 1516 transition count 1940
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 1516 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 1513 transition count 1937
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 1511 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1509 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1507 transition count 1930
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1506 transition count 1928
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1506 transition count 1928
Applied a total of 70 rules in 663 ms. Remains 1506 /1540 variables (removed 34) and now considering 1928/1967 (removed 39) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2023-03-07 23:02:27] [INFO ] Computed 4 place invariants in 20 ms
[2023-03-07 23:02:28] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-07 23:02:28] [INFO ] Invariant cache hit.
[2023-03-07 23:02:29] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2023-03-07 23:02:29] [INFO ] Invariant cache hit.
[2023-03-07 23:02:29] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1540 places, 1928/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2520 ms. Remains : 1506/1540 places, 1928/1967 transitions.
Stuttering acceptance computed with spot in 139 ms :[p0, p0, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1219 0) (EQ s717 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 762 reset in 247 ms.
Product exploration explored 100000 steps with 771 reset in 190 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 475952 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 475952 steps, saw 116472 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:02:33] [INFO ] Invariant cache hit.
[2023-03-07 23:02:33] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:02:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-07 23:02:34] [INFO ] After 688ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:02:34] [INFO ] After 820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-07 23:02:34] [INFO ] After 1068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[p0, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[p0, (NOT p0), (NOT p0)]
[2023-03-07 23:02:35] [INFO ] Invariant cache hit.
Proved EG p0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-316-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-07 finished in 8833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p0)&&G(p1))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1529 transition count 1956
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1529 transition count 1956
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 1521 transition count 1947
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 1521 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1521 transition count 1946
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 1517 transition count 1942
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 1517 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 1514 transition count 1939
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1512 transition count 1937
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1510 transition count 1935
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1508 transition count 1932
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1507 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1507 transition count 1930
Applied a total of 67 rules in 399 ms. Remains 1507 /1540 variables (removed 33) and now considering 1930/1967 (removed 37) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2023-03-07 23:02:36] [INFO ] Computed 4 place invariants in 14 ms
[2023-03-07 23:02:36] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-07 23:02:36] [INFO ] Invariant cache hit.
[2023-03-07 23:02:37] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2023-03-07 23:02:37] [INFO ] Invariant cache hit.
[2023-03-07 23:02:38] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1540 places, 1930/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2275 ms. Remains : 1507/1540 places, 1930/1967 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s396 0) (EQ s864 1)), p1:(EQ s366 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1062 ms.
Product exploration explored 100000 steps with 50000 reset in 1035 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-316-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-09 finished in 4860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 6 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1530 transition count 1957
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1530 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1530 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 1524 transition count 1949
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 1524 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 1524 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 1522 transition count 1946
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 1522 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 1521 transition count 1945
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 1521 transition count 1945
Applied a total of 40 rules in 232 ms. Remains 1521 /1540 variables (removed 19) and now considering 1945/1967 (removed 22) transitions.
// Phase 1: matrix 1945 rows 1521 cols
[2023-03-07 23:02:41] [INFO ] Computed 4 place invariants in 12 ms
[2023-03-07 23:02:41] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-07 23:02:41] [INFO ] Invariant cache hit.
[2023-03-07 23:02:42] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2023-03-07 23:02:42] [INFO ] Invariant cache hit.
[2023-03-07 23:02:42] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1521/1540 places, 1945/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1995 ms. Remains : 1521/1540 places, 1945/1967 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (OR (EQ s647 0) (EQ s1217 1)) (OR (EQ s395 0) (EQ s1324 1))), p0:(AND (EQ s1053 0) (EQ s1482 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-12 finished in 2194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p0||X(p1))) U ((X((!p0||X(p1)))&&(!p0||G(p2)))||X(G((!p0||X(p1))))))))'
Support contains 6 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1532 transition count 1959
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1532 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1532 transition count 1958
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 1527 transition count 1953
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 1527 transition count 1953
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 1523 transition count 1949
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 1523 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 1520 transition count 1946
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 1520 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1518 transition count 1944
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1516 transition count 1942
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1514 transition count 1939
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1513 transition count 1937
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1513 transition count 1937
Applied a total of 55 rules in 401 ms. Remains 1513 /1540 variables (removed 27) and now considering 1937/1967 (removed 30) transitions.
// Phase 1: matrix 1937 rows 1513 cols
[2023-03-07 23:02:43] [INFO ] Computed 4 place invariants in 17 ms
[2023-03-07 23:02:43] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-07 23:02:43] [INFO ] Invariant cache hit.
[2023-03-07 23:02:44] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2023-03-07 23:02:44] [INFO ] Invariant cache hit.
[2023-03-07 23:02:45] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1513/1540 places, 1937/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2328 ms. Remains : 1513/1540 places, 1937/1967 transitions.
Stuttering acceptance computed with spot in 436 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 p2), acceptance={1} source=2 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=3 dest: 6}, { cond=(AND p0 p2 p1), acceptance={1} source=3 dest: 7}, { cond=(AND p2 p1), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=7 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=7 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p0 p2), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p2), acceptance={} source=10 dest: 5}, { cond=p2, acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s79 1)), p2:(OR (EQ s1467 0) (EQ s1463 1)), p1:(OR (EQ s431 0) (EQ s262 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24967 reset in 591 ms.
Product exploration explored 100000 steps with 24923 reset in 599 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2114 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.11 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 864 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 78 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 236403 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236403 steps, saw 67830 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-07 23:02:52] [INFO ] Invariant cache hit.
[2023-03-07 23:02:52] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-07 23:02:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-07 23:02:55] [INFO ] After 1658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-07 23:02:56] [INFO ] After 2970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 746 ms.
[2023-03-07 23:02:57] [INFO ] After 4494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 11 different solutions.
Finished Parikh walk after 435 steps, including 2 resets, run visited all 13 properties in 7 ms. (steps per millisecond=62 )
Parikh walk visited 13 properties in 7 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 16 factoid took 1201 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 501 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 415 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Applied a total of 0 rules in 46 ms. Remains 1513 /1513 variables (removed 0) and now considering 1937/1937 (removed 0) transitions.
[2023-03-07 23:02:59] [INFO ] Invariant cache hit.
[2023-03-07 23:02:59] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-07 23:02:59] [INFO ] Invariant cache hit.
[2023-03-07 23:03:00] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2023-03-07 23:03:00] [INFO ] Invariant cache hit.
[2023-03-07 23:03:01] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1825 ms. Remains : 1513/1513 places, 1937/1937 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2114 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (X (AND p0 p1 p2))), (X (X (AND p1 p2))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 941 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 252983 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252983 steps, saw 72212 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-07 23:03:06] [INFO ] Invariant cache hit.
[2023-03-07 23:03:06] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-07 23:03:07] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-07 23:03:08] [INFO ] After 1349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-07 23:03:10] [INFO ] After 2648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 748 ms.
[2023-03-07 23:03:10] [INFO ] After 4093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 12 properties in 22 ms.
Support contains 2 out of 1513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Graph (trivial) has 1846 edges and 1513 vertex of which 693 / 1513 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Drop transitions removed 795 transitions
Reduce isomorphic transitions removed 795 transitions.
Graph (complete) has 1314 edges and 883 vertex of which 874 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 874 transition count 642
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 548 rules applied. Total rules applied 1046 place count 385 transition count 583
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1085 place count 346 transition count 583
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 1085 place count 346 transition count 533
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1185 place count 296 transition count 533
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1196 place count 285 transition count 517
Iterating global reduction 3 with 11 rules applied. Total rules applied 1207 place count 285 transition count 517
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1210 place count 285 transition count 514
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1213 place count 282 transition count 514
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1219 place count 276 transition count 508
Iterating global reduction 5 with 6 rules applied. Total rules applied 1225 place count 276 transition count 508
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1231 place count 276 transition count 502
Performed 146 Post agglomeration using F-continuation condition with reduction of 97 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 6 with 292 rules applied. Total rules applied 1523 place count 130 transition count 259
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1542 place count 130 transition count 240
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1545 place count 127 transition count 237
Iterating global reduction 7 with 3 rules applied. Total rules applied 1548 place count 127 transition count 237
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1574 place count 114 transition count 221
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1590 place count 114 transition count 205
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 8 with 2 rules applied. Total rules applied 1592 place count 113 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1595 place count 113 transition count 201
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 9 with 2 rules applied. Total rules applied 1597 place count 112 transition count 200
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1598 place count 112 transition count 199
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1664 place count 79 transition count 230
Drop transitions removed 11 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 10 with 37 rules applied. Total rules applied 1701 place count 79 transition count 193
Discarding 22 places :
Symmetric choice reduction at 11 with 22 rule applications. Total rules 1723 place count 57 transition count 157
Iterating global reduction 11 with 22 rules applied. Total rules applied 1745 place count 57 transition count 157
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1758 place count 57 transition count 144
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1764 place count 51 transition count 132
Iterating global reduction 12 with 6 rules applied. Total rules applied 1770 place count 51 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1776 place count 51 transition count 126
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 13 with 11 rules applied. Total rules applied 1787 place count 51 transition count 115
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1788 place count 50 transition count 112
Iterating global reduction 13 with 1 rules applied. Total rules applied 1789 place count 50 transition count 112
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1790 place count 49 transition count 111
Iterating global reduction 13 with 1 rules applied. Total rules applied 1791 place count 49 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1792 place count 49 transition count 110
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 14 with 2 rules applied. Total rules applied 1794 place count 48 transition count 109
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1795 place count 48 transition count 108
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 1799 place count 48 transition count 104
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1805 place count 44 transition count 102
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1806 place count 44 transition count 101
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1807 place count 44 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1808 place count 43 transition count 100
Applied a total of 1808 rules in 48 ms. Remains 43 /1513 variables (removed 1470) and now considering 100/1937 (removed 1837) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 43/1513 places, 100/1937 transitions.
Finished random walk after 123 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (X (AND p0 p1 p2))), (X (X (AND p1 p2))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F (NOT p1)), (F (AND p2 (NOT p1) p0)), (F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) p1)), (F (NOT (AND p2 p1))), (F (NOT p2)), (F (NOT (AND p2 p1 p0))), (F (NOT p0)), (F (NOT (AND p2 p0))), (F (AND (NOT p2) p0)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 16 factoid took 1349 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 404 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 371 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 421 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 24959 reset in 579 ms.
Product exploration explored 100000 steps with 25017 reset in 586 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 417 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Graph (trivial) has 1835 edges and 1513 vertex of which 687 / 1513 are part of one of the 62 SCC in 3 ms
Free SCC test removed 625 places
Ensure Unique test removed 726 transitions
Reduce isomorphic transitions removed 726 transitions.
Graph (complete) has 1382 edges and 888 vertex of which 879 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 474 rules applied. Total rules applied 476 place count 879 transition count 1206
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 488 place count 879 transition count 1194
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 488 place count 879 transition count 1207
Deduced a syphon composed of 496 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 510 place count 879 transition count 1207
Discarding 281 places :
Symmetric choice reduction at 2 with 281 rule applications. Total rules 791 place count 598 transition count 918
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 281 rules applied. Total rules applied 1072 place count 598 transition count 918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1082 place count 588 transition count 906
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1092 place count 588 transition count 906
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1098 place count 588 transition count 900
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1106 place count 580 transition count 892
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1114 place count 580 transition count 892
Performed 113 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 332 places in 1 ms
Iterating global reduction 3 with 113 rules applied. Total rules applied 1227 place count 580 transition count 967
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1270 place count 580 transition count 924
Discarding 107 places :
Symmetric choice reduction at 4 with 107 rule applications. Total rules 1377 place count 473 transition count 807
Deduced a syphon composed of 235 places in 0 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1484 place count 473 transition count 807
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1490 place count 467 transition count 798
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1496 place count 467 transition count 798
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 236 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1503 place count 467 transition count 798
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1509 place count 467 transition count 792
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1524 place count 452 transition count 773
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1539 place count 452 transition count 773
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1545 place count 452 transition count 767
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1549 place count 448 transition count 763
Deduced a syphon composed of 221 places in 3 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1553 place count 448 transition count 763
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1556 place count 448 transition count 763
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1561 place count 448 transition count 758
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1564 place count 445 transition count 755
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1567 place count 445 transition count 755
Performed 78 Post agglomeration using F-continuation condition with reduction of 115 identical transitions.
Deduced a syphon composed of 299 places in 0 ms
Iterating global reduction 7 with 78 rules applied. Total rules applied 1645 place count 445 transition count 1120
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 7 with 122 rules applied. Total rules applied 1767 place count 445 transition count 998
Discarding 130 places :
Symmetric choice reduction at 8 with 130 rule applications. Total rules 1897 place count 315 transition count 646
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 8 with 130 rules applied. Total rules applied 2027 place count 315 transition count 646
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 2039 place count 315 transition count 634
Discarding 24 places :
Symmetric choice reduction at 9 with 24 rule applications. Total rules 2063 place count 291 transition count 587
Deduced a syphon composed of 154 places in 0 ms
Iterating global reduction 9 with 24 rules applied. Total rules applied 2087 place count 291 transition count 587
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2090 place count 291 transition count 639
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2093 place count 288 transition count 610
Deduced a syphon composed of 154 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2096 place count 288 transition count 610
Deduced a syphon composed of 154 places in 1 ms
Drop transitions removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 9 with 74 rules applied. Total rules applied 2170 place count 288 transition count 536
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2175 place count 283 transition count 529
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 2180 place count 283 transition count 529
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2183 place count 283 transition count 589
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2186 place count 280 transition count 574
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2189 place count 280 transition count 574
Deduced a syphon composed of 149 places in 1 ms
Applied a total of 2189 rules in 237 ms. Remains 280 /1513 variables (removed 1233) and now considering 574/1937 (removed 1363) transitions.
[2023-03-07 23:03:15] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-07 23:03:15] [INFO ] Flow matrix only has 514 transitions (discarded 60 similar events)
// Phase 1: matrix 514 rows 280 cols
[2023-03-07 23:03:15] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 23:03:15] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/1513 places, 574/1937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 280/1513 places, 574/1937 transitions.
Built C files in :
/tmp/ltsmin14389932463363603526
[2023-03-07 23:03:15] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14389932463363603526
Running compilation step : cd /tmp/ltsmin14389932463363603526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14389932463363603526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14389932463363603526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Applied a total of 0 rules in 47 ms. Remains 1513 /1513 variables (removed 0) and now considering 1937/1937 (removed 0) transitions.
// Phase 1: matrix 1937 rows 1513 cols
[2023-03-07 23:03:19] [INFO ] Computed 4 place invariants in 29 ms
[2023-03-07 23:03:19] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-07 23:03:19] [INFO ] Invariant cache hit.
[2023-03-07 23:03:20] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2023-03-07 23:03:20] [INFO ] Invariant cache hit.
[2023-03-07 23:03:20] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1971 ms. Remains : 1513/1513 places, 1937/1937 transitions.
Built C files in :
/tmp/ltsmin17629177020322130068
[2023-03-07 23:03:20] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17629177020322130068
Running compilation step : cd /tmp/ltsmin17629177020322130068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17629177020322130068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17629177020322130068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-07 23:03:24] [INFO ] Flatten gal took : 64 ms
[2023-03-07 23:03:24] [INFO ] Flatten gal took : 52 ms
[2023-03-07 23:03:24] [INFO ] Time to serialize gal into /tmp/LTL6032213835657606854.gal : 12 ms
[2023-03-07 23:03:24] [INFO ] Time to serialize properties into /tmp/LTL9436419725908195165.prop : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6032213835657606854.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7036484147021993884.hoa' '-atoms' '/tmp/LTL9436419725908195165.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9436419725908195165.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7036484147021993884.hoa
Detected timeout of ITS tools.
[2023-03-07 23:03:39] [INFO ] Flatten gal took : 44 ms
[2023-03-07 23:03:39] [INFO ] Flatten gal took : 40 ms
[2023-03-07 23:03:39] [INFO ] Time to serialize gal into /tmp/LTL18307446408879772075.gal : 7 ms
[2023-03-07 23:03:39] [INFO ] Time to serialize properties into /tmp/LTL7823714260114602969.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18307446408879772075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7823714260114602969.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((p216==0)||(p149==1))"))||(X("((p765==0)||(p529==1))"))))U((X(G((!("((p216==0)||(p149==1))"))||(X("((p765==0)||(p529==1))...300
Formula 0 simplified : X(X("((p216==0)||(p149==1))" & X!"((p765==0)||(p529==1))") R (XF("((p216==0)||(p149==1))" & X!"((p765==0)||(p529==1))") & (X("((p216...265
Detected timeout of ITS tools.
[2023-03-07 23:03:54] [INFO ] Flatten gal took : 37 ms
[2023-03-07 23:03:54] [INFO ] Applying decomposition
[2023-03-07 23:03:54] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8814752308262430152.txt' '-o' '/tmp/graph8814752308262430152.bin' '-w' '/tmp/graph8814752308262430152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8814752308262430152.bin' '-l' '-1' '-v' '-w' '/tmp/graph8814752308262430152.weights' '-q' '0' '-e' '0.001'
[2023-03-07 23:03:54] [INFO ] Decomposing Gal with order
[2023-03-07 23:03:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 23:03:54] [INFO ] Removed a total of 531 redundant transitions.
[2023-03-07 23:03:55] [INFO ] Flatten gal took : 136 ms
[2023-03-07 23:03:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 14 ms.
[2023-03-07 23:03:55] [INFO ] Time to serialize gal into /tmp/LTL2772729635387562353.gal : 18 ms
[2023-03-07 23:03:55] [INFO ] Time to serialize properties into /tmp/LTL7834069992047847687.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2772729635387562353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7834069992047847687.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((i6.u40.p216==0)||(i0.u31.p149==1))"))||(X("((i9.u156.p765==0)||(i5.u98.p529==1))"))))U((X(G((!("((i6.u40.p216==0)||(i0.u...419
Formula 0 simplified : X(X("((i6.u40.p216==0)||(i0.u31.p149==1))" & X!"((i9.u156.p765==0)||(i5.u98.p529==1))") R (XF("((i6.u40.p216==0)||(i0.u31.p149==1))"...384
Reverse transition relation is NOT exact ! Due to transitions t26, t192, t221, t273, t304, t333, t383, t454, t666, t695, t748, t779, t810, t859, t981, t116...1666
Computing Next relation with stutter on 89440 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6337487616631626737
[2023-03-07 23:04:10] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6337487616631626737
Running compilation step : cd /tmp/ltsmin6337487616631626737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6337487616631626737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6337487616631626737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-13 finished in 90095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1529 transition count 1956
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1529 transition count 1956
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1529 transition count 1955
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1522 transition count 1947
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1522 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 1522 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 1519 transition count 1943
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 1519 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 1516 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 1516 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 1514 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 1514 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 1512 transition count 1936
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 1510 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1509 transition count 1931
Applied a total of 64 rules in 446 ms. Remains 1509 /1540 variables (removed 31) and now considering 1931/1967 (removed 36) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2023-03-07 23:04:13] [INFO ] Computed 4 place invariants in 17 ms
[2023-03-07 23:04:13] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-07 23:04:13] [INFO ] Invariant cache hit.
[2023-03-07 23:04:14] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
[2023-03-07 23:04:14] [INFO ] Invariant cache hit.
[2023-03-07 23:04:15] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1540 places, 1931/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2363 ms. Remains : 1509/1540 places, 1931/1967 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-14 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s28 0) (EQ s270 1) (EQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 779 reset in 164 ms.
Entered a terminal (fully accepting) state of product in 6112 steps with 47 reset in 8 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-14 finished in 2677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p0||X(p1))) U ((X((!p0||X(p1)))&&(!p0||G(p2)))||X(G((!p0||X(p1))))))))'
[2023-03-07 23:04:16] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3395270218334975492
[2023-03-07 23:04:16] [INFO ] Too many transitions (1967) to apply POR reductions. Disabling POR matrices.
[2023-03-07 23:04:16] [INFO ] Applying decomposition
[2023-03-07 23:04:16] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3395270218334975492
Running compilation step : cd /tmp/ltsmin3395270218334975492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-07 23:04:16] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17520394332517614540.txt' '-o' '/tmp/graph17520394332517614540.bin' '-w' '/tmp/graph17520394332517614540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17520394332517614540.bin' '-l' '-1' '-v' '-w' '/tmp/graph17520394332517614540.weights' '-q' '0' '-e' '0.001'
[2023-03-07 23:04:16] [INFO ] Decomposing Gal with order
[2023-03-07 23:04:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 23:04:16] [INFO ] Removed a total of 529 redundant transitions.
[2023-03-07 23:04:16] [INFO ] Flatten gal took : 73 ms
[2023-03-07 23:04:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 16 ms.
[2023-03-07 23:04:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality5400110751679673664.gal : 15 ms
[2023-03-07 23:04:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality12434321255632560755.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5400110751679673664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12434321255632560755.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((i6.i0.i2.u51.p216==0)||(i2.u29.p149==1))"))||(X("((i11.u171.p765==0)||(i8.i1.i1.u99.p529==1))"))))U(((X((!("((i6.i0.i2.u...477
Formula 0 simplified : X(X("((i6.i0.i2.u51.p216==0)||(i2.u29.p149==1))" & X!"((i11.u171.p765==0)||(i8.i1.i1.u99.p529==1))") R (XF("((i6.i0.i2.u51.p216==0)|...442
Compilation finished in 3482 ms.
Running link step : cd /tmp/ltsmin3395270218334975492;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3395270218334975492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((!(LTLAPp0==true)||X((LTLAPp1==true)))) U ((X((!(LTLAPp0==true)||X((LTLAPp1==true))))&&(!(LTLAPp0==true)||[]((LTLAPp2==true))))||X([]((!(LTLAPp0==true)||X((LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t26, t192, t273, t304, t333, t383, t454, t695, t748, t810, t859, t981, t1134, t1215, t1246, t...2031
Computing Next relation with stutter on 93680 deadlock states
53 unique states visited
8 strongly connected components in search stack
100 transitions explored
53 items max in DFS search stack
5495 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,55.1197,1550588,1,0,2.80781e+06,4680,22604,7.2791e+06,482,28997,6660063
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 277184 ms.
BK_STOP 1678230403363
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-316"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-316, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814474900123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-316.tgz
mv CloudReconfiguration-PT-316 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;