Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K Apr 29 14:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 14:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 14:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 14:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 912K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652699741715

Running Version 202205111006
[2022-05-16 11:15:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 11:15:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 11:15:44] [INFO ] Load time of PNML (sax parser for PT used): 403 ms
[2022-05-16 11:15:44] [INFO ] Transformed 3554 places.
[2022-05-16 11:15:44] [INFO ] Transformed 4263 transitions.
[2022-05-16 11:15:44] [INFO ] Found NUPN structural information;
[2022-05-16 11:15:44] [INFO ] Parsed PT model containing 3554 places and 4263 transitions in 610 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-401-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 3554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3554/3554 places, 4263/4263 transitions.
Discarding 713 places :
Symmetric choice reduction at 0 with 713 rule applications. Total rules 713 place count 2841 transition count 3550
Iterating global reduction 0 with 713 rules applied. Total rules applied 1426 place count 2841 transition count 3550
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 1463 place count 2841 transition count 3513
Discarding 323 places :
Symmetric choice reduction at 1 with 323 rule applications. Total rules 1786 place count 2518 transition count 3190
Iterating global reduction 1 with 323 rules applied. Total rules applied 2109 place count 2518 transition count 3190
Discarding 122 places :
Symmetric choice reduction at 1 with 122 rule applications. Total rules 2231 place count 2396 transition count 3068
Iterating global reduction 1 with 122 rules applied. Total rules applied 2353 place count 2396 transition count 3068
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 2380 place count 2396 transition count 3041
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 2445 place count 2331 transition count 2976
Iterating global reduction 2 with 65 rules applied. Total rules applied 2510 place count 2331 transition count 2976
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 2521 place count 2331 transition count 2965
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2573 place count 2279 transition count 2906
Iterating global reduction 3 with 52 rules applied. Total rules applied 2625 place count 2279 transition count 2906
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 2664 place count 2240 transition count 2867
Iterating global reduction 3 with 39 rules applied. Total rules applied 2703 place count 2240 transition count 2867
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 2739 place count 2204 transition count 2831
Iterating global reduction 3 with 36 rules applied. Total rules applied 2775 place count 2204 transition count 2831
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 2811 place count 2168 transition count 2795
Iterating global reduction 3 with 36 rules applied. Total rules applied 2847 place count 2168 transition count 2795
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 2878 place count 2137 transition count 2745
Iterating global reduction 3 with 31 rules applied. Total rules applied 2909 place count 2137 transition count 2745
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 2918 place count 2128 transition count 2731
Iterating global reduction 3 with 9 rules applied. Total rules applied 2927 place count 2128 transition count 2731
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 2936 place count 2119 transition count 2720
Iterating global reduction 3 with 9 rules applied. Total rules applied 2945 place count 2119 transition count 2720
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2948 place count 2119 transition count 2717
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2950 place count 2117 transition count 2715
Iterating global reduction 4 with 2 rules applied. Total rules applied 2952 place count 2117 transition count 2715
Applied a total of 2952 rules in 3456 ms. Remains 2117 /3554 variables (removed 1437) and now considering 2715/4263 (removed 1548) transitions.
// Phase 1: matrix 2715 rows 2117 cols
[2022-05-16 11:15:48] [INFO ] Computed 5 place invariants in 61 ms
[2022-05-16 11:15:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:15:49] [INFO ] Implicit Places using invariants in 1281 ms returned []
// Phase 1: matrix 2715 rows 2117 cols
[2022-05-16 11:15:49] [INFO ] Computed 5 place invariants in 30 ms
[2022-05-16 11:15:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:15:50] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
// Phase 1: matrix 2715 rows 2117 cols
[2022-05-16 11:15:50] [INFO ] Computed 5 place invariants in 15 ms
[2022-05-16 11:15:53] [INFO ] Dead Transitions using invariants and state equation in 3129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2117/3554 places, 2715/4263 transitions.
Finished structural reductions, in 1 iterations. Remains : 2117/3554 places, 2715/4263 transitions.
Support contains 39 out of 2117 places after structural reductions.
[2022-05-16 11:15:54] [INFO ] Flatten gal took : 410 ms
[2022-05-16 11:15:54] [INFO ] Flatten gal took : 183 ms
[2022-05-16 11:15:54] [INFO ] Input system was already deterministic with 2715 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 883 ms. (steps per millisecond=11 ) properties (out of 38) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
// Phase 1: matrix 2715 rows 2117 cols
[2022-05-16 11:15:56] [INFO ] Computed 5 place invariants in 24 ms
[2022-05-16 11:15:59] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 31 ms returned sat
[2022-05-16 11:16:02] [INFO ] After 2951ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:29
[2022-05-16 11:16:03] [INFO ] After 3680ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:31
[2022-05-16 11:16:03] [INFO ] After 7161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2022-05-16 11:16:05] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 26 ms returned sat
[2022-05-16 11:16:13] [INFO ] After 5839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2022-05-16 11:16:19] [INFO ] After 11412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 3108 ms.
[2022-05-16 11:16:22] [INFO ] After 18598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Fused 31 Parikh solutions to 28 different solutions.
Parikh walk visited 22 properties in 874 ms.
Support contains 9 out of 2117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Graph (trivial) has 2581 edges and 2117 vertex of which 954 / 2117 are part of one of the 87 SCC in 14 ms
Free SCC test removed 867 places
Drop transitions removed 1102 transitions
Reduce isomorphic transitions removed 1102 transitions.
Graph (complete) has 1846 edges and 1250 vertex of which 1239 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.10 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 693 transitions
Trivial Post-agglo rules discarded 693 transitions
Performed 693 trivial Post agglomeration. Transition count delta: 693
Iterating post reduction 0 with 702 rules applied. Total rules applied 704 place count 1239 transition count 906
Reduce places removed 693 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 1 with 777 rules applied. Total rules applied 1481 place count 546 transition count 822
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 1535 place count 492 transition count 822
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 1535 place count 492 transition count 754
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 1671 place count 424 transition count 754
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1685 place count 410 transition count 733
Iterating global reduction 3 with 14 rules applied. Total rules applied 1699 place count 410 transition count 733
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 1703 place count 410 transition count 729
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1707 place count 406 transition count 729
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1715 place count 398 transition count 719
Iterating global reduction 5 with 8 rules applied. Total rules applied 1723 place count 398 transition count 719
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1728 place count 398 transition count 714
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1730 place count 396 transition count 706
Iterating global reduction 6 with 2 rules applied. Total rules applied 1732 place count 396 transition count 706
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1733 place count 395 transition count 704
Iterating global reduction 6 with 1 rules applied. Total rules applied 1734 place count 395 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1735 place count 395 transition count 703
Performed 201 Post agglomeration using F-continuation condition with reduction of 134 identical transitions.
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 7 with 402 rules applied. Total rules applied 2137 place count 194 transition count 368
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 2156 place count 194 transition count 349
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2161 place count 189 transition count 344
Iterating global reduction 8 with 5 rules applied. Total rules applied 2166 place count 189 transition count 344
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2167 place count 188 transition count 343
Iterating global reduction 8 with 1 rules applied. Total rules applied 2168 place count 188 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2169 place count 188 transition count 342
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 2201 place count 172 transition count 322
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 2219 place count 172 transition count 304
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 10 with 2 rules applied. Total rules applied 2221 place count 171 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2223 place count 171 transition count 301
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 11 with 2 rules applied. Total rules applied 2225 place count 170 transition count 300
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2227 place count 170 transition count 298
Performed 50 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 12 with 100 rules applied. Total rules applied 2327 place count 120 transition count 345
Drop transitions removed 22 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 12 with 61 rules applied. Total rules applied 2388 place count 120 transition count 284
Discarding 30 places :
Symmetric choice reduction at 13 with 30 rule applications. Total rules 2418 place count 90 transition count 240
Iterating global reduction 13 with 30 rules applied. Total rules applied 2448 place count 90 transition count 240
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 13 with 18 rules applied. Total rules applied 2466 place count 90 transition count 222
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 2474 place count 82 transition count 206
Iterating global reduction 14 with 8 rules applied. Total rules applied 2482 place count 82 transition count 206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 2490 place count 82 transition count 198
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 15 with 23 rules applied. Total rules applied 2513 place count 82 transition count 175
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2515 place count 80 transition count 169
Iterating global reduction 15 with 2 rules applied. Total rules applied 2517 place count 80 transition count 169
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2519 place count 78 transition count 167
Iterating global reduction 15 with 2 rules applied. Total rules applied 2521 place count 78 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 2523 place count 78 transition count 165
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 16 with 2 rules applied. Total rules applied 2525 place count 77 transition count 164
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 2527 place count 77 transition count 162
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 2534 place count 77 transition count 155
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 2543 place count 70 transition count 153
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2544 place count 70 transition count 152
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 2549 place count 70 transition count 152
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2550 place count 70 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 2551 place count 69 transition count 150
Applied a total of 2551 rules in 388 ms. Remains 69 /2117 variables (removed 2048) and now considering 150/2715 (removed 2565) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/2117 places, 150/2715 transitions.
Finished random walk after 214 steps, including 2 resets, run visited all 9 properties in 10 ms. (steps per millisecond=21 )
FORMULA CloudReconfiguration-PT-401-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CloudReconfiguration-PT-401-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 35 stabilizing places and 38 stable transitions
Graph (complete) has 2952 edges and 2117 vertex of which 2106 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.39 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||p1))))'
Support contains 2 out of 2117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Graph (trivial) has 2595 edges and 2117 vertex of which 989 / 2117 are part of one of the 88 SCC in 6 ms
Free SCC test removed 901 places
Ensure Unique test removed 1054 transitions
Reduce isomorphic transitions removed 1054 transitions.
Graph (complete) has 1891 edges and 1216 vertex of which 1205 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 659 transitions
Trivial Post-agglo rules discarded 659 transitions
Performed 659 trivial Post agglomeration. Transition count delta: 659
Iterating post reduction 0 with 659 rules applied. Total rules applied 661 place count 1204 transition count 995
Reduce places removed 659 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 692 rules applied. Total rules applied 1353 place count 545 transition count 962
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 1369 place count 530 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1370 place count 529 transition count 961
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 1370 place count 529 transition count 897
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 1498 place count 465 transition count 897
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1522 place count 441 transition count 859
Iterating global reduction 4 with 24 rules applied. Total rules applied 1546 place count 441 transition count 859
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 1550 place count 441 transition count 855
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1554 place count 437 transition count 855
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1568 place count 423 transition count 835
Iterating global reduction 6 with 14 rules applied. Total rules applied 1582 place count 423 transition count 835
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1589 place count 423 transition count 828
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1592 place count 420 transition count 822
Iterating global reduction 7 with 3 rules applied. Total rules applied 1595 place count 420 transition count 822
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1598 place count 417 transition count 816
Iterating global reduction 7 with 3 rules applied. Total rules applied 1601 place count 417 transition count 816
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1602 place count 417 transition count 815
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1604 place count 415 transition count 811
Iterating global reduction 8 with 2 rules applied. Total rules applied 1606 place count 415 transition count 811
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1608 place count 413 transition count 807
Iterating global reduction 8 with 2 rules applied. Total rules applied 1610 place count 413 transition count 807
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1612 place count 411 transition count 803
Iterating global reduction 8 with 2 rules applied. Total rules applied 1614 place count 411 transition count 803
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1616 place count 409 transition count 799
Iterating global reduction 8 with 2 rules applied. Total rules applied 1618 place count 409 transition count 799
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1620 place count 407 transition count 795
Iterating global reduction 8 with 2 rules applied. Total rules applied 1622 place count 407 transition count 795
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1624 place count 405 transition count 781
Iterating global reduction 8 with 2 rules applied. Total rules applied 1626 place count 405 transition count 781
Performed 185 Post agglomeration using F-continuation condition with reduction of 107 identical transitions.
Deduced a syphon composed of 185 places in 1 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 8 with 370 rules applied. Total rules applied 1996 place count 220 transition count 489
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 2008 place count 220 transition count 477
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2015 place count 213 transition count 468
Iterating global reduction 9 with 7 rules applied. Total rules applied 2022 place count 213 transition count 468
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2024 place count 211 transition count 465
Iterating global reduction 9 with 2 rules applied. Total rules applied 2026 place count 211 transition count 465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2027 place count 211 transition count 464
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2028 place count 210 transition count 462
Iterating global reduction 10 with 1 rules applied. Total rules applied 2029 place count 210 transition count 462
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2030 place count 209 transition count 460
Iterating global reduction 10 with 1 rules applied. Total rules applied 2031 place count 209 transition count 460
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2032 place count 208 transition count 458
Iterating global reduction 10 with 1 rules applied. Total rules applied 2033 place count 208 transition count 458
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2034 place count 207 transition count 456
Iterating global reduction 10 with 1 rules applied. Total rules applied 2035 place count 207 transition count 456
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2036 place count 206 transition count 454
Iterating global reduction 10 with 1 rules applied. Total rules applied 2037 place count 206 transition count 454
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2038 place count 205 transition count 447
Iterating global reduction 10 with 1 rules applied. Total rules applied 2039 place count 205 transition count 447
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
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 2073 place count 188 transition count 426
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 2090 place count 188 transition count 409
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 11 with 46 rules applied. Total rules applied 2136 place count 165 transition count 456
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 11 with 22 rules applied. Total rules applied 2158 place count 165 transition count 434
Discarding 12 places :
Symmetric choice reduction at 12 with 12 rule applications. Total rules 2170 place count 153 transition count 410
Iterating global reduction 12 with 12 rules applied. Total rules applied 2182 place count 153 transition count 410
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 2190 place count 153 transition count 402
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 13 with 51 rules applied. Total rules applied 2241 place count 153 transition count 351
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 2245 place count 153 transition count 351
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2246 place count 153 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2247 place count 152 transition count 349
Applied a total of 2247 rules in 278 ms. Remains 152 /2117 variables (removed 1965) and now considering 349/2715 (removed 2366) transitions.
[2022-05-16 11:16:24] [INFO ] Flow matrix only has 272 transitions (discarded 77 similar events)
// Phase 1: matrix 272 rows 152 cols
[2022-05-16 11:16:24] [INFO ] Computed 0 place invariants in 11 ms
[2022-05-16 11:16:24] [INFO ] Implicit Places using invariants in 106 ms returned []
[2022-05-16 11:16:24] [INFO ] Flow matrix only has 272 transitions (discarded 77 similar events)
// Phase 1: matrix 272 rows 152 cols
[2022-05-16 11:16:24] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-16 11:16:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 11:16:24] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [10, 78, 113]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 379 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/2117 places, 349/2715 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 147 transition count 347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 146 transition count 346
Applied a total of 3 rules in 18 ms. Remains 146 /149 variables (removed 3) and now considering 346/349 (removed 3) transitions.
[2022-05-16 11:16:24] [INFO ] Flow matrix only has 269 transitions (discarded 77 similar events)
// Phase 1: matrix 269 rows 146 cols
[2022-05-16 11:16:24] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:16:24] [INFO ] Implicit Places using invariants in 73 ms returned []
[2022-05-16 11:16:24] [INFO ] Flow matrix only has 269 transitions (discarded 77 similar events)
// Phase 1: matrix 269 rows 146 cols
[2022-05-16 11:16:24] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:16:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 11:16:24] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 146/2117 places, 346/2715 transitions.
Finished structural reductions, in 2 iterations. Remains : 146/2117 places, 346/2715 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s106 1), p0:(EQ s74 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-00 finished in 1248 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(F(p1))||(F(p0)&&(G(p2)||p2)))))'
Support contains 3 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2096 transition count 2693
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2096 transition count 2693
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 2096 transition count 2691
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 2086 transition count 2679
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 2086 transition count 2679
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 2079 transition count 2670
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 2079 transition count 2670
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 2079 transition count 2668
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 2076 transition count 2664
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 2076 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 2075 transition count 2663
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 2075 transition count 2663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 2075 transition count 2662
Applied a total of 89 rules in 685 ms. Remains 2075 /2117 variables (removed 42) and now considering 2662/2715 (removed 53) transitions.
// Phase 1: matrix 2662 rows 2075 cols
[2022-05-16 11:16:25] [INFO ] Computed 5 place invariants in 21 ms
[2022-05-16 11:16:26] [INFO ] Implicit Places using invariants in 497 ms returned []
// Phase 1: matrix 2662 rows 2075 cols
[2022-05-16 11:16:26] [INFO ] Computed 5 place invariants in 16 ms
[2022-05-16 11:16:27] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
// Phase 1: matrix 2662 rows 2075 cols
[2022-05-16 11:16:27] [INFO ] Computed 5 place invariants in 17 ms
[2022-05-16 11:16:30] [INFO ] Dead Transitions using invariants and state equation in 3056 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2075/2117 places, 2662/2715 transitions.
Finished structural reductions, in 1 iterations. Remains : 2075/2117 places, 2662/2715 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s536 1), p0:(EQ s701 1), p1:(EQ s1022 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 186 steps with 0 reset in 4 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-01 finished in 5394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(!(!(!G(p0)&&p1)&&X(p1))))) U p1))'
Support contains 2 out of 2117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Graph (trivial) has 2595 edges and 2117 vertex of which 989 / 2117 are part of one of the 88 SCC in 9 ms
Free SCC test removed 901 places
Ensure Unique test removed 1054 transitions
Reduce isomorphic transitions removed 1054 transitions.
Graph (complete) has 1891 edges and 1216 vertex of which 1205 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 659 transitions
Trivial Post-agglo rules discarded 659 transitions
Performed 659 trivial Post agglomeration. Transition count delta: 659
Iterating post reduction 0 with 659 rules applied. Total rules applied 661 place count 1204 transition count 995
Reduce places removed 659 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 692 rules applied. Total rules applied 1353 place count 545 transition count 962
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 1369 place count 530 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1370 place count 529 transition count 961
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 1370 place count 529 transition count 897
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 1498 place count 465 transition count 897
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1522 place count 441 transition count 859
Iterating global reduction 4 with 24 rules applied. Total rules applied 1546 place count 441 transition count 859
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 1550 place count 441 transition count 855
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1554 place count 437 transition count 855
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1568 place count 423 transition count 835
Iterating global reduction 6 with 14 rules applied. Total rules applied 1582 place count 423 transition count 835
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1589 place count 423 transition count 828
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1592 place count 420 transition count 822
Iterating global reduction 7 with 3 rules applied. Total rules applied 1595 place count 420 transition count 822
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1598 place count 417 transition count 816
Iterating global reduction 7 with 3 rules applied. Total rules applied 1601 place count 417 transition count 816
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1602 place count 417 transition count 815
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1604 place count 415 transition count 811
Iterating global reduction 8 with 2 rules applied. Total rules applied 1606 place count 415 transition count 811
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1608 place count 413 transition count 807
Iterating global reduction 8 with 2 rules applied. Total rules applied 1610 place count 413 transition count 807
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1612 place count 411 transition count 803
Iterating global reduction 8 with 2 rules applied. Total rules applied 1614 place count 411 transition count 803
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1616 place count 409 transition count 799
Iterating global reduction 8 with 2 rules applied. Total rules applied 1618 place count 409 transition count 799
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1620 place count 407 transition count 795
Iterating global reduction 8 with 2 rules applied. Total rules applied 1622 place count 407 transition count 795
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1624 place count 405 transition count 781
Iterating global reduction 8 with 2 rules applied. Total rules applied 1626 place count 405 transition count 781
Performed 186 Post agglomeration using F-continuation condition with reduction of 110 identical transitions.
Deduced a syphon composed of 186 places in 0 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 8 with 372 rules applied. Total rules applied 1998 place count 219 transition count 485
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 2010 place count 219 transition count 473
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2017 place count 212 transition count 464
Iterating global reduction 9 with 7 rules applied. Total rules applied 2024 place count 212 transition count 464
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2026 place count 210 transition count 461
Iterating global reduction 9 with 2 rules applied. Total rules applied 2028 place count 210 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2029 place count 210 transition count 460
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2030 place count 209 transition count 458
Iterating global reduction 10 with 1 rules applied. Total rules applied 2031 place count 209 transition count 458
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2032 place count 208 transition count 456
Iterating global reduction 10 with 1 rules applied. Total rules applied 2033 place count 208 transition count 456
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2034 place count 207 transition count 454
Iterating global reduction 10 with 1 rules applied. Total rules applied 2035 place count 207 transition count 454
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2036 place count 206 transition count 452
Iterating global reduction 10 with 1 rules applied. Total rules applied 2037 place count 206 transition count 452
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2038 place count 205 transition count 450
Iterating global reduction 10 with 1 rules applied. Total rules applied 2039 place count 205 transition count 450
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2040 place count 204 transition count 443
Iterating global reduction 10 with 1 rules applied. Total rules applied 2041 place count 204 transition count 443
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
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 2075 place count 187 transition count 422
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 2092 place count 187 transition count 405
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 11 with 44 rules applied. Total rules applied 2136 place count 165 transition count 452
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 2157 place count 165 transition count 431
Discarding 11 places :
Symmetric choice reduction at 12 with 11 rule applications. Total rules 2168 place count 154 transition count 409
Iterating global reduction 12 with 11 rules applied. Total rules applied 2179 place count 154 transition count 409
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 2186 place count 154 transition count 402
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 13 with 50 rules applied. Total rules applied 2236 place count 154 transition count 352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2237 place count 153 transition count 351
Applied a total of 2237 rules in 328 ms. Remains 153 /2117 variables (removed 1964) and now considering 351/2715 (removed 2364) transitions.
[2022-05-16 11:16:30] [INFO ] Flow matrix only has 274 transitions (discarded 77 similar events)
// Phase 1: matrix 274 rows 153 cols
[2022-05-16 11:16:31] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 11:16:31] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-05-16 11:16:31] [INFO ] Flow matrix only has 274 transitions (discarded 77 similar events)
// Phase 1: matrix 274 rows 153 cols
[2022-05-16 11:16:31] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:16:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 11:16:31] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [10, 81, 114]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 376 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/2117 places, 351/2715 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 349
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 147 transition count 348
Applied a total of 3 rules in 12 ms. Remains 147 /150 variables (removed 3) and now considering 348/351 (removed 3) transitions.
[2022-05-16 11:16:31] [INFO ] Flow matrix only has 271 transitions (discarded 77 similar events)
// Phase 1: matrix 271 rows 147 cols
[2022-05-16 11:16:31] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:16:31] [INFO ] Implicit Places using invariants in 121 ms returned []
[2022-05-16 11:16:31] [INFO ] Flow matrix only has 271 transitions (discarded 77 similar events)
// Phase 1: matrix 271 rows 147 cols
[2022-05-16 11:16:31] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 11:16:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 11:16:31] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 147/2117 places, 348/2715 transitions.
Finished structural reductions, in 2 iterations. Remains : 147/2117 places, 348/2715 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (AND p1 p0), (AND p1 p0), (AND p1 p0), false]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s43 1), p0:(EQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-02 finished in 1318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(p0))))'
Support contains 3 out of 2117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Graph (trivial) has 2591 edges and 2117 vertex of which 987 / 2117 are part of one of the 88 SCC in 3 ms
Free SCC test removed 899 places
Ensure Unique test removed 1051 transitions
Reduce isomorphic transitions removed 1051 transitions.
Graph (complete) has 1894 edges and 1218 vertex of which 1207 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 659 transitions
Trivial Post-agglo rules discarded 659 transitions
Performed 659 trivial Post agglomeration. Transition count delta: 659
Iterating post reduction 0 with 659 rules applied. Total rules applied 661 place count 1206 transition count 998
Reduce places removed 659 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 691 rules applied. Total rules applied 1352 place count 547 transition count 966
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 17 rules applied. Total rules applied 1369 place count 532 transition count 964
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1371 place count 530 transition count 964
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 1371 place count 530 transition count 900
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 1499 place count 466 transition count 900
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1523 place count 442 transition count 862
Iterating global reduction 4 with 24 rules applied. Total rules applied 1547 place count 442 transition count 862
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 5 rules applied. Total rules applied 1552 place count 442 transition count 857
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1556 place count 438 transition count 857
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1570 place count 424 transition count 837
Iterating global reduction 6 with 14 rules applied. Total rules applied 1584 place count 424 transition count 837
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1591 place count 424 transition count 830
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1594 place count 421 transition count 824
Iterating global reduction 7 with 3 rules applied. Total rules applied 1597 place count 421 transition count 824
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1600 place count 418 transition count 818
Iterating global reduction 7 with 3 rules applied. Total rules applied 1603 place count 418 transition count 818
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1604 place count 418 transition count 817
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1606 place count 416 transition count 813
Iterating global reduction 8 with 2 rules applied. Total rules applied 1608 place count 416 transition count 813
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1610 place count 414 transition count 809
Iterating global reduction 8 with 2 rules applied. Total rules applied 1612 place count 414 transition count 809
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1614 place count 412 transition count 805
Iterating global reduction 8 with 2 rules applied. Total rules applied 1616 place count 412 transition count 805
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1618 place count 410 transition count 801
Iterating global reduction 8 with 2 rules applied. Total rules applied 1620 place count 410 transition count 801
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1622 place count 408 transition count 797
Iterating global reduction 8 with 2 rules applied. Total rules applied 1624 place count 408 transition count 797
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1626 place count 406 transition count 783
Iterating global reduction 8 with 2 rules applied. Total rules applied 1628 place count 406 transition count 783
Performed 185 Post agglomeration using F-continuation condition with reduction of 110 identical transitions.
Deduced a syphon composed of 185 places in 1 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 8 with 370 rules applied. Total rules applied 1998 place count 221 transition count 488
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 2010 place count 221 transition count 476
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2017 place count 214 transition count 467
Iterating global reduction 9 with 7 rules applied. Total rules applied 2024 place count 214 transition count 467
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2026 place count 212 transition count 464
Iterating global reduction 9 with 2 rules applied. Total rules applied 2028 place count 212 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2029 place count 212 transition count 463
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2030 place count 211 transition count 461
Iterating global reduction 10 with 1 rules applied. Total rules applied 2031 place count 211 transition count 461
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2032 place count 210 transition count 459
Iterating global reduction 10 with 1 rules applied. Total rules applied 2033 place count 210 transition count 459
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 2065 place count 194 transition count 439
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 2081 place count 194 transition count 423
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2082 place count 193 transition count 421
Iterating global reduction 11 with 1 rules applied. Total rules applied 2083 place count 193 transition count 421
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 11 with 48 rules applied. Total rules applied 2131 place count 169 transition count 476
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 11 with 28 rules applied. Total rules applied 2159 place count 169 transition count 448
Discarding 12 places :
Symmetric choice reduction at 12 with 12 rule applications. Total rules 2171 place count 157 transition count 424
Iterating global reduction 12 with 12 rules applied. Total rules applied 2183 place count 157 transition count 424
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 2191 place count 157 transition count 416
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 13 with 56 rules applied. Total rules applied 2247 place count 157 transition count 360
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2248 place count 156 transition count 359
Applied a total of 2248 rules in 169 ms. Remains 156 /2117 variables (removed 1961) and now considering 359/2715 (removed 2356) transitions.
[2022-05-16 11:16:32] [INFO ] Flow matrix only has 281 transitions (discarded 78 similar events)
// Phase 1: matrix 281 rows 156 cols
[2022-05-16 11:16:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:16:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2022-05-16 11:16:32] [INFO ] Flow matrix only has 281 transitions (discarded 78 similar events)
// Phase 1: matrix 281 rows 156 cols
[2022-05-16 11:16:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:16:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 11:16:32] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [14, 80, 115]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 310 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/2117 places, 359/2715 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 357
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 356
Applied a total of 3 rules in 16 ms. Remains 150 /153 variables (removed 3) and now considering 356/359 (removed 3) transitions.
[2022-05-16 11:16:32] [INFO ] Flow matrix only has 278 transitions (discarded 78 similar events)
// Phase 1: matrix 278 rows 150 cols
[2022-05-16 11:16:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:16:32] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-05-16 11:16:32] [INFO ] Flow matrix only has 278 transitions (discarded 78 similar events)
// Phase 1: matrix 278 rows 150 cols
[2022-05-16 11:16:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:16:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 11:16:32] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/2117 places, 356/2715 transitions.
Finished structural reductions, in 2 iterations. Remains : 150/2117 places, 356/2715 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s145 0) (EQ s10 1) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-03 finished in 890 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U G((X(!X(p1))||(p0 U G(p2))))))'
Support contains 3 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2097 transition count 2695
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2097 transition count 2695
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 2097 transition count 2693
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 2088 transition count 2683
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 2088 transition count 2683
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 2082 transition count 2675
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 2082 transition count 2675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 74 place count 2082 transition count 2673
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 2079 transition count 2669
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 2079 transition count 2669
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 2078 transition count 2668
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 2078 transition count 2668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 2078 transition count 2667
Applied a total of 83 rules in 696 ms. Remains 2078 /2117 variables (removed 39) and now considering 2667/2715 (removed 48) transitions.
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:16:33] [INFO ] Computed 5 place invariants in 20 ms
[2022-05-16 11:16:34] [INFO ] Implicit Places using invariants in 500 ms returned []
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:16:34] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-16 11:16:35] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:16:35] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-16 11:16:37] [INFO ] Dead Transitions using invariants and state equation in 2821 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2078/2117 places, 2667/2715 transitions.
Finished structural reductions, in 1 iterations. Remains : 2078/2117 places, 2667/2715 transitions.
Stuttering acceptance computed with spot in 1170 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), false, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p2 p0), acceptance={1} source=0 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 6}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 12}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=3 dest: 13}, { cond=(OR p0 p1), acceptance={0} source=3 dest: 14}, { cond=(AND p2 p0), acceptance={1} source=3 dest: 15}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=3 dest: 15}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 16}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=3 dest: 17}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 18}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=5 dest: 13}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=5 dest: 14}, { cond=(AND p2 p0), acceptance={1} source=5 dest: 15}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=5 dest: 15}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 16}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=5 dest: 17}, { cond=(AND p2 p0), acceptance={} source=5 dest: 19}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 19}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=5 dest: 20}], [{ cond=(NOT p2), acceptance={} source=6 dest: 8}, { cond=p2, acceptance={} source=6 dest: 18}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=7 dest: 13}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=7 dest: 14}, { cond=(AND p2 p0), acceptance={1} source=7 dest: 15}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=7 dest: 15}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 16}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=7 dest: 17}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=7 dest: 20}], [{ cond=p1, acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={0, 1} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 18}, { cond=p0, acceptance={} source=10 dest: 21}], [{ cond=p1, acceptance={} source=11 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=12 dest: 1}, { cond=p1, acceptance={} source=12 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=12 dest: 6}, { cond=(AND p0 p1), acceptance={} source=12 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=13 dest: 13}, { cond=p1, acceptance={0} source=13 dest: 14}, { cond=(AND p2 p0 p1), acceptance={1} source=13 dest: 15}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=13 dest: 15}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=13 dest: 17}], [{ cond=p1, acceptance={0} source=14 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=14 dest: 3}, { cond=(AND p2 p0 p1), acceptance={1} source=14 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=14 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=14 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=15 dest: 13}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=15 dest: 14}, { cond=(AND p2 p0 p1), acceptance={1} source=15 dest: 15}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=15 dest: 15}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=15 dest: 17}, { cond=(AND p2 p0 p1), acceptance={} source=15 dest: 19}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=15 dest: 19}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=15 dest: 20}], [{ cond=(AND (NOT p2) p1), acceptance={} source=16 dest: 8}, { cond=(AND p2 p1), acceptance={} source=16 dest: 18}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=17 dest: 13}, { cond=(AND (NOT p2) p1), acceptance={0} source=17 dest: 14}, { cond=(AND p2 p0 p1), acceptance={1} source=17 dest: 15}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=17 dest: 15}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=17 dest: 17}, { cond=(AND p2 p1), acceptance={} source=17 dest: 20}], [{ cond=(AND (NOT p2) p1), acceptance={} source=18 dest: 9}, { cond=(AND p2 p1), acceptance={} source=18 dest: 22}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=19 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=19 dest: 3}, { cond=(AND p2 p0 p1), acceptance={1} source=19 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=19 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=19 dest: 7}, { cond=(AND p2 p0 p1), acceptance={} source=19 dest: 23}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=19 dest: 23}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=19 dest: 24}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=20 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=20 dest: 3}, { cond=(AND p2 p0 p1), acceptance={1} source=20 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=20 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=20 dest: 7}, { cond=(AND p2 p1), acceptance={} source=20 dest: 24}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=21 dest: 9}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=21 dest: 22}, { cond=(AND p0 p1), acceptance={} source=21 dest: 25}], [{ cond=(NOT p2), acceptance={} source=22 dest: 9}, { cond=p2, acceptance={} source=22 dest: 22}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=23 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=23 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=23 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=23 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=23 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=23 dest: 6}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=23 dest: 23}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=23 dest: 23}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=24 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=24 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=24 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=24 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=24 dest: 4}, { cond=(AND p2 p0), acceptance={1} source=24 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=24 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=24 dest: 6}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=24 dest: 7}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=24 dest: 24}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=25 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={} source=25 dest: 22}, { cond=(AND p2 p0), acceptance={1} source=25 dest: 25}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=25 dest: 25}]], initial=0, aps=[p0:(EQ s983 1), p1:(EQ s1881 1), p2:(EQ s802 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, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25134 reset in 920 ms.
Product exploration explored 100000 steps with 24939 reset in 895 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2902 edges and 2078 vertex of which 2067 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.15 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (OR p0 p1))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), true, (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 38 factoid took 7510 ms. Reduced automaton from 26 states, 125 edges and 3 AP to 11 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 524 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 59 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 106145 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106145 steps, saw 27658 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:16:53] [INFO ] Computed 5 place invariants in 17 ms
[2022-05-16 11:16:54] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 24 ms returned sat
[2022-05-16 11:16:57] [INFO ] After 2211ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2022-05-16 11:16:57] [INFO ] After 2438ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-16 11:16:57] [INFO ] After 3980ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-16 11:16:58] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 22 ms returned sat
[2022-05-16 11:17:02] [INFO ] After 3324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-16 11:17:05] [INFO ] After 6189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1546 ms.
[2022-05-16 11:17:07] [INFO ] After 9168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 7 different solutions.
Finished Parikh walk after 228 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=114 )
Parikh walk visited 12 properties in 27 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (OR p0 p1))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), true, (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 p1)), (F p1), (F p2), (F (AND p2 p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 38 factoid took 2990 ms. Reduced automaton from 11 states, 24 edges and 3 AP to 11 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 528 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 518 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Support contains 3 out of 2078 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2078/2078 places, 2667/2667 transitions.
Applied a total of 0 rules in 183 ms. Remains 2078 /2078 variables (removed 0) and now considering 2667/2667 (removed 0) transitions.
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:17:11] [INFO ] Computed 5 place invariants in 14 ms
[2022-05-16 11:17:11] [INFO ] Implicit Places using invariants in 537 ms returned []
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:17:11] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-16 11:17:12] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:17:12] [INFO ] Computed 5 place invariants in 21 ms
[2022-05-16 11:17:15] [INFO ] Dead Transitions using invariants and state equation in 2136 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2078/2078 places, 2667/2667 transitions.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2902 edges and 2078 vertex of which 2067 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.11 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 488 ms. Reduced automaton from 11 states, 24 edges and 3 AP to 11 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 510 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 53 resets, run finished after 685 ms. (steps per millisecond=14 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 110396 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110396 steps, saw 29148 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:17:20] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-16 11:17:21] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 24 ms returned sat
[2022-05-16 11:17:25] [INFO ] After 4572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-16 11:17:26] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 27 ms returned sat
[2022-05-16 11:17:30] [INFO ] After 3198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-16 11:17:33] [INFO ] After 6388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1629 ms.
[2022-05-16 11:17:35] [INFO ] After 9742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 9 properties in 113 ms.
Support contains 3 out of 2078 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2078/2078 places, 2667/2667 transitions.
Graph (trivial) has 2545 edges and 2078 vertex of which 975 / 2078 are part of one of the 88 SCC in 2 ms
Free SCC test removed 887 places
Drop transitions removed 1127 transitions
Reduce isomorphic transitions removed 1127 transitions.
Graph (complete) has 1768 edges and 1191 vertex of which 1180 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 665 transitions
Trivial Post-agglo rules discarded 665 transitions
Performed 665 trivial Post agglomeration. Transition count delta: 665
Iterating post reduction 0 with 674 rules applied. Total rules applied 676 place count 1180 transition count 861
Reduce places removed 665 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 757 rules applied. Total rules applied 1433 place count 515 transition count 769
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 61 rules applied. Total rules applied 1494 place count 455 transition count 768
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1495 place count 454 transition count 768
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 1495 place count 454 transition count 703
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 1625 place count 389 transition count 703
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1640 place count 374 transition count 681
Iterating global reduction 4 with 15 rules applied. Total rules applied 1655 place count 374 transition count 681
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 1659 place count 374 transition count 677
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1663 place count 370 transition count 677
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1674 place count 359 transition count 663
Iterating global reduction 6 with 11 rules applied. Total rules applied 1685 place count 359 transition count 663
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1693 place count 359 transition count 655
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1696 place count 356 transition count 637
Iterating global reduction 7 with 3 rules applied. Total rules applied 1699 place count 356 transition count 637
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1700 place count 356 transition count 636
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1701 place count 355 transition count 636
Performed 188 Post agglomeration using F-continuation condition with reduction of 131 identical transitions.
Deduced a syphon composed of 188 places in 1 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 9 with 376 rules applied. Total rules applied 2077 place count 167 transition count 317
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 9 with 14 rules applied. Total rules applied 2091 place count 167 transition count 303
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2093 place count 166 transition count 302
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2097 place count 162 transition count 298
Iterating global reduction 11 with 4 rules applied. Total rules applied 2101 place count 162 transition count 298
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 32 rules applied. Total rules applied 2133 place count 146 transition count 278
Drop transitions removed 4 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 2151 place count 146 transition count 260
Performed 44 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 12 with 88 rules applied. Total rules applied 2239 place count 102 transition count 302
Drop transitions removed 43 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 12 with 74 rules applied. Total rules applied 2313 place count 102 transition count 228
Discarding 32 places :
Symmetric choice reduction at 13 with 32 rule applications. Total rules 2345 place count 70 transition count 195
Iterating global reduction 13 with 32 rules applied. Total rules applied 2377 place count 70 transition count 195
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 2397 place count 70 transition count 175
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 2403 place count 64 transition count 163
Iterating global reduction 14 with 6 rules applied. Total rules applied 2409 place count 64 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2415 place count 64 transition count 157
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 15 with 41 rules applied. Total rules applied 2456 place count 64 transition count 116
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 2460 place count 60 transition count 104
Iterating global reduction 15 with 4 rules applied. Total rules applied 2464 place count 60 transition count 104
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 2468 place count 56 transition count 100
Iterating global reduction 15 with 4 rules applied. Total rules applied 2472 place count 56 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 2476 place count 56 transition count 96
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 16 with 4 rules applied. Total rules applied 2480 place count 56 transition count 92
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2484 place count 56 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 2488 place count 52 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2489 place count 52 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 2490 place count 51 transition count 87
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 51 edges and 50 vertex of which 34 / 50 are part of one of the 12 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 2492 place count 28 transition count 87
Drop transitions removed 36 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 18 with 47 rules applied. Total rules applied 2539 place count 28 transition count 40
Discarding 4 places :
Symmetric choice reduction at 19 with 4 rule applications. Total rules 2543 place count 24 transition count 36
Iterating global reduction 19 with 4 rules applied. Total rules applied 2547 place count 24 transition count 36
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2555 place count 20 transition count 32
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 19 with 9 rules applied. Total rules applied 2564 place count 20 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 2565 place count 20 transition count 22
Free-agglomeration rule applied 3 times.
Iterating global reduction 20 with 3 rules applied. Total rules applied 2568 place count 20 transition count 19
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 2571 place count 17 transition count 19
Applied a total of 2571 rules in 103 ms. Remains 17 /2078 variables (removed 2061) and now considering 19/2667 (removed 2648) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/2078 places, 19/2667 transitions.
Finished random walk after 388 steps, including 20 resets, run visited all 3 properties in 2 ms. (steps per millisecond=194 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p2 p1 (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (AND p1 p0)), (F p1), (F p2), (F (AND p2 p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F (AND p2 (NOT p0))), (F (AND (NOT p2) p0)), (F (AND p2 p0))]
Knowledge based reduction with 9 factoid took 839 ms. Reduced automaton from 11 states, 24 edges and 3 AP to 11 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 447 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 454 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 497 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 20014 reset in 803 ms.
Product exploration explored 100000 steps with 20042 reset in 795 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 407 ms :[(AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, true, (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Support contains 3 out of 2078 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2078/2078 places, 2667/2667 transitions.
Graph (trivial) has 2545 edges and 2078 vertex of which 975 / 2078 are part of one of the 88 SCC in 1 ms
Free SCC test removed 887 places
Ensure Unique test removed 1038 transitions
Reduce isomorphic transitions removed 1038 transitions.
Graph (complete) has 1856 edges and 1191 vertex of which 1180 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 642 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 642 rules applied. Total rules applied 644 place count 1180 transition count 1623
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 660 place count 1180 transition count 1607
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 660 place count 1180 transition count 1623
Deduced a syphon composed of 669 places in 1 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 687 place count 1180 transition count 1623
Discarding 382 places :
Symmetric choice reduction at 2 with 382 rule applications. Total rules 1069 place count 798 transition count 1227
Deduced a syphon composed of 309 places in 1 ms
Iterating global reduction 2 with 382 rules applied. Total rules applied 1451 place count 798 transition count 1227
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1468 place count 781 transition count 1204
Deduced a syphon composed of 306 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1485 place count 781 transition count 1204
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1493 place count 781 transition count 1196
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1510 place count 764 transition count 1179
Deduced a syphon composed of 292 places in 1 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 1527 place count 764 transition count 1179
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1530 place count 761 transition count 1173
Deduced a syphon composed of 292 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1533 place count 761 transition count 1173
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1536 place count 758 transition count 1167
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1539 place count 758 transition count 1167
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1545 place count 752 transition count 1161
Deduced a syphon composed of 289 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1551 place count 752 transition count 1161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1554 place count 749 transition count 1155
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1557 place count 749 transition count 1155
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1560 place count 746 transition count 1149
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1563 place count 746 transition count 1149
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1569 place count 740 transition count 1143
Deduced a syphon composed of 286 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1575 place count 740 transition count 1143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1578 place count 737 transition count 1137
Deduced a syphon composed of 286 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1581 place count 737 transition count 1137
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1584 place count 734 transition count 1131
Deduced a syphon composed of 286 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1587 place count 734 transition count 1131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1593 place count 728 transition count 1122
Deduced a syphon composed of 283 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1599 place count 728 transition count 1122
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1605 place count 722 transition count 1098
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1611 place count 722 transition count 1098
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1612 place count 722 transition count 1098
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1618 place count 716 transition count 1092
Deduced a syphon composed of 278 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1624 place count 716 transition count 1092
Performed 139 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 417 places in 1 ms
Iterating global reduction 4 with 139 rules applied. Total rules applied 1763 place count 716 transition count 1194
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 1814 place count 716 transition count 1143
Discarding 132 places :
Symmetric choice reduction at 5 with 132 rule applications. Total rules 1946 place count 584 transition count 997
Deduced a syphon composed of 298 places in 1 ms
Iterating global reduction 5 with 132 rules applied. Total rules applied 2078 place count 584 transition count 997
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2080 place count 584 transition count 995
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2088 place count 576 transition count 984
Deduced a syphon composed of 290 places in 1 ms
Iterating global reduction 6 with 8 rules applied. Total rules applied 2096 place count 576 transition count 984
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 299 places in 1 ms
Iterating global reduction 6 with 9 rules applied. Total rules applied 2105 place count 576 transition count 984
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2110 place count 576 transition count 979
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 2129 place count 557 transition count 955
Deduced a syphon composed of 285 places in 0 ms
Iterating global reduction 7 with 19 rules applied. Total rules applied 2148 place count 557 transition count 955
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 2157 place count 557 transition count 946
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2162 place count 552 transition count 941
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 8 with 5 rules applied. Total rules applied 2167 place count 552 transition count 941
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 2171 place count 552 transition count 941
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 2179 place count 552 transition count 933
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2183 place count 548 transition count 929
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2187 place count 548 transition count 929
Performed 93 Post agglomeration using F-continuation condition with reduction of 152 identical transitions.
Deduced a syphon composed of 373 places in 1 ms
Iterating global reduction 9 with 93 rules applied. Total rules applied 2280 place count 548 transition count 1351
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 9 with 151 rules applied. Total rules applied 2431 place count 548 transition count 1200
Discarding 166 places :
Symmetric choice reduction at 10 with 166 rule applications. Total rules 2597 place count 382 transition count 758
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 10 with 166 rules applied. Total rules applied 2763 place count 382 transition count 758
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 2783 place count 382 transition count 738
Discarding 34 places :
Symmetric choice reduction at 11 with 34 rule applications. Total rules 2817 place count 348 transition count 669
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 11 with 34 rules applied. Total rules applied 2851 place count 348 transition count 669
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 189 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2855 place count 348 transition count 735
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2859 place count 344 transition count 698
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2863 place count 344 transition count 698
Deduced a syphon composed of 185 places in 0 ms
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 11 with 64 rules applied. Total rules applied 2927 place count 344 transition count 634
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 2932 place count 339 transition count 629
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 11 with 5 rules applied. Total rules applied 2937 place count 339 transition count 629
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2941 place count 339 transition count 709
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2945 place count 335 transition count 689
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2949 place count 335 transition count 689
Deduced a syphon composed of 180 places in 0 ms
Applied a total of 2949 rules in 902 ms. Remains 335 /2078 variables (removed 1743) and now considering 689/2667 (removed 1978) transitions.
[2022-05-16 11:17:40] [INFO ] Redundant transitions in 57 ms returned []
[2022-05-16 11:17:40] [INFO ] Flow matrix only has 612 transitions (discarded 77 similar events)
// Phase 1: matrix 612 rows 335 cols
[2022-05-16 11:17:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:17:41] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 335/2078 places, 689/2667 transitions.
Finished structural reductions, in 1 iterations. Remains : 335/2078 places, 689/2667 transitions.
Product exploration explored 100000 steps with 20080 reset in 1703 ms.
Product exploration explored 100000 steps with 19956 reset in 1562 ms.
Built C files in :
/tmp/ltsmin16329216698665074317
[2022-05-16 11:17:44] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16329216698665074317
Running compilation step : cd /tmp/ltsmin16329216698665074317;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16329216698665074317;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16329216698665074317;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 2078 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2078/2078 places, 2667/2667 transitions.
Applied a total of 0 rules in 114 ms. Remains 2078 /2078 variables (removed 0) and now considering 2667/2667 (removed 0) transitions.
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:17:47] [INFO ] Computed 5 place invariants in 18 ms
[2022-05-16 11:17:48] [INFO ] Implicit Places using invariants in 544 ms returned []
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:17:48] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-16 11:17:49] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
// Phase 1: matrix 2667 rows 2078 cols
[2022-05-16 11:17:49] [INFO ] Computed 5 place invariants in 13 ms
[2022-05-16 11:17:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:17:51] [INFO ] Dead Transitions using invariants and state equation in 2461 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2078/2078 places, 2667/2667 transitions.
Built C files in :
/tmp/ltsmin10716075895538862804
[2022-05-16 11:17:51] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10716075895538862804
Running compilation step : cd /tmp/ltsmin10716075895538862804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10716075895538862804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin10716075895538862804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 11:17:55] [INFO ] Flatten gal took : 122 ms
[2022-05-16 11:17:55] [INFO ] Flatten gal took : 109 ms
[2022-05-16 11:17:55] [INFO ] Time to serialize gal into /tmp/LTL11151798920478936254.gal : 61 ms
[2022-05-16 11:17:55] [INFO ] Time to serialize properties into /tmp/LTL14736024987942813510.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11151798920478936254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14736024987942813510.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1115179...268
Read 1 LTL properties
Checking formula 0 : !(((("(p1711==1)")U("(p3184==1)"))U(G((X(!(X("(p3184==1)"))))||(("(p1711==1)")U(G("(p1415==1)")))))))
Formula 0 simplified : !(("(p1711==1)" U "(p3184==1)") U G(X!X"(p3184==1)" | ("(p1711==1)" U G"(p1415==1)")))
Detected timeout of ITS tools.
[2022-05-16 11:18:10] [INFO ] Flatten gal took : 94 ms
[2022-05-16 11:18:10] [INFO ] Applying decomposition
[2022-05-16 11:18:10] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11427704629768790618.txt' '-o' '/tmp/graph11427704629768790618.bin' '-w' '/tmp/graph11427704629768790618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11427704629768790618.bin' '-l' '-1' '-v' '-w' '/tmp/graph11427704629768790618.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:18:10] [INFO ] Decomposing Gal with order
[2022-05-16 11:18:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:18:11] [INFO ] Removed a total of 692 redundant transitions.
[2022-05-16 11:18:11] [INFO ] Flatten gal took : 357 ms
[2022-05-16 11:18:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 205 ms.
[2022-05-16 11:18:12] [INFO ] Time to serialize gal into /tmp/LTL504537948768399753.gal : 52 ms
[2022-05-16 11:18:12] [INFO ] Time to serialize properties into /tmp/LTL7161544297567934765.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL504537948768399753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7161544297567934765.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5045379...244
Read 1 LTL properties
Checking formula 0 : !(((("(i23.u403.p1711==1)")U("(i40.u782.p3184==1)"))U(G((X(!(X("(i40.u782.p3184==1)"))))||(("(i23.u403.p1711==1)")U(G("(i18.i0.i6.u313...173
Formula 0 simplified : !(("(i23.u403.p1711==1)" U "(i40.u782.p3184==1)") U G(X!X"(i40.u782.p3184==1)" | ("(i23.u403.p1711==1)" U G"(i18.i0.i6.u313.p1415==1...160
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12065955803469963023
[2022-05-16 11:18:27] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12065955803469963023
Running compilation step : cd /tmp/ltsmin12065955803469963023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12065955803469963023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12065955803469963023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CloudReconfiguration-PT-401-LTLFireability-04 finished in 117651 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((X(p0) U p1)||G(p2)) U p3)))'
Support contains 4 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2099 transition count 2696
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2099 transition count 2696
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 2099 transition count 2694
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 2089 transition count 2682
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 2089 transition count 2682
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 2083 transition count 2674
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 2083 transition count 2674
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 2083 transition count 2673
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 2080 transition count 2669
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 2080 transition count 2669
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 2079 transition count 2668
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 2079 transition count 2668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 2079 transition count 2667
Applied a total of 80 rules in 809 ms. Remains 2079 /2117 variables (removed 38) and now considering 2667/2715 (removed 48) transitions.
// Phase 1: matrix 2667 rows 2079 cols
[2022-05-16 11:18:31] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-16 11:18:31] [INFO ] Implicit Places using invariants in 548 ms returned []
// Phase 1: matrix 2667 rows 2079 cols
[2022-05-16 11:18:31] [INFO ] Computed 5 place invariants in 13 ms
[2022-05-16 11:18:32] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
// Phase 1: matrix 2667 rows 2079 cols
[2022-05-16 11:18:32] [INFO ] Computed 5 place invariants in 14 ms
[2022-05-16 11:18:34] [INFO ] Dead Transitions using invariants and state equation in 2064 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2079/2117 places, 2667/2715 transitions.
Finished structural reductions, in 1 iterations. Remains : 2079/2117 places, 2667/2715 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p3), (NOT p3), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s368 1), p1:(EQ s1817 1), p2:(EQ s245 1), p0:(NEQ s280 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]]
Stuttering criterion allowed to conclude after 184 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-07 finished in 4639 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X(X(p1))&&(G(X(X(p2)))||p2)))))'
Support contains 3 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2096 transition count 2693
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2096 transition count 2693
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 2096 transition count 2691
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 55 place count 2085 transition count 2678
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 2085 transition count 2678
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 2078 transition count 2669
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 2078 transition count 2669
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 2078 transition count 2667
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 2075 transition count 2663
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 2075 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 2074 transition count 2662
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 2074 transition count 2662
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 2074 transition count 2661
Applied a total of 91 rules in 785 ms. Remains 2074 /2117 variables (removed 43) and now considering 2661/2715 (removed 54) transitions.
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:18:35] [INFO ] Computed 5 place invariants in 13 ms
[2022-05-16 11:18:36] [INFO ] Implicit Places using invariants in 962 ms returned []
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:18:36] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-16 11:18:37] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:18:37] [INFO ] Computed 5 place invariants in 20 ms
[2022-05-16 11:18:41] [INFO ] Dead Transitions using invariants and state equation in 3199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2074/2117 places, 2661/2715 transitions.
Finished structural reductions, in 1 iterations. Remains : 2074/2117 places, 2661/2715 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s8 1), p2:(EQ s1686 0), p1:(EQ s630 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 725 ms.
Product exploration explored 100000 steps with 16666 reset in 856 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2896 edges and 2074 vertex of which 2063 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.10 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Detected a total of 33/2074 stabilizing places and 36/2661 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:18:44] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-16 11:18:46] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 17 ms returned sat
[2022-05-16 11:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:18:48] [INFO ] [Real]Absence check using state equation in 2073 ms returned sat
[2022-05-16 11:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:18:50] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 16 ms returned sat
[2022-05-16 11:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:18:52] [INFO ] [Nat]Absence check using state equation in 2215 ms returned sat
[2022-05-16 11:18:52] [INFO ] Computed and/alt/rep : 2650/3225/2650 causal constraints (skipped 10 transitions) in 178 ms.
[2022-05-16 11:19:03] [INFO ] Added : 285 causal constraints over 57 iterations in 10615 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 2074 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2074/2074 places, 2661/2661 transitions.
Applied a total of 0 rules in 114 ms. Remains 2074 /2074 variables (removed 0) and now considering 2661/2661 (removed 0) transitions.
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:19:03] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-16 11:19:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:19:04] [INFO ] Implicit Places using invariants in 689 ms returned []
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:19:04] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-16 11:19:05] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:19:05] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-16 11:19:07] [INFO ] Dead Transitions using invariants and state equation in 1937 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2074/2074 places, 2661/2661 transitions.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2896 edges and 2074 vertex of which 2063 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.14 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Detected a total of 33/2074 stabilizing places and 36/2661 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:19:08] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-16 11:19:10] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 16 ms returned sat
[2022-05-16 11:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:19:12] [INFO ] [Real]Absence check using state equation in 2180 ms returned sat
[2022-05-16 11:19:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:19:14] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 14 ms returned sat
[2022-05-16 11:19:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:19:17] [INFO ] [Nat]Absence check using state equation in 2445 ms returned sat
[2022-05-16 11:19:17] [INFO ] Computed and/alt/rep : 2650/3225/2650 causal constraints (skipped 10 transitions) in 283 ms.
[2022-05-16 11:19:27] [INFO ] Added : 185 causal constraints over 37 iterations in 10106 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16666 reset in 922 ms.
Product exploration explored 100000 steps with 16666 reset in 778 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2074 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2074/2074 places, 2661/2661 transitions.
Graph (trivial) has 2541 edges and 2074 vertex of which 974 / 2074 are part of one of the 87 SCC in 2 ms
Free SCC test removed 887 places
Ensure Unique test removed 1039 transitions
Reduce isomorphic transitions removed 1039 transitions.
Graph (complete) has 1850 edges and 1187 vertex of which 1176 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 638 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 638 rules applied. Total rules applied 640 place count 1176 transition count 1616
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 656 place count 1176 transition count 1600
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 656 place count 1176 transition count 1617
Deduced a syphon composed of 668 places in 1 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 686 place count 1176 transition count 1617
Discarding 379 places :
Symmetric choice reduction at 2 with 379 rule applications. Total rules 1065 place count 797 transition count 1224
Deduced a syphon composed of 310 places in 1 ms
Iterating global reduction 2 with 379 rules applied. Total rules applied 1444 place count 797 transition count 1224
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1460 place count 781 transition count 1202
Deduced a syphon composed of 307 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 1476 place count 781 transition count 1202
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1483 place count 781 transition count 1195
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1499 place count 765 transition count 1179
Deduced a syphon composed of 294 places in 1 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 1515 place count 765 transition count 1179
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1518 place count 762 transition count 1173
Deduced a syphon composed of 294 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1521 place count 762 transition count 1173
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1524 place count 759 transition count 1167
Deduced a syphon composed of 294 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1527 place count 759 transition count 1167
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1533 place count 753 transition count 1161
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1539 place count 753 transition count 1161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1542 place count 750 transition count 1155
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1545 place count 750 transition count 1155
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1548 place count 747 transition count 1149
Deduced a syphon composed of 291 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1551 place count 747 transition count 1149
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1557 place count 741 transition count 1143
Deduced a syphon composed of 288 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1563 place count 741 transition count 1143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1566 place count 738 transition count 1137
Deduced a syphon composed of 288 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1569 place count 738 transition count 1137
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1572 place count 735 transition count 1131
Deduced a syphon composed of 288 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1575 place count 735 transition count 1131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1581 place count 729 transition count 1122
Deduced a syphon composed of 285 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1587 place count 729 transition count 1122
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1593 place count 723 transition count 1098
Deduced a syphon composed of 282 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1599 place count 723 transition count 1098
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 723 transition count 1098
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1606 place count 717 transition count 1092
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1612 place count 717 transition count 1092
Performed 139 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 419 places in 0 ms
Iterating global reduction 4 with 139 rules applied. Total rules applied 1751 place count 717 transition count 1192
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 1802 place count 717 transition count 1141
Discarding 132 places :
Symmetric choice reduction at 5 with 132 rule applications. Total rules 1934 place count 585 transition count 996
Deduced a syphon composed of 301 places in 1 ms
Iterating global reduction 5 with 132 rules applied. Total rules applied 2066 place count 585 transition count 996
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 2075 place count 576 transition count 983
Deduced a syphon composed of 293 places in 1 ms
Iterating global reduction 5 with 9 rules applied. Total rules applied 2084 place count 576 transition count 983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2085 place count 576 transition count 982
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2086 place count 575 transition count 981
Deduced a syphon composed of 292 places in 1 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 2087 place count 575 transition count 981
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 301 places in 1 ms
Iterating global reduction 6 with 9 rules applied. Total rules applied 2096 place count 575 transition count 981
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2101 place count 575 transition count 976
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 2120 place count 556 transition count 952
Deduced a syphon composed of 287 places in 1 ms
Iterating global reduction 7 with 19 rules applied. Total rules applied 2139 place count 556 transition count 952
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 2147 place count 556 transition count 944
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2152 place count 551 transition count 939
Deduced a syphon composed of 282 places in 1 ms
Iterating global reduction 8 with 5 rules applied. Total rules applied 2157 place count 551 transition count 939
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 286 places in 1 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 2161 place count 551 transition count 939
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 2169 place count 551 transition count 931
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2173 place count 547 transition count 927
Deduced a syphon composed of 282 places in 1 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2177 place count 547 transition count 927
Performed 94 Post agglomeration using F-continuation condition with reduction of 160 identical transitions.
Deduced a syphon composed of 376 places in 0 ms
Iterating global reduction 9 with 94 rules applied. Total rules applied 2271 place count 547 transition count 1352
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 9 with 160 rules applied. Total rules applied 2431 place count 547 transition count 1192
Discarding 167 places :
Symmetric choice reduction at 10 with 167 rule applications. Total rules 2598 place count 380 transition count 750
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 10 with 167 rules applied. Total rules applied 2765 place count 380 transition count 750
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 2785 place count 380 transition count 730
Discarding 36 places :
Symmetric choice reduction at 11 with 36 rule applications. Total rules 2821 place count 344 transition count 654
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 11 with 36 rules applied. Total rules applied 2857 place count 344 transition count 654
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 189 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2861 place count 344 transition count 718
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2865 place count 340 transition count 682
Deduced a syphon composed of 185 places in 1 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2869 place count 340 transition count 682
Deduced a syphon composed of 185 places in 0 ms
Drop transitions removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 11 with 63 rules applied. Total rules applied 2932 place count 340 transition count 619
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 2937 place count 335 transition count 614
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 11 with 5 rules applied. Total rules applied 2942 place count 335 transition count 614
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 184 places in 1 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2946 place count 335 transition count 694
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2950 place count 331 transition count 674
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2954 place count 331 transition count 674
Deduced a syphon composed of 180 places in 0 ms
Applied a total of 2954 rules in 601 ms. Remains 331 /2074 variables (removed 1743) and now considering 674/2661 (removed 1987) transitions.
[2022-05-16 11:19:30] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-16 11:19:30] [INFO ] Flow matrix only has 598 transitions (discarded 76 similar events)
// Phase 1: matrix 598 rows 331 cols
[2022-05-16 11:19:30] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 11:19:30] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 331/2074 places, 674/2661 transitions.
Finished structural reductions, in 1 iterations. Remains : 331/2074 places, 674/2661 transitions.
Product exploration explored 100000 steps with 20000 reset in 1905 ms.
Product exploration explored 100000 steps with 20000 reset in 2009 ms.
Built C files in :
/tmp/ltsmin1042583140040469851
[2022-05-16 11:19:34] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1042583140040469851
Running compilation step : cd /tmp/ltsmin1042583140040469851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1042583140040469851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1042583140040469851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2074 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2074/2074 places, 2661/2661 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2073 transition count 2660
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2073 transition count 2660
Applied a total of 2 rules in 233 ms. Remains 2073 /2074 variables (removed 1) and now considering 2660/2661 (removed 1) transitions.
// Phase 1: matrix 2660 rows 2073 cols
[2022-05-16 11:19:38] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-16 11:19:38] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 2660 rows 2073 cols
[2022-05-16 11:19:38] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-16 11:19:39] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
// Phase 1: matrix 2660 rows 2073 cols
[2022-05-16 11:19:39] [INFO ] Computed 5 place invariants in 13 ms
[2022-05-16 11:19:42] [INFO ] Dead Transitions using invariants and state equation in 2742 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2073/2074 places, 2660/2661 transitions.
Finished structural reductions, in 1 iterations. Remains : 2073/2074 places, 2660/2661 transitions.
Built C files in :
/tmp/ltsmin9373418789873357224
[2022-05-16 11:19:42] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9373418789873357224
Running compilation step : cd /tmp/ltsmin9373418789873357224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9373418789873357224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9373418789873357224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 11:19:45] [INFO ] Flatten gal took : 78 ms
[2022-05-16 11:19:45] [INFO ] Flatten gal took : 81 ms
[2022-05-16 11:19:45] [INFO ] Time to serialize gal into /tmp/LTL16509524844041518821.gal : 17 ms
[2022-05-16 11:19:45] [INFO ] Time to serialize properties into /tmp/LTL919930574602595193.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16509524844041518821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL919930574602595193.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1650952...266
Read 1 LTL properties
Checking formula 0 : !((X((F("(p8==1)"))||((X(X("(p1128==1)")))&&((G(X(X("(p2912==0)"))))||("(p2912==0)"))))))
Formula 0 simplified : !X(F"(p8==1)" | (XX"(p1128==1)" & ("(p2912==0)" | GXX"(p2912==0)")))
Detected timeout of ITS tools.
[2022-05-16 11:20:00] [INFO ] Flatten gal took : 71 ms
[2022-05-16 11:20:00] [INFO ] Applying decomposition
[2022-05-16 11:20:00] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5520660121246602450.txt' '-o' '/tmp/graph5520660121246602450.bin' '-w' '/tmp/graph5520660121246602450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5520660121246602450.bin' '-l' '-1' '-v' '-w' '/tmp/graph5520660121246602450.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:20:01] [INFO ] Decomposing Gal with order
[2022-05-16 11:20:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:20:01] [INFO ] Removed a total of 682 redundant transitions.
[2022-05-16 11:20:01] [INFO ] Flatten gal took : 191 ms
[2022-05-16 11:20:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 41 ms.
[2022-05-16 11:20:01] [INFO ] Time to serialize gal into /tmp/LTL7657251833404414276.gal : 41 ms
[2022-05-16 11:20:01] [INFO ] Time to serialize properties into /tmp/LTL9248669425416566092.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7657251833404414276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9248669425416566092.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7657251...245
Read 1 LTL properties
Checking formula 0 : !((X((F("(i43.i0.i0.u4.p8==1)"))||((X(X("(i12.i1.i1.u247.p1128==1)")))&&((G(X(X("(i34.i1.i1.u694.p2912==0)"))))||("(i34.i1.i1.u694.p29...168
Formula 0 simplified : !X(F"(i43.i0.i0.u4.p8==1)" | (XX"(i12.i1.i1.u247.p1128==1)" & ("(i34.i1.i1.u694.p2912==0)" | GXX"(i34.i1.i1.u694.p2912==0)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9019861838862654955
[2022-05-16 11:20:16] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9019861838862654955
Running compilation step : cd /tmp/ltsmin9019861838862654955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9019861838862654955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9019861838862654955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CloudReconfiguration-PT-401-LTLFireability-08 finished in 104792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F((G(p0)||(G(p1)&&p2)))))))'
Support contains 2 out of 2117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Graph (trivial) has 2594 edges and 2117 vertex of which 983 / 2117 are part of one of the 87 SCC in 1 ms
Free SCC test removed 896 places
Ensure Unique test removed 1049 transitions
Reduce isomorphic transitions removed 1049 transitions.
Graph (complete) has 1896 edges and 1221 vertex of which 1210 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 664 transitions
Trivial Post-agglo rules discarded 664 transitions
Performed 664 trivial Post agglomeration. Transition count delta: 664
Iterating post reduction 0 with 664 rules applied. Total rules applied 666 place count 1209 transition count 995
Reduce places removed 664 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 697 rules applied. Total rules applied 1363 place count 545 transition count 962
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1378 place count 530 transition count 962
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 1378 place count 530 transition count 897
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1508 place count 465 transition count 897
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1532 place count 441 transition count 859
Iterating global reduction 3 with 24 rules applied. Total rules applied 1556 place count 441 transition count 859
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 1560 place count 441 transition count 855
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1564 place count 437 transition count 855
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1578 place count 423 transition count 835
Iterating global reduction 5 with 14 rules applied. Total rules applied 1592 place count 423 transition count 835
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1599 place count 423 transition count 828
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1602 place count 420 transition count 822
Iterating global reduction 6 with 3 rules applied. Total rules applied 1605 place count 420 transition count 822
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1608 place count 417 transition count 816
Iterating global reduction 6 with 3 rules applied. Total rules applied 1611 place count 417 transition count 816
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1612 place count 417 transition count 815
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1614 place count 415 transition count 811
Iterating global reduction 7 with 2 rules applied. Total rules applied 1616 place count 415 transition count 811
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1618 place count 413 transition count 807
Iterating global reduction 7 with 2 rules applied. Total rules applied 1620 place count 413 transition count 807
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1622 place count 411 transition count 803
Iterating global reduction 7 with 2 rules applied. Total rules applied 1624 place count 411 transition count 803
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1626 place count 409 transition count 799
Iterating global reduction 7 with 2 rules applied. Total rules applied 1628 place count 409 transition count 799
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1630 place count 407 transition count 795
Iterating global reduction 7 with 2 rules applied. Total rules applied 1632 place count 407 transition count 795
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1634 place count 405 transition count 781
Iterating global reduction 7 with 2 rules applied. Total rules applied 1636 place count 405 transition count 781
Performed 186 Post agglomeration using F-continuation condition with reduction of 110 identical transitions.
Deduced a syphon composed of 186 places in 0 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 7 with 372 rules applied. Total rules applied 2008 place count 219 transition count 485
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 2019 place count 219 transition count 474
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2026 place count 212 transition count 465
Iterating global reduction 8 with 7 rules applied. Total rules applied 2033 place count 212 transition count 465
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2035 place count 210 transition count 462
Iterating global reduction 8 with 2 rules applied. Total rules applied 2037 place count 210 transition count 462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2038 place count 210 transition count 461
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2039 place count 209 transition count 459
Iterating global reduction 9 with 1 rules applied. Total rules applied 2040 place count 209 transition count 459
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2041 place count 208 transition count 457
Iterating global reduction 9 with 1 rules applied. Total rules applied 2042 place count 208 transition count 457
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2043 place count 207 transition count 455
Iterating global reduction 9 with 1 rules applied. Total rules applied 2044 place count 207 transition count 455
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2045 place count 206 transition count 453
Iterating global reduction 9 with 1 rules applied. Total rules applied 2046 place count 206 transition count 453
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2047 place count 205 transition count 451
Iterating global reduction 9 with 1 rules applied. Total rules applied 2048 place count 205 transition count 451
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2049 place count 204 transition count 444
Iterating global reduction 9 with 1 rules applied. Total rules applied 2050 place count 204 transition count 444
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 2084 place count 187 transition count 423
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 2101 place count 187 transition count 406
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 48 rules applied. Total rules applied 2149 place count 163 transition count 453
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 2172 place count 163 transition count 430
Discarding 12 places :
Symmetric choice reduction at 11 with 12 rule applications. Total rules 2184 place count 151 transition count 406
Iterating global reduction 11 with 12 rules applied. Total rules applied 2196 place count 151 transition count 406
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 2204 place count 151 transition count 398
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 12 with 50 rules applied. Total rules applied 2254 place count 151 transition count 348
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2255 place count 150 transition count 347
Applied a total of 2255 rules in 209 ms. Remains 150 /2117 variables (removed 1967) and now considering 347/2715 (removed 2368) transitions.
[2022-05-16 11:20:20] [INFO ] Flow matrix only has 271 transitions (discarded 76 similar events)
// Phase 1: matrix 271 rows 150 cols
[2022-05-16 11:20:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:20:20] [INFO ] Implicit Places using invariants in 136 ms returned []
[2022-05-16 11:20:20] [INFO ] Flow matrix only has 271 transitions (discarded 76 similar events)
// Phase 1: matrix 271 rows 150 cols
[2022-05-16 11:20:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:20:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 11:20:20] [INFO ] Implicit Places using invariants and state equation in 299 ms returned [10, 78, 111]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 437 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/2117 places, 347/2715 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 345
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 144 transition count 344
Applied a total of 3 rules in 17 ms. Remains 144 /147 variables (removed 3) and now considering 344/347 (removed 3) transitions.
[2022-05-16 11:20:20] [INFO ] Flow matrix only has 268 transitions (discarded 76 similar events)
// Phase 1: matrix 268 rows 144 cols
[2022-05-16 11:20:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:20:20] [INFO ] Implicit Places using invariants in 109 ms returned []
[2022-05-16 11:20:20] [INFO ] Flow matrix only has 268 transitions (discarded 76 similar events)
// Phase 1: matrix 268 rows 144 cols
[2022-05-16 11:20:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:20:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 11:20:20] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 144/2117 places, 344/2715 transitions.
Finished structural reductions, in 2 iterations. Remains : 144/2117 places, 344/2715 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s62 1), p1:(EQ s24 1), p0:(EQ s62 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 19713 steps with 1412 reset in 194 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-09 finished in 1322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p1) U X(p2))) U !X(!p1)))'
Support contains 3 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2097 transition count 2694
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2097 transition count 2694
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 2097 transition count 2692
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 2087 transition count 2680
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 2087 transition count 2680
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 2081 transition count 2672
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 2081 transition count 2672
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 2081 transition count 2671
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 2078 transition count 2667
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 2078 transition count 2667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 2077 transition count 2666
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 2077 transition count 2666
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 2077 transition count 2665
Applied a total of 84 rules in 730 ms. Remains 2077 /2117 variables (removed 40) and now considering 2665/2715 (removed 50) transitions.
// Phase 1: matrix 2665 rows 2077 cols
[2022-05-16 11:20:22] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-16 11:20:22] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 2665 rows 2077 cols
[2022-05-16 11:20:22] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-16 11:20:23] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
// Phase 1: matrix 2665 rows 2077 cols
[2022-05-16 11:20:23] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-16 11:20:25] [INFO ] Dead Transitions using invariants and state equation in 1854 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2077/2117 places, 2665/2715 transitions.
Finished structural reductions, in 1 iterations. Remains : 2077/2117 places, 2665/2715 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 4}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s443 1), p1:(EQ s338 1), p2:(NEQ s262 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33154 reset in 1296 ms.
Product exploration explored 100000 steps with 33336 reset in 1729 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2900 edges and 2077 vertex of which 2066 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1026 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 512 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 53 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2665 rows 2077 cols
[2022-05-16 11:20:31] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-16 11:20:32] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 28 ms returned sat
[2022-05-16 11:20:34] [INFO ] After 2360ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:5
[2022-05-16 11:20:35] [INFO ] After 2674ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:6
[2022-05-16 11:20:35] [INFO ] After 3738ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2022-05-16 11:20:35] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 28 ms returned sat
[2022-05-16 11:20:38] [INFO ] After 2054ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2022-05-16 11:20:39] [INFO ] After 3502ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 726 ms.
[2022-05-16 11:20:40] [INFO ] After 5388ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 2077 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2077/2077 places, 2665/2665 transitions.
Graph (trivial) has 2540 edges and 2077 vertex of which 980 / 2077 are part of one of the 88 SCC in 4 ms
Free SCC test removed 892 places
Drop transitions removed 1132 transitions
Reduce isomorphic transitions removed 1132 transitions.
Graph (complete) has 1761 edges and 1185 vertex of which 1174 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 657 transitions
Trivial Post-agglo rules discarded 657 transitions
Performed 657 trivial Post agglomeration. Transition count delta: 657
Iterating post reduction 0 with 665 rules applied. Total rules applied 667 place count 1174 transition count 863
Reduce places removed 657 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 746 rules applied. Total rules applied 1413 place count 517 transition count 774
Reduce places removed 58 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 62 rules applied. Total rules applied 1475 place count 459 transition count 770
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1479 place count 455 transition count 770
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1479 place count 455 transition count 704
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1611 place count 389 transition count 704
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1626 place count 374 transition count 682
Iterating global reduction 4 with 15 rules applied. Total rules applied 1641 place count 374 transition count 682
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 1645 place count 374 transition count 678
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1649 place count 370 transition count 678
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1659 place count 360 transition count 666
Iterating global reduction 6 with 10 rules applied. Total rules applied 1669 place count 360 transition count 666
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1677 place count 360 transition count 658
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1678 place count 359 transition count 652
Iterating global reduction 7 with 1 rules applied. Total rules applied 1679 place count 359 transition count 652
Performed 188 Post agglomeration using F-continuation condition with reduction of 128 identical transitions.
Deduced a syphon composed of 188 places in 1 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 7 with 376 rules applied. Total rules applied 2055 place count 171 transition count 336
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 2074 place count 171 transition count 317
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2078 place count 167 transition count 313
Iterating global reduction 8 with 4 rules applied. Total rules applied 2082 place count 167 transition count 313
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 2116 place count 150 transition count 292
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 2136 place count 150 transition count 272
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 2138 place count 149 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2140 place count 149 transition count 269
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 10 with 2 rules applied. Total rules applied 2142 place count 148 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2144 place count 148 transition count 266
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 11 with 2 rules applied. Total rules applied 2146 place count 147 transition count 265
Performed 44 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 11 with 88 rules applied. Total rules applied 2234 place count 103 transition count 306
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 11 with 36 rules applied. Total rules applied 2270 place count 103 transition count 270
Discarding 28 places :
Symmetric choice reduction at 12 with 28 rule applications. Total rules 2298 place count 75 transition count 214
Iterating global reduction 12 with 28 rules applied. Total rules applied 2326 place count 75 transition count 214
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 12 with 16 rules applied. Total rules applied 2342 place count 75 transition count 198
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 2350 place count 67 transition count 182
Iterating global reduction 13 with 8 rules applied. Total rules applied 2358 place count 67 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 2366 place count 67 transition count 174
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 2367 place count 67 transition count 173
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 2369 place count 66 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 2370 place count 66 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2371 place count 65 transition count 171
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2372 place count 65 transition count 170
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 2374 place count 65 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 2375 place count 64 transition count 169
Applied a total of 2375 rules in 143 ms. Remains 64 /2077 variables (removed 2013) and now considering 169/2665 (removed 2496) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/2077 places, 169/2665 transitions.
Finished random walk after 77 steps, including 5 resets, run visited all 4 properties in 5 ms. (steps per millisecond=15 )
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (G (NOT (AND (NOT p1) p0 (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 21 factoid took 1236 ms. Reduced automaton from 9 states, 17 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
// Phase 1: matrix 2665 rows 2077 cols
[2022-05-16 11:20:42] [INFO ] Computed 5 place invariants in 16 ms
[2022-05-16 11:20:44] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 14 ms returned sat
[2022-05-16 11:20:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:20:46] [INFO ] [Real]Absence check using state equation in 1821 ms returned sat
[2022-05-16 11:20:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:20:48] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 24 ms returned sat
[2022-05-16 11:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:20:50] [INFO ] [Nat]Absence check using state equation in 1783 ms returned sat
[2022-05-16 11:20:50] [INFO ] Computed and/alt/rep : 2654/3230/2654 causal constraints (skipped 10 transitions) in 236 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 11:21:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 3 out of 2077 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2077/2077 places, 2665/2665 transitions.
Applied a total of 0 rules in 174 ms. Remains 2077 /2077 variables (removed 0) and now considering 2665/2665 (removed 0) transitions.
// Phase 1: matrix 2665 rows 2077 cols
[2022-05-16 11:21:01] [INFO ] Computed 5 place invariants in 16 ms
[2022-05-16 11:21:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:21:02] [INFO ] Implicit Places using invariants in 736 ms returned []
// Phase 1: matrix 2665 rows 2077 cols
[2022-05-16 11:21:02] [INFO ] Computed 5 place invariants in 16 ms
[2022-05-16 11:21:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:21:03] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
// Phase 1: matrix 2665 rows 2077 cols
[2022-05-16 11:21:03] [INFO ] Computed 5 place invariants in 17 ms
[2022-05-16 11:21:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:21:05] [INFO ] Dead Transitions using invariants and state equation in 2584 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2077/2077 places, 2665/2665 transitions.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2900 edges and 2077 vertex of which 2066 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.12 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 298 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2665 rows 2077 cols
[2022-05-16 11:21:06] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-16 11:21:06] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 17 ms returned sat
[2022-05-16 11:21:07] [INFO ] After 1312ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 11:21:08] [INFO ] After 1484ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-16 11:21:08] [INFO ] After 2016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 2077 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2077/2077 places, 2665/2665 transitions.
Graph (trivial) has 2548 edges and 2077 vertex of which 980 / 2077 are part of one of the 88 SCC in 1 ms
Free SCC test removed 892 places
Drop transitions removed 1132 transitions
Reduce isomorphic transitions removed 1132 transitions.
Graph (complete) has 1761 edges and 1185 vertex of which 1174 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 664 transitions
Trivial Post-agglo rules discarded 664 transitions
Performed 664 trivial Post agglomeration. Transition count delta: 664
Iterating post reduction 0 with 673 rules applied. Total rules applied 675 place count 1174 transition count 855
Reduce places removed 664 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 754 rules applied. Total rules applied 1429 place count 510 transition count 765
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 1487 place count 452 transition count 765
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 1487 place count 452 transition count 699
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 1619 place count 386 transition count 699
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1634 place count 371 transition count 677
Iterating global reduction 3 with 15 rules applied. Total rules applied 1649 place count 371 transition count 677
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 1653 place count 371 transition count 673
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1657 place count 367 transition count 673
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1667 place count 357 transition count 661
Iterating global reduction 5 with 10 rules applied. Total rules applied 1677 place count 357 transition count 661
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1685 place count 357 transition count 653
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1687 place count 355 transition count 641
Iterating global reduction 6 with 2 rules applied. Total rules applied 1689 place count 355 transition count 641
Performed 189 Post agglomeration using F-continuation condition with reduction of 128 identical transitions.
Deduced a syphon composed of 189 places in 1 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 6 with 378 rules applied. Total rules applied 2067 place count 166 transition count 324
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2084 place count 166 transition count 307
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2088 place count 162 transition count 303
Iterating global reduction 7 with 4 rules applied. Total rules applied 2092 place count 162 transition count 303
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 2126 place count 145 transition count 282
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 2145 place count 145 transition count 263
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 2147 place count 144 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2149 place count 144 transition count 260
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 2151 place count 143 transition count 259
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2154 place count 143 transition count 256
Performed 44 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 10 with 88 rules applied. Total rules applied 2242 place count 99 transition count 297
Drop transitions removed 33 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 10 with 66 rules applied. Total rules applied 2308 place count 99 transition count 231
Discarding 31 places :
Symmetric choice reduction at 11 with 31 rule applications. Total rules 2339 place count 68 transition count 193
Iterating global reduction 11 with 31 rules applied. Total rules applied 2370 place count 68 transition count 193
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 2389 place count 68 transition count 174
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 2397 place count 60 transition count 158
Iterating global reduction 12 with 8 rules applied. Total rules applied 2405 place count 60 transition count 158
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 2413 place count 60 transition count 150
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 13 with 31 rules applied. Total rules applied 2444 place count 60 transition count 119
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 2447 place count 57 transition count 110
Iterating global reduction 13 with 3 rules applied. Total rules applied 2450 place count 57 transition count 110
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 2453 place count 54 transition count 107
Iterating global reduction 13 with 3 rules applied. Total rules applied 2456 place count 54 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 2459 place count 54 transition count 104
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 2461 place count 53 transition count 103
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 2464 place count 53 transition count 100
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2468 place count 53 transition count 96
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2473 place count 49 transition count 95
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2474 place count 49 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 2475 place count 48 transition count 94
Applied a total of 2475 rules in 83 ms. Remains 48 /2077 variables (removed 2029) and now considering 94/2665 (removed 2571) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/2077 places, 94/2665 transitions.
Finished random walk after 38 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND p2 p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 543 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
// Phase 1: matrix 2665 rows 2077 cols
[2022-05-16 11:21:09] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-16 11:21:11] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 16 ms returned sat
[2022-05-16 11:21:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:21:12] [INFO ] [Real]Absence check using state equation in 1941 ms returned sat
[2022-05-16 11:21:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:21:15] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 14 ms returned sat
[2022-05-16 11:21:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:21:16] [INFO ] [Nat]Absence check using state equation in 1764 ms returned sat
[2022-05-16 11:21:17] [INFO ] Computed and/alt/rep : 2654/3230/2654 causal constraints (skipped 10 transitions) in 175 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 11:21:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Stuttering criterion allowed to conclude after 158 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-10 finished in 67058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&G(p1)&&p0)))'
Support contains 2 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2097 transition count 2694
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2097 transition count 2694
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 2097 transition count 2692
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 2087 transition count 2680
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 2087 transition count 2680
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 2081 transition count 2672
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 2081 transition count 2672
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 2081 transition count 2670
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 2079 transition count 2667
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 2079 transition count 2667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 2078 transition count 2666
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 2078 transition count 2666
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 2078 transition count 2665
Applied a total of 83 rules in 907 ms. Remains 2078 /2117 variables (removed 39) and now considering 2665/2715 (removed 50) transitions.
// Phase 1: matrix 2665 rows 2078 cols
[2022-05-16 11:21:29] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-16 11:21:29] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 2665 rows 2078 cols
[2022-05-16 11:21:29] [INFO ] Computed 5 place invariants in 14 ms
[2022-05-16 11:21:30] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
// Phase 1: matrix 2665 rows 2078 cols
[2022-05-16 11:21:30] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-16 11:21:33] [INFO ] Dead Transitions using invariants and state equation in 2639 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2078/2117 places, 2665/2715 transitions.
Finished structural reductions, in 1 iterations. Remains : 2078/2117 places, 2665/2715 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, 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}]], initial=1, aps=[p0:(EQ s235 0), p1:(EQ s1441 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 554 reset in 243 ms.
Entered a terminal (fully accepting) state of product in 16374 steps with 89 reset in 134 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-12 finished in 5323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U (p2||G(p1))))))'
Support contains 3 out of 2117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Graph (trivial) has 2591 edges and 2117 vertex of which 979 / 2117 are part of one of the 87 SCC in 3 ms
Free SCC test removed 892 places
Ensure Unique test removed 1043 transitions
Reduce isomorphic transitions removed 1043 transitions.
Graph (complete) has 1902 edges and 1225 vertex of which 1214 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 664 place count 1213 transition count 1003
Reduce places removed 662 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 695 rules applied. Total rules applied 1359 place count 551 transition count 970
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1374 place count 536 transition count 970
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 1374 place count 536 transition count 902
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 1510 place count 468 transition count 902
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1533 place count 445 transition count 865
Iterating global reduction 3 with 23 rules applied. Total rules applied 1556 place count 445 transition count 865
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 1560 place count 445 transition count 861
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1564 place count 441 transition count 861
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1578 place count 427 transition count 841
Iterating global reduction 5 with 14 rules applied. Total rules applied 1592 place count 427 transition count 841
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1599 place count 427 transition count 834
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1602 place count 424 transition count 828
Iterating global reduction 6 with 3 rules applied. Total rules applied 1605 place count 424 transition count 828
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1608 place count 421 transition count 822
Iterating global reduction 6 with 3 rules applied. Total rules applied 1611 place count 421 transition count 822
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1612 place count 421 transition count 821
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1614 place count 419 transition count 817
Iterating global reduction 7 with 2 rules applied. Total rules applied 1616 place count 419 transition count 817
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1618 place count 417 transition count 813
Iterating global reduction 7 with 2 rules applied. Total rules applied 1620 place count 417 transition count 813
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1622 place count 415 transition count 809
Iterating global reduction 7 with 2 rules applied. Total rules applied 1624 place count 415 transition count 809
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1626 place count 413 transition count 805
Iterating global reduction 7 with 2 rules applied. Total rules applied 1628 place count 413 transition count 805
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1630 place count 411 transition count 801
Iterating global reduction 7 with 2 rules applied. Total rules applied 1632 place count 411 transition count 801
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1634 place count 409 transition count 787
Iterating global reduction 7 with 2 rules applied. Total rules applied 1636 place count 409 transition count 787
Performed 186 Post agglomeration using F-continuation condition with reduction of 107 identical transitions.
Deduced a syphon composed of 186 places in 1 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 7 with 372 rules applied. Total rules applied 2008 place count 223 transition count 494
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 2022 place count 223 transition count 480
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 2028 place count 217 transition count 473
Iterating global reduction 8 with 6 rules applied. Total rules applied 2034 place count 217 transition count 473
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2035 place count 216 transition count 472
Iterating global reduction 8 with 1 rules applied. Total rules applied 2036 place count 216 transition count 472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2037 place count 216 transition count 471
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 2071 place count 199 transition count 450
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 2087 place count 199 transition count 434
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2088 place count 198 transition count 432
Iterating global reduction 10 with 1 rules applied. Total rules applied 2089 place count 198 transition count 432
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 10 with 52 rules applied. Total rules applied 2141 place count 172 transition count 484
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 2167 place count 172 transition count 458
Discarding 12 places :
Symmetric choice reduction at 11 with 12 rule applications. Total rules 2179 place count 160 transition count 434
Iterating global reduction 11 with 12 rules applied. Total rules applied 2191 place count 160 transition count 434
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 2199 place count 160 transition count 426
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 12 with 61 rules applied. Total rules applied 2260 place count 160 transition count 365
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2261 place count 159 transition count 364
Applied a total of 2261 rules in 252 ms. Remains 159 /2117 variables (removed 1958) and now considering 364/2715 (removed 2351) transitions.
[2022-05-16 11:21:33] [INFO ] Flow matrix only has 285 transitions (discarded 79 similar events)
// Phase 1: matrix 285 rows 159 cols
[2022-05-16 11:21:33] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:21:34] [INFO ] Implicit Places using invariants in 326 ms returned []
[2022-05-16 11:21:34] [INFO ] Flow matrix only has 285 transitions (discarded 79 similar events)
// Phase 1: matrix 285 rows 159 cols
[2022-05-16 11:21:34] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:21:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 11:21:34] [INFO ] Implicit Places using invariants and state equation in 287 ms returned [17, 87, 120]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 618 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/2117 places, 364/2715 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 154 transition count 362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 153 transition count 361
Applied a total of 3 rules in 10 ms. Remains 153 /156 variables (removed 3) and now considering 361/364 (removed 3) transitions.
[2022-05-16 11:21:34] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
// Phase 1: matrix 282 rows 153 cols
[2022-05-16 11:21:34] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:21:34] [INFO ] Implicit Places using invariants in 76 ms returned []
[2022-05-16 11:21:34] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
// Phase 1: matrix 282 rows 153 cols
[2022-05-16 11:21:34] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:21:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 11:21:34] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 153/2117 places, 361/2715 transitions.
Finished structural reductions, in 2 iterations. Remains : 153/2117 places, 361/2715 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s14 1), p2:(AND (EQ s48 1) (NEQ s21 1)), p1:(NEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 32 steps with 1 reset in 1 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-13 finished in 1240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Graph (trivial) has 2598 edges and 2117 vertex of which 989 / 2117 are part of one of the 88 SCC in 1 ms
Free SCC test removed 901 places
Ensure Unique test removed 1054 transitions
Reduce isomorphic transitions removed 1054 transitions.
Graph (complete) has 1891 edges and 1216 vertex of which 1205 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 663 transitions
Trivial Post-agglo rules discarded 663 transitions
Performed 663 trivial Post agglomeration. Transition count delta: 663
Iterating post reduction 0 with 663 rules applied. Total rules applied 665 place count 1204 transition count 991
Reduce places removed 663 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 696 rules applied. Total rules applied 1361 place count 541 transition count 958
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1376 place count 526 transition count 958
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 1376 place count 526 transition count 894
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 1504 place count 462 transition count 894
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1527 place count 439 transition count 857
Iterating global reduction 3 with 23 rules applied. Total rules applied 1550 place count 439 transition count 857
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 1554 place count 439 transition count 853
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1558 place count 435 transition count 853
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1571 place count 422 transition count 834
Iterating global reduction 5 with 13 rules applied. Total rules applied 1584 place count 422 transition count 834
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1591 place count 422 transition count 827
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1593 place count 420 transition count 823
Iterating global reduction 6 with 2 rules applied. Total rules applied 1595 place count 420 transition count 823
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1597 place count 418 transition count 819
Iterating global reduction 6 with 2 rules applied. Total rules applied 1599 place count 418 transition count 819
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1601 place count 416 transition count 815
Iterating global reduction 6 with 2 rules applied. Total rules applied 1603 place count 416 transition count 815
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1605 place count 414 transition count 811
Iterating global reduction 6 with 2 rules applied. Total rules applied 1607 place count 414 transition count 811
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1609 place count 412 transition count 807
Iterating global reduction 6 with 2 rules applied. Total rules applied 1611 place count 412 transition count 807
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1613 place count 410 transition count 803
Iterating global reduction 6 with 2 rules applied. Total rules applied 1615 place count 410 transition count 803
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1617 place count 408 transition count 799
Iterating global reduction 6 with 2 rules applied. Total rules applied 1619 place count 408 transition count 799
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1621 place count 406 transition count 785
Iterating global reduction 6 with 2 rules applied. Total rules applied 1623 place count 406 transition count 785
Performed 188 Post agglomeration using F-continuation condition with reduction of 112 identical transitions.
Deduced a syphon composed of 188 places in 0 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 6 with 376 rules applied. Total rules applied 1999 place count 218 transition count 485
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2011 place count 218 transition count 473
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 2018 place count 211 transition count 464
Iterating global reduction 7 with 7 rules applied. Total rules applied 2025 place count 211 transition count 464
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2027 place count 209 transition count 461
Iterating global reduction 7 with 2 rules applied. Total rules applied 2029 place count 209 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2030 place count 209 transition count 460
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2031 place count 208 transition count 458
Iterating global reduction 8 with 1 rules applied. Total rules applied 2032 place count 208 transition count 458
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2033 place count 207 transition count 456
Iterating global reduction 8 with 1 rules applied. Total rules applied 2034 place count 207 transition count 456
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2035 place count 206 transition count 454
Iterating global reduction 8 with 1 rules applied. Total rules applied 2036 place count 206 transition count 454
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2037 place count 205 transition count 452
Iterating global reduction 8 with 1 rules applied. Total rules applied 2038 place count 205 transition count 452
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2039 place count 204 transition count 450
Iterating global reduction 8 with 1 rules applied. Total rules applied 2040 place count 204 transition count 450
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2041 place count 203 transition count 443
Iterating global reduction 8 with 1 rules applied. Total rules applied 2042 place count 203 transition count 443
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 2076 place count 186 transition count 422
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 2093 place count 186 transition count 405
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 2139 place count 163 transition count 452
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 2161 place count 163 transition count 430
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 2173 place count 151 transition count 406
Iterating global reduction 10 with 12 rules applied. Total rules applied 2185 place count 151 transition count 406
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 2193 place count 151 transition count 398
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 11 with 50 rules applied. Total rules applied 2243 place count 151 transition count 348
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2244 place count 150 transition count 347
Applied a total of 2244 rules in 230 ms. Remains 150 /2117 variables (removed 1967) and now considering 347/2715 (removed 2368) transitions.
[2022-05-16 11:21:35] [INFO ] Flow matrix only has 270 transitions (discarded 77 similar events)
// Phase 1: matrix 270 rows 150 cols
[2022-05-16 11:21:35] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:21:35] [INFO ] Implicit Places using invariants in 134 ms returned []
[2022-05-16 11:21:35] [INFO ] Flow matrix only has 270 transitions (discarded 77 similar events)
// Phase 1: matrix 270 rows 150 cols
[2022-05-16 11:21:35] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-16 11:21:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 11:21:35] [INFO ] Implicit Places using invariants and state equation in 361 ms returned [10, 76, 109]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 498 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/2117 places, 347/2715 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 345
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 144 transition count 344
Applied a total of 3 rules in 11 ms. Remains 144 /147 variables (removed 3) and now considering 344/347 (removed 3) transitions.
[2022-05-16 11:21:35] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
// Phase 1: matrix 267 rows 144 cols
[2022-05-16 11:21:35] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:21:35] [INFO ] Implicit Places using invariants in 113 ms returned []
[2022-05-16 11:21:35] [INFO ] Flow matrix only has 267 transitions (discarded 77 similar events)
// Phase 1: matrix 267 rows 144 cols
[2022-05-16 11:21:35] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:21:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 11:21:35] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 144/2117 places, 344/2715 transitions.
Finished structural reductions, in 2 iterations. Remains : 144/2117 places, 344/2715 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s137 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-401-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-14 finished in 1115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X((X(p0)&&p1))))))'
Support contains 2 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2715/2715 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2096 transition count 2693
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2096 transition count 2693
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 2096 transition count 2691
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 55 place count 2085 transition count 2678
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 2085 transition count 2678
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 2078 transition count 2669
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 2078 transition count 2669
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 2078 transition count 2667
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 2075 transition count 2663
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 2075 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 2074 transition count 2662
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 2074 transition count 2662
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 2074 transition count 2661
Applied a total of 91 rules in 923 ms. Remains 2074 /2117 variables (removed 43) and now considering 2661/2715 (removed 54) transitions.
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:21:36] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-16 11:21:37] [INFO ] Implicit Places using invariants in 477 ms returned []
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:21:37] [INFO ] Computed 5 place invariants in 15 ms
[2022-05-16 11:21:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:21:38] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
// Phase 1: matrix 2661 rows 2074 cols
[2022-05-16 11:21:38] [INFO ] Computed 5 place invariants in 11 ms
[2022-05-16 11:21:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 11:21:40] [INFO ] Dead Transitions using invariants and state equation in 2023 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2074/2117 places, 2661/2715 transitions.
Finished structural reductions, in 1 iterations. Remains : 2074/2117 places, 2661/2715 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s559 1), p0:(EQ s1681 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 238 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-15 finished in 4253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U G((X(!X(p1))||(p0 U G(p2))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X(X(p1))&&(G(X(X(p2)))||p2)))))'
[2022-05-16 11:21:41] [INFO ] Flatten gal took : 103 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17991239202855593938
[2022-05-16 11:21:41] [INFO ] Too many transitions (2715) to apply POR reductions. Disabling POR matrices.
[2022-05-16 11:21:41] [INFO ] Applying decomposition
[2022-05-16 11:21:41] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17991239202855593938
Running compilation step : cd /tmp/ltsmin17991239202855593938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 11:21:41] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9228140054976769372.txt' '-o' '/tmp/graph9228140054976769372.bin' '-w' '/tmp/graph9228140054976769372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9228140054976769372.bin' '-l' '-1' '-v' '-w' '/tmp/graph9228140054976769372.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:21:41] [INFO ] Decomposing Gal with order
[2022-05-16 11:21:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:21:42] [INFO ] Removed a total of 722 redundant transitions.
[2022-05-16 11:21:42] [INFO ] Flatten gal took : 154 ms
[2022-05-16 11:21:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 43 ms.
[2022-05-16 11:21:42] [INFO ] Time to serialize gal into /tmp/LTLFireability17824124752977875740.gal : 26 ms
[2022-05-16 11:21:42] [INFO ] Time to serialize properties into /tmp/LTLFireability16417058115132103328.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17824124752977875740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16417058115132103328.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !(((("(i22.u412.p1711==1)")U("(i44.i0.i2.u794.p3184==1)"))U(G((X(!(X("(i44.i0.i2.u794.p3184==1)"))))||(("(i22.u412.p1711==1)")U(G("(i1...185
Formula 0 simplified : !(("(i22.u412.p1711==1)" U "(i44.i0.i2.u794.p3184==1)") U G(X!X"(i44.i0.i2.u794.p3184==1)" | ("(i22.u412.p1711==1)" U G"(i17.i0.i4.u...172
Compilation finished in 9808 ms.
Running link step : cd /tmp/ltsmin17991239202855593938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin17991239202855593938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true)) U []((X(!X((LTLAPp1==true)))||((LTLAPp0==true) U []((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t33, t229, t283, t314, t393, t464, t517, t671, t752, t813, t933, t985, t1167, t1219, t1279, t...3061
Computing Next relation with stutter on 4.17432e+06 deadlock states
51 unique states visited
51 strongly connected components in search stack
52 transitions explored
51 items max in DFS search stack
5567 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,56.0981,949336,1,0,1.49376e+06,116981,32252,3.97762e+06,677,926205,6695213
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-401-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((F("(i0.u5.p8==1)"))||((X(X("(i17.i0.i3.u251.p1128==1)")))&&((G(X(X("(i36.i2.i0.u714.p2912==0)"))))||("(i36.i2.i0.u714.p2912==0)"...161
Formula 1 simplified : !X(F"(i0.u5.p8==1)" | (XX"(i17.i0.i3.u251.p1128==1)" & ("(i36.i2.i0.u714.p2912==0)" | GXX"(i36.i2.i0.u714.p2912==0)")))
Computing Next relation with stutter on 4.17432e+06 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
2 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,56.1175,949860,1,0,1.49397e+06,116981,32351,3.97786e+06,681,926205,6698102
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-401-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 487519 ms.

BK_STOP 1652700231554

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-401, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-smll-165252095600372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-401.tgz
mv CloudReconfiguration-PT-401 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;