Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624207900128.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CloudReconfiguration-PT-312, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624207900128
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 19:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Apr 11 19:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 19:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 19:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716306865151

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-312
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 15:54:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 15:54:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:54:26] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-21 15:54:26] [INFO ] Transformed 2585 places.
[2024-05-21 15:54:27] [INFO ] Transformed 3095 transitions.
[2024-05-21 15:54:27] [INFO ] Found NUPN structural information;
[2024-05-21 15:54:27] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 459 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-312-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-312-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 519 places :
Symmetric choice reduction at 0 with 519 rule applications. Total rules 519 place count 2066 transition count 2576
Iterating global reduction 0 with 519 rules applied. Total rules applied 1038 place count 2066 transition count 2576
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1066 place count 2066 transition count 2548
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1305 place count 1827 transition count 2309
Iterating global reduction 1 with 239 rules applied. Total rules applied 1544 place count 1827 transition count 2309
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 1630 place count 1741 transition count 2223
Iterating global reduction 1 with 86 rules applied. Total rules applied 1716 place count 1741 transition count 2223
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1733 place count 1741 transition count 2206
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1778 place count 1696 transition count 2161
Iterating global reduction 2 with 45 rules applied. Total rules applied 1823 place count 1696 transition count 2161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1830 place count 1696 transition count 2154
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1866 place count 1660 transition count 2113
Iterating global reduction 3 with 36 rules applied. Total rules applied 1902 place count 1660 transition count 2113
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1926 place count 1636 transition count 2089
Iterating global reduction 3 with 24 rules applied. Total rules applied 1950 place count 1636 transition count 2089
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1971 place count 1615 transition count 2068
Iterating global reduction 3 with 21 rules applied. Total rules applied 1992 place count 1615 transition count 2068
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2013 place count 1594 transition count 2047
Iterating global reduction 3 with 21 rules applied. Total rules applied 2034 place count 1594 transition count 2047
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2052 place count 1576 transition count 2019
Iterating global reduction 3 with 18 rules applied. Total rules applied 2070 place count 1576 transition count 2019
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2076 place count 1570 transition count 2010
Iterating global reduction 3 with 6 rules applied. Total rules applied 2082 place count 1570 transition count 2010
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2088 place count 1564 transition count 2002
Iterating global reduction 3 with 6 rules applied. Total rules applied 2094 place count 1564 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2095 place count 1564 transition count 2001
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2097 place count 1562 transition count 1999
Iterating global reduction 4 with 2 rules applied. Total rules applied 2099 place count 1562 transition count 1999
Applied a total of 2099 rules in 1412 ms. Remains 1562 /2585 variables (removed 1023) and now considering 1999/3095 (removed 1096) transitions.
// Phase 1: matrix 1999 rows 1562 cols
[2024-05-21 15:54:28] [INFO ] Computed 4 invariants in 34 ms
[2024-05-21 15:54:29] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-21 15:54:29] [INFO ] Invariant cache hit.
[2024-05-21 15:54:30] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
[2024-05-21 15:54:30] [INFO ] Invariant cache hit.
[2024-05-21 15:54:30] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/2585 places, 1999/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3738 ms. Remains : 1562/2585 places, 1999/3095 transitions.
Support contains 35 out of 1562 places after structural reductions.
[2024-05-21 15:54:31] [INFO ] Flatten gal took : 125 ms
[2024-05-21 15:54:31] [INFO ] Flatten gal took : 69 ms
[2024-05-21 15:54:31] [INFO ] Input system was already deterministic with 1999 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 35) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) 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 26) seen :0
Running SMT prover for 26 properties.
[2024-05-21 15:54:32] [INFO ] Invariant cache hit.
[2024-05-21 15:54:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 15:54:35] [INFO ] After 2982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2024-05-21 15:54:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-21 15:54:39] [INFO ] After 2385ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :25
[2024-05-21 15:54:41] [INFO ] After 5113ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :25
Attempting to minimize the solution found.
Minimization took 1539 ms.
[2024-05-21 15:54:43] [INFO ] After 8107ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :25
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 21 properties in 191 ms.
Support contains 6 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1894 edges and 1562 vertex of which 676 / 1562 are part of one of the 62 SCC in 10 ms
Free SCC test removed 614 places
Drop transitions removed 773 transitions
Reduce isomorphic transitions removed 773 transitions.
Graph (complete) has 1401 edges and 948 vertex of which 939 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 524 transitions
Trivial Post-agglo rules discarded 524 transitions
Performed 524 trivial Post agglomeration. Transition count delta: 524
Iterating post reduction 0 with 530 rules applied. Total rules applied 532 place count 939 transition count 692
Reduce places removed 524 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 581 rules applied. Total rules applied 1113 place count 415 transition count 635
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 43 rules applied. Total rules applied 1156 place count 379 transition count 628
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 1165 place count 373 transition count 625
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1168 place count 372 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1169 place count 371 transition count 623
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 52 Pre rules applied. Total rules applied 1169 place count 371 transition count 571
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 6 with 104 rules applied. Total rules applied 1273 place count 319 transition count 571
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1283 place count 309 transition count 558
Iterating global reduction 6 with 10 rules applied. Total rules applied 1293 place count 309 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 3 rules applied. Total rules applied 1296 place count 309 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1298 place count 307 transition count 555
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1306 place count 299 transition count 545
Iterating global reduction 8 with 8 rules applied. Total rules applied 1314 place count 299 transition count 545
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 8 with 7 rules applied. Total rules applied 1321 place count 299 transition count 538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1322 place count 298 transition count 538
Performed 160 Post agglomeration using F-continuation condition with reduction of 104 identical transitions.
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 10 with 320 rules applied. Total rules applied 1642 place count 138 transition count 274
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 1664 place count 138 transition count 252
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1668 place count 134 transition count 247
Iterating global reduction 11 with 4 rules applied. Total rules applied 1672 place count 134 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1673 place count 134 transition count 246
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 1695 place count 123 transition count 234
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1709 place count 123 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1711 place count 122 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1713 place count 122 transition count 217
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 1715 place count 121 transition count 216
Performed 35 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 14 with 70 rules applied. Total rules applied 1785 place count 86 transition count 251
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 14 with 28 rules applied. Total rules applied 1813 place count 86 transition count 223
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 1834 place count 65 transition count 181
Iterating global reduction 15 with 21 rules applied. Total rules applied 1855 place count 65 transition count 181
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 1867 place count 65 transition count 169
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 1873 place count 59 transition count 157
Iterating global reduction 16 with 6 rules applied. Total rules applied 1879 place count 59 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 1884 place count 59 transition count 152
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 1889 place count 59 transition count 147
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 17 with 2 rules applied. Total rules applied 1891 place count 58 transition count 146
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 1896 place count 58 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1897 place count 57 transition count 145
Applied a total of 1897 rules in 140 ms. Remains 57 /1562 variables (removed 1505) and now considering 145/1999 (removed 1854) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 57/1562 places, 145/1999 transitions.
Incomplete random walk after 10000 steps, including 995 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:54:43] [INFO ] Flow matrix only has 134 transitions (discarded 11 similar events)
// Phase 1: matrix 134 rows 57 cols
[2024-05-21 15:54:43] [INFO ] Computed 3 invariants in 6 ms
[2024-05-21 15:54:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:54:43] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:54:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:54:43] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 15:54:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 15:54:43] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 15:54:43] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 15:54:43] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 145/145 transitions.
Graph (trivial) has 11 edges and 57 vertex of which 4 / 57 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 55 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 53 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 52 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 52 transition count 138
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 2 with 2 rules applied. Total rules applied 9 place count 51 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 51 transition count 136
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 51 transition count 135
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 3 with 2 rules applied. Total rules applied 13 place count 50 transition count 134
Applied a total of 13 rules in 10 ms. Remains 50 /57 variables (removed 7) and now considering 134/145 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 50/57 places, 134/145 transitions.
Incomplete random walk after 10000 steps, including 1080 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1263 steps, run visited all 1 properties in 11 ms. (steps per millisecond=114 )
Probabilistic random walk after 1263 steps, saw 517 distinct states, run finished after 11 ms. (steps per millisecond=114 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2179 edges and 1562 vertex of which 1553 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.29 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1 U (G(p1)||(p1&&(p0 U (G(p0)||(p0&&G(p2)))))))))))'
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1549 transition count 1984
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 1540 transition count 1975
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 1540 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 1540 transition count 1974
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 1534 transition count 1967
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 1534 transition count 1967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 1534 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 1529 transition count 1960
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 1529 transition count 1960
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 75 place count 1524 transition count 1954
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 1524 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 1524 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 84 place count 1521 transition count 1950
Iterating global reduction 4 with 3 rules applied. Total rules applied 87 place count 1521 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 90 place count 1518 transition count 1947
Iterating global reduction 4 with 3 rules applied. Total rules applied 93 place count 1518 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 96 place count 1515 transition count 1942
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 1515 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 102 place count 1512 transition count 1936
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 1510 transition count 1934
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 1510 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 1510 transition count 1933
Applied a total of 110 rules in 465 ms. Remains 1510 /1562 variables (removed 52) and now considering 1933/1999 (removed 66) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2024-05-21 15:54:44] [INFO ] Computed 4 invariants in 23 ms
[2024-05-21 15:54:45] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-21 15:54:45] [INFO ] Invariant cache hit.
[2024-05-21 15:54:46] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2024-05-21 15:54:46] [INFO ] Invariant cache hit.
[2024-05-21 15:54:46] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1562 places, 1933/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2469 ms. Remains : 1510/1562 places, 1933/1999 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0, 2} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 2} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={2} source=2 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1, 2} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 2} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={2} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1, 2} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(NEQ s46 1), p1:(NEQ s241 1), p2:(NEQ s1053 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 703 reset in 323 ms.
Product exploration explored 100000 steps with 708 reset in 270 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2110 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 167 ms. Reduced automaton from 5 states, 28 edges and 3 AP (stutter sensitive) to 5 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 257006 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257006 steps, saw 63170 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 11 properties.
[2024-05-21 15:54:52] [INFO ] Invariant cache hit.
[2024-05-21 15:54:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 15:54:53] [INFO ] After 1247ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2024-05-21 15:54:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:54:55] [INFO ] After 1058ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2024-05-21 15:54:55] [INFO ] After 1891ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 455 ms.
[2024-05-21 15:54:56] [INFO ] After 2928ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 1 properties in 38 ms.
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1837 edges and 1510 vertex of which 675 / 1510 are part of one of the 62 SCC in 3 ms
Free SCC test removed 613 places
Drop transitions removed 772 transitions
Reduce isomorphic transitions removed 772 transitions.
Graph (complete) has 1333 edges and 897 vertex of which 888 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 0 with 502 rules applied. Total rules applied 504 place count 888 transition count 655
Reduce places removed 495 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 554 rules applied. Total rules applied 1058 place count 393 transition count 596
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 41 rules applied. Total rules applied 1099 place count 355 transition count 593
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 1104 place count 353 transition count 590
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1107 place count 352 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1108 place count 351 transition count 588
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 1108 place count 351 transition count 537
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 1210 place count 300 transition count 537
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1219 place count 291 transition count 525
Iterating global reduction 6 with 9 rules applied. Total rules applied 1228 place count 291 transition count 525
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 1230 place count 291 transition count 523
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1232 place count 289 transition count 523
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1238 place count 283 transition count 517
Iterating global reduction 8 with 6 rules applied. Total rules applied 1244 place count 283 transition count 517
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1250 place count 283 transition count 511
Performed 151 Post agglomeration using F-continuation condition with reduction of 99 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 9 with 302 rules applied. Total rules applied 1552 place count 132 transition count 261
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1572 place count 132 transition count 241
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1575 place count 129 transition count 238
Iterating global reduction 10 with 3 rules applied. Total rules applied 1578 place count 129 transition count 238
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1602 place count 117 transition count 224
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1617 place count 117 transition count 209
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 1619 place count 116 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1621 place count 116 transition count 206
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 12 with 2 rules applied. Total rules applied 1623 place count 115 transition count 205
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1624 place count 115 transition count 204
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 13 with 68 rules applied. Total rules applied 1692 place count 81 transition count 235
Drop transitions removed 11 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 13 with 38 rules applied. Total rules applied 1730 place count 81 transition count 197
Discarding 22 places :
Symmetric choice reduction at 14 with 22 rule applications. Total rules 1752 place count 59 transition count 161
Iterating global reduction 14 with 22 rules applied. Total rules applied 1774 place count 59 transition count 161
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 1787 place count 59 transition count 148
Discarding 6 places :
Symmetric choice reduction at 15 with 6 rule applications. Total rules 1793 place count 53 transition count 136
Iterating global reduction 15 with 6 rules applied. Total rules applied 1799 place count 53 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1805 place count 53 transition count 130
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 16 with 11 rules applied. Total rules applied 1816 place count 53 transition count 119
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1817 place count 52 transition count 116
Iterating global reduction 16 with 1 rules applied. Total rules applied 1818 place count 52 transition count 116
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1819 place count 51 transition count 115
Iterating global reduction 16 with 1 rules applied. Total rules applied 1820 place count 51 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1821 place count 51 transition count 114
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 17 with 2 rules applied. Total rules applied 1823 place count 50 transition count 113
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1824 place count 50 transition count 112
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 1827 place count 50 transition count 109
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 1832 place count 47 transition count 107
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 1834 place count 47 transition count 107
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1835 place count 47 transition count 106
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1836 place count 46 transition count 105
Iterating global reduction 18 with 1 rules applied. Total rules applied 1837 place count 46 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1838 place count 45 transition count 104
Applied a total of 1838 rules in 88 ms. Remains 45 /1510 variables (removed 1465) and now considering 104/1933 (removed 1829) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 45/1510 places, 104/1933 transitions.
Finished random walk after 2527 steps, including 38 resets, run visited all 7 properties in 7 ms. (steps per millisecond=361 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND p0 p1 p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1 p2))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 19 factoid took 526 ms. Reduced automaton from 5 states, 28 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-312-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-312-LTLFireability-00 finished in 12628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F((p0&&X(F(p1))))) U p2))'
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1550 transition count 1987
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1550 transition count 1987
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 1550 transition count 1985
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 1541 transition count 1976
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 1541 transition count 1976
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 1541 transition count 1975
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 1535 transition count 1968
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 1535 transition count 1968
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 1535 transition count 1967
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 1530 transition count 1960
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 1530 transition count 1960
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 1526 transition count 1955
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 1526 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 1526 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 79 place count 1524 transition count 1952
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 1524 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 1522 transition count 1950
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 1522 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 87 place count 1520 transition count 1947
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 1520 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 91 place count 1518 transition count 1943
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 1518 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 1517 transition count 1942
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 1517 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 1517 transition count 1941
Applied a total of 96 rules in 459 ms. Remains 1517 /1562 variables (removed 45) and now considering 1941/1999 (removed 58) transitions.
// Phase 1: matrix 1941 rows 1517 cols
[2024-05-21 15:54:57] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 15:54:57] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 15:54:57] [INFO ] Invariant cache hit.
[2024-05-21 15:54:58] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2024-05-21 15:54:58] [INFO ] Invariant cache hit.
[2024-05-21 15:54:59] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1517/1562 places, 1941/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2419 ms. Remains : 1517/1562 places, 1941/1999 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NEQ s423 1) (EQ s780 1)), p0:(EQ s780 1), p1:(EQ s1437 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-02 finished in 2576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1)) U (X(X(X(p2))) U G(p3))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1548 transition count 1985
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1548 transition count 1985
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1548 transition count 1983
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 1538 transition count 1973
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 1538 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 1538 transition count 1972
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 1531 transition count 1964
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 1531 transition count 1964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 1531 transition count 1963
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 72 place count 1525 transition count 1955
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 1525 transition count 1955
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 83 place count 1520 transition count 1949
Iterating global reduction 3 with 5 rules applied. Total rules applied 88 place count 1520 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 92 place count 1517 transition count 1945
Iterating global reduction 4 with 3 rules applied. Total rules applied 95 place count 1517 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 98 place count 1514 transition count 1942
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 1514 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 104 place count 1511 transition count 1937
Iterating global reduction 4 with 3 rules applied. Total rules applied 107 place count 1511 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 1508 transition count 1931
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 1508 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 1506 transition count 1929
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 1506 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 118 place count 1506 transition count 1928
Applied a total of 118 rules in 460 ms. Remains 1506 /1562 variables (removed 56) and now considering 1928/1999 (removed 71) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 15:55:00] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 15:55:00] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 15:55:00] [INFO ] Invariant cache hit.
[2024-05-21 15:55:01] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2024-05-21 15:55:01] [INFO ] Invariant cache hit.
[2024-05-21 15:55:01] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1562 places, 1928/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2326 ms. Remains : 1506/1562 places, 1928/1999 transitions.
Stuttering acceptance computed with spot in 856 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p3) p2), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(OR p1 p0), acceptance={} source=3 dest: 9}], [{ cond=(NOT p3), acceptance={} source=4 dest: 6}, { cond=p3, acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=5 dest: 9}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 10}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=5 dest: 11}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 7}, { cond=(OR p1 p0), acceptance={} source=9 dest: 12}], [{ cond=(NOT p3), acceptance={} source=10 dest: 7}, { cond=p3, acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=11 dest: 7}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=11 dest: 12}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=11 dest: 13}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=11 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=12 dest: 15}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=12 dest: 16}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=13 dest: 8}, { cond=(AND p3 (NOT p2)), acceptance={} source=13 dest: 17}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=14 dest: 8}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={} source=14 dest: 15}, { cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2))), acceptance={} source=14 dest: 16}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=14 dest: 17}, { cond=(OR (AND p3 p1 (NOT p2)) (AND p3 p0 (NOT p2))), acceptance={} source=14 dest: 18}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=15 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={0} source=15 dest: 15}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=16 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=16 dest: 15}, { cond=(OR p1 p0), acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p3) p2), acceptance={} source=17 dest: 8}, { cond=(AND p3 p2), acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=18 dest: 8}, { cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={} source=18 dest: 15}, { cond=(OR (AND (NOT p3) p1 p2) (AND (NOT p3) p0 p2)), acceptance={} source=18 dest: 16}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={} source=18 dest: 17}, { cond=(OR (AND p3 p1 p2) (AND p3 p0 p2)), acceptance={} source=18 dest: 18}]], initial=0, aps=[p3:(NEQ s1480 1), p1:(EQ s909 1), p0:(EQ s602 1), p2:(EQ s577 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, 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]]
Product exploration explored 100000 steps with 16631 reset in 529 ms.
Product exploration explored 100000 steps with 16628 reset in 449 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p3 p1) (AND p3 p0)))), (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p0)))), (X p3), (X (AND p3 (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p3 p1) (AND p3 p0))))), (X (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p0))))), (X (X p3)), (X (X (AND p3 (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 114 ms. Reduced automaton from 19 states, 53 edges and 4 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 377 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) p2)]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-21 15:55:04] [INFO ] Invariant cache hit.
[2024-05-21 15:55:04] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:55:05] [INFO ] After 821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:55:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:55:06] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 15:55:06] [INFO ] After 739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-21 15:55:06] [INFO ] After 989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p3 p1) (AND p3 p0)))), (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p0)))), (X p3), (X (AND p3 (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p3 p1) (AND p3 p0))))), (X (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p0))))), (X (X p3)), (X (X (AND p3 (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : [(F (AND (NOT p3) p2)), (F (NOT (AND p3 (NOT p2)))), (F (AND p3 p2)), (F (NOT p3)), (F (AND (NOT p3) (NOT p2))), (F p2)]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p3) (NOT p2)))
Knowledge based reduction with 16 factoid took 277 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-312-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-312-LTLFireability-03 finished in 7252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1906 edges and 1562 vertex of which 698 / 1562 are part of one of the 63 SCC in 7 ms
Free SCC test removed 635 places
Ensure Unique test removed 738 transitions
Reduce isomorphic transitions removed 738 transitions.
Graph (complete) has 1435 edges and 927 vertex of which 918 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 917 transition count 751
Reduce places removed 504 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 528 rules applied. Total rules applied 1034 place count 413 transition count 727
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1046 place count 401 transition count 727
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1046 place count 401 transition count 681
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1138 place count 355 transition count 681
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1155 place count 338 transition count 655
Iterating global reduction 3 with 17 rules applied. Total rules applied 1172 place count 338 transition count 655
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 1175 place count 338 transition count 652
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1177 place count 336 transition count 652
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1190 place count 323 transition count 633
Iterating global reduction 5 with 13 rules applied. Total rules applied 1203 place count 323 transition count 633
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 5 with 8 rules applied. Total rules applied 1211 place count 323 transition count 625
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1212 place count 322 transition count 625
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1214 place count 320 transition count 621
Iterating global reduction 7 with 2 rules applied. Total rules applied 1216 place count 320 transition count 621
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1218 place count 318 transition count 617
Iterating global reduction 7 with 2 rules applied. Total rules applied 1220 place count 318 transition count 617
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1222 place count 316 transition count 613
Iterating global reduction 7 with 2 rules applied. Total rules applied 1224 place count 316 transition count 613
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1226 place count 314 transition count 609
Iterating global reduction 7 with 2 rules applied. Total rules applied 1228 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1230 place count 312 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1232 place count 312 transition count 605
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1233 place count 311 transition count 598
Iterating global reduction 7 with 1 rules applied. Total rules applied 1234 place count 311 transition count 598
Performed 150 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 7 with 300 rules applied. Total rules applied 1534 place count 161 transition count 361
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1547 place count 161 transition count 348
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1552 place count 156 transition count 341
Iterating global reduction 8 with 5 rules applied. Total rules applied 1557 place count 156 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1558 place count 156 transition count 340
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1580 place count 145 transition count 328
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1592 place count 145 transition count 316
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1628 place count 127 transition count 350
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 1647 place count 127 transition count 331
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1656 place count 118 transition count 313
Iterating global reduction 11 with 9 rules applied. Total rules applied 1665 place count 118 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1671 place count 118 transition count 307
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 12 with 37 rules applied. Total rules applied 1708 place count 118 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1709 place count 117 transition count 269
Applied a total of 1709 rules in 108 ms. Remains 117 /1562 variables (removed 1445) and now considering 269/1999 (removed 1730) transitions.
[2024-05-21 15:55:07] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
// Phase 1: matrix 213 rows 117 cols
[2024-05-21 15:55:07] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 15:55:07] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 15:55:07] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
[2024-05-21 15:55:07] [INFO ] Invariant cache hit.
[2024-05-21 15:55:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 15:55:07] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [11, 79]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 164 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1562 places, 269/1999 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 267
Applied a total of 1 rules in 10 ms. Remains 113 /115 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2024-05-21 15:55:07] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
// Phase 1: matrix 211 rows 113 cols
[2024-05-21 15:55:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 15:55:07] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 15:55:07] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 15:55:07] [INFO ] Invariant cache hit.
[2024-05-21 15:55:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:55:07] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1562 places, 267/1999 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 113/1562 places, 267/1999 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s73 1), p1:(NEQ s8 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 336 steps with 32 reset in 6 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-04 finished in 472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U p2))))'
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1549 transition count 1984
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 1540 transition count 1975
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 1540 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 1540 transition count 1974
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 1534 transition count 1967
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 1534 transition count 1967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 1534 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 1529 transition count 1959
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 1529 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 74 place count 1525 transition count 1954
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 1525 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 1525 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 1523 transition count 1951
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 1523 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 1521 transition count 1949
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 1521 transition count 1949
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 89 place count 1519 transition count 1945
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 1519 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 93 place count 1517 transition count 1941
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 1517 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 97 place count 1515 transition count 1939
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 1515 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 1515 transition count 1938
Applied a total of 100 rules in 745 ms. Remains 1515 /1562 variables (removed 47) and now considering 1938/1999 (removed 61) transitions.
// Phase 1: matrix 1938 rows 1515 cols
[2024-05-21 15:55:08] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 15:55:08] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-21 15:55:08] [INFO ] Invariant cache hit.
[2024-05-21 15:55:09] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2024-05-21 15:55:09] [INFO ] Invariant cache hit.
[2024-05-21 15:55:10] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1515/1562 places, 1938/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2697 ms. Remains : 1515/1562 places, 1938/1999 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(EQ s1454 1), p0:(EQ s1120 0), p2:(EQ s484 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-05 finished in 2977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1548 transition count 1985
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1548 transition count 1985
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1548 transition count 1983
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 1538 transition count 1973
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 1538 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 1538 transition count 1972
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 1531 transition count 1964
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 1531 transition count 1964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 1531 transition count 1963
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 72 place count 1525 transition count 1955
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 1525 transition count 1955
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 83 place count 1520 transition count 1949
Iterating global reduction 3 with 5 rules applied. Total rules applied 88 place count 1520 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 92 place count 1517 transition count 1945
Iterating global reduction 4 with 3 rules applied. Total rules applied 95 place count 1517 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 98 place count 1514 transition count 1942
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 1514 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 104 place count 1511 transition count 1937
Iterating global reduction 4 with 3 rules applied. Total rules applied 107 place count 1511 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 1508 transition count 1931
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 1508 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 1506 transition count 1929
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 1506 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 118 place count 1506 transition count 1928
Applied a total of 118 rules in 457 ms. Remains 1506 /1562 variables (removed 56) and now considering 1928/1999 (removed 71) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 15:55:10] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 15:55:11] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-21 15:55:11] [INFO ] Invariant cache hit.
[2024-05-21 15:55:11] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
[2024-05-21 15:55:11] [INFO ] Invariant cache hit.
[2024-05-21 15:55:12] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1562 places, 1928/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2359 ms. Remains : 1506/1562 places, 1928/1999 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s628 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 728 reset in 189 ms.
Product exploration explored 100000 steps with 701 reset in 168 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 402573 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 402573 steps, saw 100091 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:55:16] [INFO ] Invariant cache hit.
[2024-05-21 15:55:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:55:17] [INFO ] After 598ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 15:55:17] [INFO ] After 702ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-21 15:55:17] [INFO ] After 947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 41 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2024-05-21 15:55:17] [INFO ] Invariant cache hit.
[2024-05-21 15:55:18] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 15:55:18] [INFO ] Invariant cache hit.
[2024-05-21 15:55:19] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2024-05-21 15:55:19] [INFO ] Invariant cache hit.
[2024-05-21 15:55:19] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1878 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 401965 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401965 steps, saw 100071 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:55:23] [INFO ] Invariant cache hit.
[2024-05-21 15:55:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:55:23] [INFO ] After 635ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 15:55:24] [INFO ] After 741ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-21 15:55:24] [INFO ] After 1024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 710 reset in 154 ms.
Product exploration explored 100000 steps with 715 reset in 164 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1839 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 4 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1367 edges and 876 vertex of which 867 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 472 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 472 rules applied. Total rules applied 474 place count 867 transition count 1191
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 486 place count 867 transition count 1179
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 486 place count 867 transition count 1192
Deduced a syphon composed of 493 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 507 place count 867 transition count 1192
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 787 place count 587 transition count 902
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 2 with 280 rules applied. Total rules applied 1067 place count 587 transition count 902
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1079 place count 575 transition count 886
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1091 place count 575 transition count 886
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1097 place count 575 transition count 880
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1109 place count 563 transition count 868
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1121 place count 563 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1123 place count 561 transition count 864
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1125 place count 561 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1127 place count 559 transition count 860
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1129 place count 559 transition count 860
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1133 place count 555 transition count 856
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1137 place count 555 transition count 856
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1139 place count 553 transition count 852
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1141 place count 553 transition count 852
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1143 place count 551 transition count 848
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1145 place count 551 transition count 848
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1149 place count 547 transition count 842
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1153 place count 547 transition count 842
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 543 transition count 826
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 543 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1162 place count 543 transition count 826
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1166 place count 539 transition count 822
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1170 place count 539 transition count 822
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 315 places in 0 ms
Iterating global reduction 4 with 105 rules applied. Total rules applied 1275 place count 539 transition count 897
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1314 place count 539 transition count 858
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 1414 place count 439 transition count 748
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 100 rules applied. Total rules applied 1514 place count 439 transition count 748
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1520 place count 433 transition count 739
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1526 place count 433 transition count 739
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1533 place count 433 transition count 739
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1537 place count 433 transition count 735
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1552 place count 418 transition count 716
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1567 place count 418 transition count 716
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1573 place count 418 transition count 710
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1577 place count 414 transition count 706
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1581 place count 414 transition count 706
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1584 place count 414 transition count 706
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1590 place count 414 transition count 700
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1593 place count 411 transition count 697
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1596 place count 411 transition count 697
Performed 70 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 281 places in 1 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1666 place count 411 transition count 1010
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1787 place count 411 transition count 889
Discarding 125 places :
Symmetric choice reduction at 9 with 125 rule applications. Total rules 1912 place count 286 transition count 560
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 9 with 125 rules applied. Total rules applied 2037 place count 286 transition count 560
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2052 place count 286 transition count 545
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2079 place count 259 transition count 488
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2106 place count 259 transition count 488
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2109 place count 259 transition count 536
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2112 place count 256 transition count 509
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2115 place count 256 transition count 509
Deduced a syphon composed of 138 places in 1 ms
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 2160 place count 256 transition count 464
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2164 place count 252 transition count 460
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2168 place count 252 transition count 460
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2171 place count 252 transition count 520
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2174 place count 249 transition count 505
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2177 place count 249 transition count 505
Deduced a syphon composed of 134 places in 0 ms
Applied a total of 2177 rules in 326 ms. Remains 249 /1506 variables (removed 1257) and now considering 505/1928 (removed 1423) transitions.
[2024-05-21 15:55:25] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-21 15:55:25] [INFO ] Flow matrix only has 448 transitions (discarded 57 similar events)
// Phase 1: matrix 448 rows 249 cols
[2024-05-21 15:55:25] [INFO ] Computed 0 invariants in 4 ms
[2024-05-21 15:55:25] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/1506 places, 505/1928 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 537 ms. Remains : 249/1506 places, 505/1928 transitions.
Built C files in :
/tmp/ltsmin5158308438038237305
[2024-05-21 15:55:25] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5158308438038237305
Running compilation step : cd /tmp/ltsmin5158308438038237305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5158308438038237305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5158308438038237305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 46 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 15:55:29] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 15:55:29] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 15:55:29] [INFO ] Invariant cache hit.
[2024-05-21 15:55:30] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
[2024-05-21 15:55:30] [INFO ] Invariant cache hit.
[2024-05-21 15:55:30] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1967 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Built C files in :
/tmp/ltsmin3853673871897962721
[2024-05-21 15:55:31] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3853673871897962721
Running compilation step : cd /tmp/ltsmin3853673871897962721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3853673871897962721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3853673871897962721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 15:55:34] [INFO ] Flatten gal took : 54 ms
[2024-05-21 15:55:34] [INFO ] Flatten gal took : 51 ms
[2024-05-21 15:55:34] [INFO ] Time to serialize gal into /tmp/LTL1878506221522013809.gal : 12 ms
[2024-05-21 15:55:34] [INFO ] Time to serialize properties into /tmp/LTL3540193059099034994.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1878506221522013809.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14844610554950890594.hoa' '-atoms' '/tmp/LTL3540193059099034994.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3540193059099034994.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14844610554950890594.hoa
Detected timeout of ITS tools.
[2024-05-21 15:55:49] [INFO ] Flatten gal took : 43 ms
[2024-05-21 15:55:49] [INFO ] Flatten gal took : 38 ms
[2024-05-21 15:55:49] [INFO ] Time to serialize gal into /tmp/LTL6296115132862607358.gal : 7 ms
[2024-05-21 15:55:49] [INFO ] Time to serialize properties into /tmp/LTL15223966380647495309.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6296115132862607358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15223966380647495309.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(p1077!=1)"))))))
Formula 0 simplified : XXXF!"(p1077!=1)"
Detected timeout of ITS tools.
[2024-05-21 15:56:04] [INFO ] Flatten gal took : 37 ms
[2024-05-21 15:56:04] [INFO ] Applying decomposition
[2024-05-21 15:56:04] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12214312268551611085.txt' '-o' '/tmp/graph12214312268551611085.bin' '-w' '/tmp/graph12214312268551611085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12214312268551611085.bin' '-l' '-1' '-v' '-w' '/tmp/graph12214312268551611085.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:56:04] [INFO ] Decomposing Gal with order
[2024-05-21 15:56:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:56:05] [INFO ] Removed a total of 528 redundant transitions.
[2024-05-21 15:56:05] [INFO ] Flatten gal took : 125 ms
[2024-05-21 15:56:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 35 ms.
[2024-05-21 15:56:05] [INFO ] Time to serialize gal into /tmp/LTL3505694204102971478.gal : 21 ms
[2024-05-21 15:56:05] [INFO ] Time to serialize properties into /tmp/LTL7577588690992849768.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3505694204102971478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7577588690992849768.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(i17.u254.p1077!=1)"))))))
Formula 0 simplified : XXXF!"(i17.u254.p1077!=1)"
Reverse transition relation is NOT exact ! Due to transitions t26, t199, t282, t315, t393, t464, t513, t516, t682, t763, t794, t823, t872, t944, t995, t116...2041
Computing Next relation with stutter on 140576 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
528 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,5.45681,188724,1,0,328727,10220,22743,653329,542,69050,1249303
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-312-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-312-LTLFireability-06 finished in 61254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||((p1&&(p2 U (p3||G(p2)))) U (G((p1&&(p2 U (p3||G(p2)))))||(p1&&(p2 U (p3||G(p2)))&&G(p4))))))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1550 transition count 1987
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1550 transition count 1987
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 1550 transition count 1985
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 1542 transition count 1977
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 1542 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 1542 transition count 1976
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 49 place count 1536 transition count 1969
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 1536 transition count 1969
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 1530 transition count 1961
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 1530 transition count 1961
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 1525 transition count 1955
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 1525 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 1525 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 1522 transition count 1951
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 1522 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 1519 transition count 1948
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 1519 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 1516 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 1516 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 1513 transition count 1937
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 1511 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 1511 transition count 1934
Applied a total of 107 rules in 555 ms. Remains 1511 /1562 variables (removed 51) and now considering 1934/1999 (removed 65) transitions.
// Phase 1: matrix 1934 rows 1511 cols
[2024-05-21 15:56:12] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 15:56:12] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-21 15:56:12] [INFO ] Invariant cache hit.
[2024-05-21 15:56:13] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
[2024-05-21 15:56:13] [INFO ] Invariant cache hit.
[2024-05-21 15:56:14] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1562 places, 1934/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2536 ms. Remains : 1511/1562 places, 1934/1999 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p3) (NOT p2)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3) (NOT p4)) (AND p0 (NOT p1) (NOT p4))), (NOT p4)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (AND p1 p3) (AND p1 p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p4 (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p1 (NOT p4) p3) (AND (NOT p0) p1 (NOT p4) p2)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) p1 p4 p3) (AND (NOT p0) p1 p4 p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 p4 (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p1 (NOT p4) p3) (AND p0 p1 (NOT p4) p2)), acceptance={} source=4 dest: 4}, { cond=(OR (AND p0 p1 p4 p3) (AND p0 p1 p4 p2)), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND p0 (NOT p1) (NOT p4)) (AND p0 (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=5 dest: 2}, { cond=(OR (AND p0 p1 (NOT p4) p3) (AND p0 p1 (NOT p4) p2)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 p1 p4 p3) (AND p0 p1 p4 p2)), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p1) p4) (AND p4 (NOT p3) (NOT p2))), acceptance={} source=5 dest: 6}], [{ cond=(NOT p4), acceptance={} source=6 dest: 2}, { cond=p4, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s570 0), p1:(NEQ s773 1), p3:(AND (NEQ s570 1) (NEQ s138 1)), p2:(NEQ s138 1), p4:(EQ s1314 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 717 reset in 210 ms.
Product exploration explored 100000 steps with 703 reset in 206 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2111 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2 (NOT p4)), (X (NOT (OR (AND (NOT p0) p1 p4 p3) (AND (NOT p0) p1 p4 p2)))), (X (NOT (AND (NOT p0) p1 p4 (NOT p3) p2))), (X (OR p0 (AND p1 p3) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (OR (AND (NOT p0) p1 (NOT p4) p3) (AND (NOT p0) p1 (NOT p4) p2)))), (X (X (NOT (AND (NOT p0) p1 p4 (NOT p3) p2)))), (X (X (OR p0 (AND p1 p3) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p4) p3) (AND (NOT p0) p1 (NOT p4) p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 (NOT p4) (NOT p3) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p1 p4 p3) (AND (NOT p0) p1 p4 p2))))), true, (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p4) (AND p4 (NOT p3) (NOT p2)))))), (X (X (OR (AND p0 p1 (NOT p4) p3) (AND p0 p1 (NOT p4) p2)))), (X (X (NOT (AND p0 p1 p4 (NOT p3) p2)))), (X (X (NOT (OR (AND p0 p1 p4 p3) (AND p0 p1 p4 p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 171 ms. Reduced automaton from 7 states, 19 edges and 5 AP (stutter sensitive) to 6 states, 18 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p3) (NOT p2)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3) (NOT p4)) (AND p0 (NOT p1) (NOT p4))), (NOT p4)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 188352 steps, run timeout after 3008 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188352 steps, saw 48447 distinct states, run finished after 3008 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 14 properties.
[2024-05-21 15:56:19] [INFO ] Invariant cache hit.
[2024-05-21 15:56:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 15:56:21] [INFO ] After 1530ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2024-05-21 15:56:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 15:56:23] [INFO ] After 1467ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2024-05-21 15:56:24] [INFO ] After 2787ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 731 ms.
[2024-05-21 15:56:25] [INFO ] After 4293ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 12 different solutions.
Finished Parikh walk after 162 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=162 )
Parikh walk visited 12 properties in 28 ms.
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1511/1511 places, 1934/1934 transitions.
Graph (trivial) has 1845 edges and 1511 vertex of which 695 / 1511 are part of one of the 64 SCC in 1 ms
Free SCC test removed 631 places
Drop transitions removed 797 transitions
Reduce isomorphic transitions removed 797 transitions.
Graph (complete) has 1309 edges and 880 vertex of which 871 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 871 transition count 637
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 549 rules applied. Total rules applied 1047 place count 382 transition count 577
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1086 place count 343 transition count 577
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 1086 place count 343 transition count 527
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1186 place count 293 transition count 527
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1197 place count 282 transition count 511
Iterating global reduction 3 with 11 rules applied. Total rules applied 1208 place count 282 transition count 511
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1211 place count 282 transition count 508
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1214 place count 279 transition count 508
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1222 place count 271 transition count 498
Iterating global reduction 5 with 8 rules applied. Total rules applied 1230 place count 271 transition count 498
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1236 place count 271 transition count 492
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1238 place count 269 transition count 480
Iterating global reduction 6 with 2 rules applied. Total rules applied 1240 place count 269 transition count 480
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1241 place count 269 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1242 place count 268 transition count 479
Performed 143 Post agglomeration using F-continuation condition with reduction of 97 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 8 with 286 rules applied. Total rules applied 1528 place count 125 transition count 239
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 8 with 13 rules applied. Total rules applied 1541 place count 125 transition count 226
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1543 place count 124 transition count 225
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1546 place count 121 transition count 222
Iterating global reduction 10 with 3 rules applied. Total rules applied 1549 place count 121 transition count 222
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1575 place count 108 transition count 206
Drop transitions removed 3 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1590 place count 108 transition count 191
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 11 with 66 rules applied. Total rules applied 1656 place count 75 transition count 223
Drop transitions removed 32 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 11 with 56 rules applied. Total rules applied 1712 place count 75 transition count 167
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 1736 place count 51 transition count 142
Iterating global reduction 12 with 24 rules applied. Total rules applied 1760 place count 51 transition count 142
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 1775 place count 51 transition count 127
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1780 place count 46 transition count 117
Iterating global reduction 13 with 5 rules applied. Total rules applied 1785 place count 46 transition count 117
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1790 place count 46 transition count 112
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 14 with 30 rules applied. Total rules applied 1820 place count 46 transition count 82
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1823 place count 43 transition count 73
Iterating global reduction 14 with 3 rules applied. Total rules applied 1826 place count 43 transition count 73
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1829 place count 40 transition count 70
Iterating global reduction 14 with 3 rules applied. Total rules applied 1832 place count 40 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1835 place count 40 transition count 67
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1838 place count 40 transition count 64
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1841 place count 40 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1844 place count 37 transition count 61
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1845 place count 37 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1846 place count 36 transition count 60
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 36 edges and 35 vertex of which 25 / 35 are part of one of the 9 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 16 with 2 rules applied. Total rules applied 1848 place count 19 transition count 60
Drop transitions removed 26 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 17 with 33 rules applied. Total rules applied 1881 place count 19 transition count 27
Discarding 3 places :
Symmetric choice reduction at 18 with 3 rule applications. Total rules 1884 place count 16 transition count 24
Iterating global reduction 18 with 3 rules applied. Total rules applied 1887 place count 16 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 18 with 6 rules applied. Total rules applied 1893 place count 13 transition count 21
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 24 edges and 13 vertex of which 8 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 18 with 8 rules applied. Total rules applied 1901 place count 8 transition count 10
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 1903 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 3 rules applied. Total rules applied 1906 place count 6 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 1 Pre rules applied. Total rules applied 1906 place count 6 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1908 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1910 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1911 place count 4 transition count 5
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 1912 place count 4 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 1913 place count 4 transition count 4
Applied a total of 1913 rules in 55 ms. Remains 4 /1511 variables (removed 1507) and now considering 4/1934 (removed 1930) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 4/1511 places, 4/1934 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p3 p2 (NOT p4)), (X (NOT (OR (AND (NOT p0) p1 p4 p3) (AND (NOT p0) p1 p4 p2)))), (X (NOT (AND (NOT p0) p1 p4 (NOT p3) p2))), (X (OR p0 (AND p1 p3) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (OR (AND (NOT p0) p1 (NOT p4) p3) (AND (NOT p0) p1 (NOT p4) p2)))), (X (X (NOT (AND (NOT p0) p1 p4 (NOT p3) p2)))), (X (X (OR p0 (AND p1 p3) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p4) p3) (AND (NOT p0) p1 (NOT p4) p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 (NOT p4) (NOT p3) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p1 p4 p3) (AND (NOT p0) p1 p4 p2))))), true, (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p4) (AND p4 (NOT p3) (NOT p2)))))), (X (X (OR (AND p0 p1 (NOT p4) p3) (AND p0 p1 (NOT p4) p2)))), (X (X (NOT (AND p0 p1 p4 (NOT p3) p2)))), (X (X (NOT (OR (AND p0 p1 p4 p3) (AND p0 p1 p4 p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))))]
False Knowledge obtained : [(F (AND p1 (NOT p3) p2 p0 p4)), (F (OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0))), (F (NOT (OR (AND p1 p3 p0 (NOT p4)) (AND p1 p2 p0 (NOT p4))))), (F (OR (AND p1 p3 (NOT p0) p4) (AND p1 p2 (NOT p0) p4))), (F (OR (AND p1 p3 (NOT p0) (NOT p4)) (AND p1 p2 (NOT p0) (NOT p4)))), (F (AND (NOT p3) p2)), (F p4), (F (AND (NOT p3) (NOT p2))), (F (OR (AND (NOT p1) p4) (AND (NOT p3) (NOT p2) p4))), (F (NOT (OR (AND p1 p3) (AND p1 p2) p0))), (F (AND p1 (NOT p3) p2 (NOT p0) p4)), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0)))), (F (OR (AND (NOT p1) p0 (NOT p4)) (AND (NOT p3) (NOT p2) p0 (NOT p4)))), (F (OR (AND p1 p3 p0 p4) (AND p1 p2 p0 p4)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (AND p1 p3) (AND p1 p2) p0)))
Knowledge based reduction with 20 factoid took 728 ms. Reduced automaton from 6 states, 18 edges and 5 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-312-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-312-LTLFireability-08 finished in 14566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U X(X(X(X(p0)))))))))'
Support contains 1 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1549 transition count 1985
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 1539 transition count 1975
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 1539 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1539 transition count 1974
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 1532 transition count 1966
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 1532 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 1532 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 69 place count 1526 transition count 1957
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 1526 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 80 place count 1521 transition count 1951
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 1521 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 1521 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 89 place count 1518 transition count 1947
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 1518 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 95 place count 1515 transition count 1944
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 1515 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 1512 transition count 1939
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 1512 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 107 place count 1509 transition count 1933
Iterating global reduction 4 with 3 rules applied. Total rules applied 110 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 1507 transition count 1931
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 1507 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 1507 transition count 1930
Applied a total of 115 rules in 538 ms. Remains 1507 /1562 variables (removed 55) and now considering 1930/1999 (removed 69) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 15:56:26] [INFO ] Computed 4 invariants in 23 ms
[2024-05-21 15:56:26] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 15:56:26] [INFO ] Invariant cache hit.
[2024-05-21 15:56:27] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2024-05-21 15:56:28] [INFO ] Invariant cache hit.
[2024-05-21 15:56:28] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1562 places, 1930/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2588 ms. Remains : 1507/1562 places, 1930/1999 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(NEQ s511 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 702 reset in 141 ms.
Product exploration explored 100000 steps with 706 reset in 155 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 401128 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401128 steps, saw 99966 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:56:32] [INFO ] Invariant cache hit.
[2024-05-21 15:56:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 15:56:33] [INFO ] After 640ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 15:56:33] [INFO ] After 788ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-21 15:56:33] [INFO ] After 1066ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 52 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2024-05-21 15:56:34] [INFO ] Invariant cache hit.
[2024-05-21 15:56:34] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-21 15:56:34] [INFO ] Invariant cache hit.
[2024-05-21 15:56:35] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2024-05-21 15:56:35] [INFO ] Invariant cache hit.
[2024-05-21 15:56:36] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2109 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 401818 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401818 steps, saw 100053 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:56:39] [INFO ] Invariant cache hit.
[2024-05-21 15:56:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 15:56:40] [INFO ] After 606ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 15:56:40] [INFO ] After 719ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-21 15:56:40] [INFO ] After 986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 696 reset in 145 ms.
Product exploration explored 100000 steps with 705 reset in 142 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Graph (trivial) has 1841 edges and 1507 vertex of which 693 / 1507 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1369 edges and 877 vertex of which 868 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 474 rules applied. Total rules applied 476 place count 868 transition count 1193
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 488 place count 868 transition count 1181
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 488 place count 868 transition count 1194
Deduced a syphon composed of 495 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 509 place count 868 transition count 1194
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 792 place count 585 transition count 901
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1075 place count 585 transition count 901
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1087 place count 573 transition count 885
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1099 place count 573 transition count 885
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1105 place count 573 transition count 879
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1117 place count 561 transition count 867
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1129 place count 561 transition count 867
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 559 transition count 863
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 559 transition count 863
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 557 transition count 859
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 557 transition count 859
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1141 place count 553 transition count 855
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1145 place count 553 transition count 855
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 551 transition count 851
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 551 transition count 851
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 549 transition count 847
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 549 transition count 847
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 545 transition count 841
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 545 transition count 841
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 541 transition count 825
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 541 transition count 825
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1170 place count 541 transition count 825
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1174 place count 537 transition count 821
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1178 place count 537 transition count 821
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 314 places in 0 ms
Iterating global reduction 4 with 105 rules applied. Total rules applied 1283 place count 537 transition count 896
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1322 place count 537 transition count 857
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 1422 place count 437 transition count 747
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 100 rules applied. Total rules applied 1522 place count 437 transition count 747
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1528 place count 431 transition count 738
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1534 place count 431 transition count 738
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 225 places in 1 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1541 place count 431 transition count 738
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1545 place count 431 transition count 734
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1560 place count 416 transition count 715
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1575 place count 416 transition count 715
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1581 place count 416 transition count 709
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1585 place count 412 transition count 705
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1589 place count 412 transition count 705
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1592 place count 412 transition count 705
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1598 place count 412 transition count 699
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1601 place count 409 transition count 696
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1604 place count 409 transition count 696
Performed 70 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1674 place count 409 transition count 1009
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1795 place count 409 transition count 888
Discarding 125 places :
Symmetric choice reduction at 9 with 125 rule applications. Total rules 1920 place count 284 transition count 559
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 9 with 125 rules applied. Total rules applied 2045 place count 284 transition count 559
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2060 place count 284 transition count 544
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2087 place count 257 transition count 487
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2114 place count 257 transition count 487
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2117 place count 257 transition count 535
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2120 place count 254 transition count 508
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2123 place count 254 transition count 508
Deduced a syphon composed of 137 places in 0 ms
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 2168 place count 254 transition count 463
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2172 place count 250 transition count 459
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2176 place count 250 transition count 459
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2179 place count 250 transition count 519
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2182 place count 247 transition count 504
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2185 place count 247 transition count 504
Deduced a syphon composed of 133 places in 0 ms
Applied a total of 2185 rules in 343 ms. Remains 247 /1507 variables (removed 1260) and now considering 504/1930 (removed 1426) transitions.
[2024-05-21 15:56:42] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-21 15:56:42] [INFO ] Flow matrix only has 447 transitions (discarded 57 similar events)
// Phase 1: matrix 447 rows 247 cols
[2024-05-21 15:56:42] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:56:43] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/1507 places, 504/1930 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 914 ms. Remains : 247/1507 places, 504/1930 transitions.
Built C files in :
/tmp/ltsmin11400185603515395613
[2024-05-21 15:56:43] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11400185603515395613
Running compilation step : cd /tmp/ltsmin11400185603515395613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11400185603515395613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11400185603515395613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 50 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 15:56:46] [INFO ] Computed 4 invariants in 12 ms
[2024-05-21 15:56:46] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 15:56:46] [INFO ] Invariant cache hit.
[2024-05-21 15:56:47] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2024-05-21 15:56:47] [INFO ] Invariant cache hit.
[2024-05-21 15:56:48] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1931 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Built C files in :
/tmp/ltsmin15637083537358598633
[2024-05-21 15:56:48] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15637083537358598633
Running compilation step : cd /tmp/ltsmin15637083537358598633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15637083537358598633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15637083537358598633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 15:56:51] [INFO ] Flatten gal took : 41 ms
[2024-05-21 15:56:51] [INFO ] Flatten gal took : 31 ms
[2024-05-21 15:56:51] [INFO ] Time to serialize gal into /tmp/LTL10414753516487064861.gal : 9 ms
[2024-05-21 15:56:51] [INFO ] Time to serialize properties into /tmp/LTL10877848532742172509.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10414753516487064861.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2686108972330162769.hoa' '-atoms' '/tmp/LTL10877848532742172509.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10877848532742172509.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2686108972330162769.hoa
Detected timeout of ITS tools.
[2024-05-21 15:57:06] [INFO ] Flatten gal took : 32 ms
[2024-05-21 15:57:06] [INFO ] Flatten gal took : 46 ms
[2024-05-21 15:57:06] [INFO ] Time to serialize gal into /tmp/LTL3818265430983401274.gal : 21 ms
[2024-05-21 15:57:06] [INFO ] Time to serialize properties into /tmp/LTL6743510394301014388.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3818265430983401274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6743510394301014388.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p890!=1)")U(X(X(X(X("(p890!=1)"))))))))))
Formula 0 simplified : XXF(!"(p890!=1)" R XXXX!"(p890!=1)")
Detected timeout of ITS tools.
[2024-05-21 15:57:21] [INFO ] Flatten gal took : 32 ms
[2024-05-21 15:57:21] [INFO ] Applying decomposition
[2024-05-21 15:57:21] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5276692088096532537.txt' '-o' '/tmp/graph5276692088096532537.bin' '-w' '/tmp/graph5276692088096532537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5276692088096532537.bin' '-l' '-1' '-v' '-w' '/tmp/graph5276692088096532537.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:57:22] [INFO ] Decomposing Gal with order
[2024-05-21 15:57:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:57:22] [INFO ] Removed a total of 533 redundant transitions.
[2024-05-21 15:57:22] [INFO ] Flatten gal took : 133 ms
[2024-05-21 15:57:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 42 ms.
[2024-05-21 15:57:22] [INFO ] Time to serialize gal into /tmp/LTL14591155078185215932.gal : 28 ms
[2024-05-21 15:57:22] [INFO ] Time to serialize properties into /tmp/LTL13188253515341634127.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14591155078185215932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13188253515341634127.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i19.i0.i1.u203.p890!=1)")U(X(X(X(X("(i19.i0.i1.u203.p890!=1)"))))))))))
Formula 0 simplified : XXF(!"(i19.i0.i1.u203.p890!=1)" R XXXX!"(i19.i0.i1.u203.p890!=1)")
Reverse transition relation is NOT exact ! Due to transitions t26, t199, t228, t282, t344, t393, t464, t516, t682, t763, t823, t872, t944, t995, t1165, t12...2032
Computing Next relation with stutter on 140576 deadlock states
43 unique states visited
43 strongly connected components in search stack
44 transitions explored
43 items max in DFS search stack
471 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,4.89246,188256,1,0,326762,8884,22801,612521,495,58089,1231939
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-312-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-312-LTLFireability-09 finished in 62040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1549 transition count 1984
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 1539 transition count 1974
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 1539 transition count 1974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 1539 transition count 1973
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 1532 transition count 1965
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 1532 transition count 1965
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1532 transition count 1964
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 1526 transition count 1956
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 1526 transition count 1956
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 81 place count 1521 transition count 1950
Iterating global reduction 3 with 5 rules applied. Total rules applied 86 place count 1521 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 1521 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 90 place count 1518 transition count 1946
Iterating global reduction 4 with 3 rules applied. Total rules applied 93 place count 1518 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 96 place count 1515 transition count 1943
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 1515 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 102 place count 1512 transition count 1938
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 1512 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 108 place count 1509 transition count 1932
Iterating global reduction 4 with 3 rules applied. Total rules applied 111 place count 1509 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 1507 transition count 1930
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 1507 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 1507 transition count 1929
Applied a total of 116 rules in 543 ms. Remains 1507 /1562 variables (removed 55) and now considering 1929/1999 (removed 70) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 15:57:28] [INFO ] Computed 4 invariants in 23 ms
[2024-05-21 15:57:28] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-21 15:57:28] [INFO ] Invariant cache hit.
[2024-05-21 15:57:29] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
[2024-05-21 15:57:29] [INFO ] Invariant cache hit.
[2024-05-21 15:57:30] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1562 places, 1929/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2531 ms. Remains : 1507/1562 places, 1929/1999 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s279 1), p1:(EQ s1467 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2409 reset in 188 ms.
Stack based approach found an accepted trace after 718 steps with 15 reset with depth 81 and stack size 81 in 2 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-10 finished in 2833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 2 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1906 edges and 1562 vertex of which 692 / 1562 are part of one of the 62 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1440 edges and 932 vertex of which 923 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 0 with 507 rules applied. Total rules applied 509 place count 922 transition count 753
Reduce places removed 507 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 531 rules applied. Total rules applied 1040 place count 415 transition count 729
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1053 place count 403 transition count 728
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1054 place count 402 transition count 728
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1054 place count 402 transition count 681
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1148 place count 355 transition count 681
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1165 place count 338 transition count 655
Iterating global reduction 4 with 17 rules applied. Total rules applied 1182 place count 338 transition count 655
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1185 place count 338 transition count 652
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1187 place count 336 transition count 652
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1200 place count 323 transition count 633
Iterating global reduction 6 with 13 rules applied. Total rules applied 1213 place count 323 transition count 633
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 6 with 8 rules applied. Total rules applied 1221 place count 323 transition count 625
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1222 place count 322 transition count 625
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1224 place count 320 transition count 621
Iterating global reduction 8 with 2 rules applied. Total rules applied 1226 place count 320 transition count 621
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1228 place count 318 transition count 617
Iterating global reduction 8 with 2 rules applied. Total rules applied 1230 place count 318 transition count 617
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1232 place count 316 transition count 613
Iterating global reduction 8 with 2 rules applied. Total rules applied 1234 place count 316 transition count 613
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1236 place count 314 transition count 609
Iterating global reduction 8 with 2 rules applied. Total rules applied 1238 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1240 place count 312 transition count 605
Iterating global reduction 8 with 2 rules applied. Total rules applied 1242 place count 312 transition count 605
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1243 place count 311 transition count 598
Iterating global reduction 8 with 1 rules applied. Total rules applied 1244 place count 311 transition count 598
Performed 151 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 8 with 302 rules applied. Total rules applied 1546 place count 160 transition count 360
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1560 place count 160 transition count 346
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1566 place count 154 transition count 334
Iterating global reduction 9 with 6 rules applied. Total rules applied 1572 place count 154 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1573 place count 154 transition count 333
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1597 place count 142 transition count 320
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1610 place count 142 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1644 place count 125 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1661 place count 125 transition count 324
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1670 place count 116 transition count 306
Iterating global reduction 12 with 9 rules applied. Total rules applied 1679 place count 116 transition count 306
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1684 place count 116 transition count 301
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 13 with 31 rules applied. Total rules applied 1715 place count 116 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1716 place count 115 transition count 269
Applied a total of 1716 rules in 86 ms. Remains 115 /1562 variables (removed 1447) and now considering 269/1999 (removed 1730) transitions.
[2024-05-21 15:57:31] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
// Phase 1: matrix 213 rows 115 cols
[2024-05-21 15:57:31] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:57:31] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-21 15:57:31] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
[2024-05-21 15:57:31] [INFO ] Invariant cache hit.
[2024-05-21 15:57:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:57:31] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [8, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 519 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1562 places, 269/1999 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 267
Applied a total of 1 rules in 20 ms. Remains 111 /113 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2024-05-21 15:57:31] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
// Phase 1: matrix 211 rows 111 cols
[2024-05-21 15:57:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 15:57:32] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-21 15:57:32] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 15:57:32] [INFO ] Invariant cache hit.
[2024-05-21 15:57:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:57:32] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1562 places, 267/1999 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1157 ms. Remains : 111/1562 places, 267/1999 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s38 0), p1:(EQ s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8641 reset in 130 ms.
Product exploration explored 100000 steps with 8654 reset in 153 ms.
Computed a total of 3 stabilizing places and 24 stable transitions
Computed a total of 3 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1048 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:57:32] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 15:57:32] [INFO ] Invariant cache hit.
[2024-05-21 15:57:33] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:57:33] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 15:57:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:57:33] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 15:57:33] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 15:57:33] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 267/267 transitions.
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 111 transition count 204
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 72 place count 102 transition count 204
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 114 place count 81 transition count 183
Drop transitions removed 6 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 129 place count 81 transition count 168
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 140 place count 70 transition count 157
Iterating global reduction 3 with 11 rules applied. Total rules applied 151 place count 70 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 156 place count 70 transition count 152
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 172 place count 62 transition count 144
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 180 place count 62 transition count 136
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 186 place count 56 transition count 130
Iterating global reduction 5 with 6 rules applied. Total rules applied 192 place count 56 transition count 130
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 198 place count 56 transition count 124
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 214 place count 48 transition count 129
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 227 place count 48 transition count 116
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 233 place count 42 transition count 110
Iterating global reduction 7 with 6 rules applied. Total rules applied 239 place count 42 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 245 place count 42 transition count 104
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 266 place count 42 transition count 83
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 269 place count 39 transition count 74
Iterating global reduction 8 with 3 rules applied. Total rules applied 272 place count 39 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 275 place count 39 transition count 71
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 277 place count 37 transition count 69
Iterating global reduction 9 with 2 rules applied. Total rules applied 279 place count 37 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 283 place count 37 transition count 65
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 288 place count 37 transition count 60
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1477.t1478.t1479.t1480.t1481.t1482.t1483.t1484.t1485.t1947.t1723.t1724.t1725.t1726.t1727.t1728.t1729.t1730.t1731.t1733.t1799.t1734.t1735.t1736.t1738.t1780.t1739.t1740.t1741.t1835.t1849 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 30 edges and 30 vertex of which 19 / 30 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 10 with 6 rules applied. Total rules applied 294 place count 19 transition count 55
Drop transitions removed 19 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 318 place count 19 transition count 31
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 320 place count 17 transition count 29
Iterating global reduction 12 with 2 rules applied. Total rules applied 322 place count 17 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 328 place count 14 transition count 26
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 333 place count 14 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 7 rules applied. Total rules applied 340 place count 10 transition count 19
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 346 place count 10 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 348 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 348 place count 10 transition count 10
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 350 place count 9 transition count 10
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 351 place count 9 transition count 10
Applied a total of 351 rules in 18 ms. Remains 9 /111 variables (removed 102) and now considering 10/267 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 9/111 places, 10/267 transitions.
Finished random walk after 3338 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1112 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 15:57:33] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 15:57:33] [INFO ] Invariant cache hit.
[2024-05-21 15:57:33] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 15:57:33] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 15:57:33] [INFO ] Invariant cache hit.
[2024-05-21 15:57:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:57:34] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-21 15:57:34] [INFO ] Redundant transitions in 48 ms returned []
[2024-05-21 15:57:34] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 15:57:34] [INFO ] Invariant cache hit.
[2024-05-21 15:57:34] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 475 ms. Remains : 111/111 places, 267/267 transitions.
Computed a total of 3 stabilizing places and 24 stable transitions
Computed a total of 3 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1067 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 15:57:34] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 15:57:34] [INFO ] Invariant cache hit.
[2024-05-21 15:57:34] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 15:57:34] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 15:57:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:57:34] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 15:57:34] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 15:57:34] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 267/267 transitions.
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 111 transition count 204
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 72 place count 102 transition count 204
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 114 place count 81 transition count 183
Drop transitions removed 6 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 129 place count 81 transition count 168
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 140 place count 70 transition count 157
Iterating global reduction 3 with 11 rules applied. Total rules applied 151 place count 70 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 156 place count 70 transition count 152
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 172 place count 62 transition count 144
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 180 place count 62 transition count 136
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 186 place count 56 transition count 130
Iterating global reduction 5 with 6 rules applied. Total rules applied 192 place count 56 transition count 130
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 198 place count 56 transition count 124
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 214 place count 48 transition count 129
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 227 place count 48 transition count 116
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 233 place count 42 transition count 110
Iterating global reduction 7 with 6 rules applied. Total rules applied 239 place count 42 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 245 place count 42 transition count 104
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 266 place count 42 transition count 83
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 269 place count 39 transition count 74
Iterating global reduction 8 with 3 rules applied. Total rules applied 272 place count 39 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 275 place count 39 transition count 71
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 277 place count 37 transition count 69
Iterating global reduction 9 with 2 rules applied. Total rules applied 279 place count 37 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 283 place count 37 transition count 65
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 288 place count 37 transition count 60
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1477.t1478.t1479.t1480.t1481.t1482.t1483.t1484.t1485.t1947.t1723.t1724.t1725.t1726.t1727.t1728.t1729.t1730.t1731.t1733.t1799.t1734.t1735.t1736.t1738.t1780.t1739.t1740.t1741.t1835.t1849 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 30 edges and 30 vertex of which 19 / 30 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 10 with 6 rules applied. Total rules applied 294 place count 19 transition count 55
Drop transitions removed 19 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 318 place count 19 transition count 31
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 320 place count 17 transition count 29
Iterating global reduction 12 with 2 rules applied. Total rules applied 322 place count 17 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 328 place count 14 transition count 26
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 333 place count 14 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 7 rules applied. Total rules applied 340 place count 10 transition count 19
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 346 place count 10 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 348 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 348 place count 10 transition count 10
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 350 place count 9 transition count 10
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 351 place count 9 transition count 10
Applied a total of 351 rules in 13 ms. Remains 9 /111 variables (removed 102) and now considering 10/267 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 9/111 places, 10/267 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 8685 reset in 135 ms.
Product exploration explored 100000 steps with 8717 reset in 139 ms.
Built C files in :
/tmp/ltsmin698413873055756972
[2024-05-21 15:57:35] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2024-05-21 15:57:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:57:35] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2024-05-21 15:57:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:57:35] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2024-05-21 15:57:35] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:57:35] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin698413873055756972
Running compilation step : cd /tmp/ltsmin698413873055756972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 476 ms.
Running link step : cd /tmp/ltsmin698413873055756972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin698413873055756972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16242485295395782751.hoa' '--buchi-type=spotba'
LTSmin run took 6892 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-312-LTLFireability-11 finished in 11641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0)) U G(p1)))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1549 transition count 1984
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 1540 transition count 1975
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 1540 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 1540 transition count 1974
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 1534 transition count 1967
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 1534 transition count 1967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 1534 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 1529 transition count 1959
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 1529 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 74 place count 1525 transition count 1954
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 1525 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 1525 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 1523 transition count 1951
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 1523 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 1521 transition count 1949
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 1521 transition count 1949
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 89 place count 1519 transition count 1946
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 1519 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 93 place count 1517 transition count 1942
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 1516 transition count 1941
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 1516 transition count 1941
Applied a total of 97 rules in 531 ms. Remains 1516 /1562 variables (removed 46) and now considering 1941/1999 (removed 58) transitions.
// Phase 1: matrix 1941 rows 1516 cols
[2024-05-21 15:57:43] [INFO ] Computed 4 invariants in 7 ms
[2024-05-21 15:57:43] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 15:57:43] [INFO ] Invariant cache hit.
[2024-05-21 15:57:44] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2024-05-21 15:57:44] [INFO ] Invariant cache hit.
[2024-05-21 15:57:45] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1516/1562 places, 1941/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2453 ms. Remains : 1516/1562 places, 1941/1999 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s279 1) (EQ s588 1) (EQ s169 1)), p0:(EQ s513 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 161 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-12 finished in 2608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1549 transition count 1984
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 1540 transition count 1975
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 1540 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 1540 transition count 1974
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 1533 transition count 1966
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 1533 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 1533 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 68 place count 1527 transition count 1957
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 1527 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 79 place count 1522 transition count 1951
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 1522 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 1522 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 88 place count 1519 transition count 1947
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 1519 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 94 place count 1516 transition count 1944
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 1516 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 100 place count 1513 transition count 1939
Iterating global reduction 4 with 3 rules applied. Total rules applied 103 place count 1513 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 106 place count 1510 transition count 1933
Iterating global reduction 4 with 3 rules applied. Total rules applied 109 place count 1510 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 111 place count 1508 transition count 1931
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 1508 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 1508 transition count 1930
Applied a total of 114 rules in 560 ms. Remains 1508 /1562 variables (removed 54) and now considering 1930/1999 (removed 69) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-21 15:57:45] [INFO ] Computed 4 invariants in 7 ms
[2024-05-21 15:57:46] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-21 15:57:46] [INFO ] Invariant cache hit.
[2024-05-21 15:57:47] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2024-05-21 15:57:47] [INFO ] Invariant cache hit.
[2024-05-21 15:57:47] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1562 places, 1930/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2532 ms. Remains : 1508/1562 places, 1930/1999 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s1280 1), p0:(AND (EQ s279 1) (EQ s1025 1)), p2:(EQ s1011 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-13 finished in 2720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U (p1||G(F(!p2)))))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1549 transition count 1985
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 1539 transition count 1975
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 1539 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1539 transition count 1974
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 1532 transition count 1966
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 1532 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 1532 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 69 place count 1526 transition count 1957
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 1526 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 80 place count 1521 transition count 1951
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 1521 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 1521 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 89 place count 1518 transition count 1947
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 1518 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 95 place count 1515 transition count 1944
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 1515 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 1512 transition count 1939
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 1512 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 107 place count 1509 transition count 1933
Iterating global reduction 4 with 3 rules applied. Total rules applied 110 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 1507 transition count 1931
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 1507 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 1507 transition count 1930
Applied a total of 115 rules in 547 ms. Remains 1507 /1562 variables (removed 55) and now considering 1930/1999 (removed 69) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 15:57:48] [INFO ] Computed 4 invariants in 10 ms
[2024-05-21 15:57:48] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-21 15:57:48] [INFO ] Invariant cache hit.
[2024-05-21 15:57:49] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2024-05-21 15:57:49] [INFO ] Invariant cache hit.
[2024-05-21 15:57:50] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1562 places, 1930/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2676 ms. Remains : 1507/1562 places, 1930/1999 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s275 1), p2:(AND (EQ s280 1) (EQ s705 1)), p0:(AND (EQ s1291 1) (EQ s280 1) (EQ s705 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 709 reset in 137 ms.
Product exploration explored 100000 steps with 708 reset in 152 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 141 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Finished Best-First random walk after 2342 steps, including 1 resets, run visited all 3 properties in 8 ms. (steps per millisecond=292 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F p2), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 6 factoid took 176 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 4 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 80 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2024-05-21 15:57:52] [INFO ] Invariant cache hit.
[2024-05-21 15:57:52] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-21 15:57:52] [INFO ] Invariant cache hit.
[2024-05-21 15:57:53] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2024-05-21 15:57:53] [INFO ] Invariant cache hit.
[2024-05-21 15:57:54] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2044 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 162 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Finished random walk after 6738 steps, including 49 resets, run visited all 3 properties in 92 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F p2), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 6 factoid took 159 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 711 reset in 165 ms.
Product exploration explored 100000 steps with 717 reset in 160 ms.
Built C files in :
/tmp/ltsmin10434211216164190735
[2024-05-21 15:57:55] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10434211216164190735
Running compilation step : cd /tmp/ltsmin10434211216164190735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10434211216164190735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10434211216164190735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 53 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2024-05-21 15:57:58] [INFO ] Invariant cache hit.
[2024-05-21 15:57:58] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 15:57:58] [INFO ] Invariant cache hit.
[2024-05-21 15:57:59] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
[2024-05-21 15:57:59] [INFO ] Invariant cache hit.
[2024-05-21 15:58:00] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2033 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Built C files in :
/tmp/ltsmin1607032895576584508
[2024-05-21 15:58:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1607032895576584508
Running compilation step : cd /tmp/ltsmin1607032895576584508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1607032895576584508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1607032895576584508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 15:58:03] [INFO ] Flatten gal took : 30 ms
[2024-05-21 15:58:03] [INFO ] Flatten gal took : 31 ms
[2024-05-21 15:58:03] [INFO ] Time to serialize gal into /tmp/LTL3663181090031506216.gal : 7 ms
[2024-05-21 15:58:03] [INFO ] Time to serialize properties into /tmp/LTL13597311650030950677.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3663181090031506216.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15688174405654003791.hoa' '-atoms' '/tmp/LTL13597311650030950677.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13597311650030950677.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15688174405654003791.hoa
Detected timeout of ITS tools.
[2024-05-21 15:58:18] [INFO ] Flatten gal took : 30 ms
[2024-05-21 15:58:18] [INFO ] Flatten gal took : 31 ms
[2024-05-21 15:58:18] [INFO ] Time to serialize gal into /tmp/LTL7585364163812414439.gal : 8 ms
[2024-05-21 15:58:18] [INFO ] Time to serialize properties into /tmp/LTL4522279641560889086.ltl : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7585364163812414439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4522279641560889086.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((p2185==1)&&(p572==1))&&(p1261==1))"))U(("(p567==1)")||(G(F(!("((p572==1)&&(p1261==1))")))))))))
Formula 0 simplified : GF(X!"(((p2185==1)&&(p572==1))&&(p1261==1))" R (!"(p567==1)" & FG"((p572==1)&&(p1261==1))"))
Detected timeout of ITS tools.
[2024-05-21 15:58:33] [INFO ] Flatten gal took : 37 ms
[2024-05-21 15:58:33] [INFO ] Applying decomposition
[2024-05-21 15:58:33] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15333491055960335657.txt' '-o' '/tmp/graph15333491055960335657.bin' '-w' '/tmp/graph15333491055960335657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15333491055960335657.bin' '-l' '-1' '-v' '-w' '/tmp/graph15333491055960335657.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:58:34] [INFO ] Decomposing Gal with order
[2024-05-21 15:58:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:58:34] [INFO ] Removed a total of 500 redundant transitions.
[2024-05-21 15:58:34] [INFO ] Flatten gal took : 56 ms
[2024-05-21 15:58:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 17 ms.
[2024-05-21 15:58:34] [INFO ] Time to serialize gal into /tmp/LTL6069453086788022085.gal : 17 ms
[2024-05-21 15:58:34] [INFO ] Time to serialize properties into /tmp/LTL18264364078954396054.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6069453086788022085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18264364078954396054.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((X("(((i32.u526.p2185==1)&&(i7.i3.i0.u105.p572==1))&&(i7.i3.i0.u105.p1261==1))"))U(("(i6.u73.p567==1)")||(G(F(!("((i7.i3.i0.u10...202
Formula 0 simplified : GF(X!"(((i32.u526.p2185==1)&&(i7.i3.i0.u105.p572==1))&&(i7.i3.i0.u105.p1261==1))" R (!"(i6.u73.p567==1)" & FG"((i7.i3.i0.u105.p572==...187
Reverse transition relation is NOT exact ! Due to transitions t26, t228, t282, t315, t344, t393, t464, t516, t682, t763, t794, t872, t944, t995, t1194, t12...2129
Computing Next relation with stutter on 140576 deadlock states
91 unique states visited
91 strongly connected components in search stack
92 transitions explored
91 items max in DFS search stack
658 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,6.74623,265068,1,0,468784,13114,23367,1.22679e+06,760,80383,1319594
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-312-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-312-LTLFireability-14 finished in 54188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1908 edges and 1562 vertex of which 698 / 1562 are part of one of the 63 SCC in 1 ms
Free SCC test removed 635 places
Ensure Unique test removed 738 transitions
Reduce isomorphic transitions removed 738 transitions.
Graph (complete) has 1435 edges and 927 vertex of which 918 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 506 rules applied. Total rules applied 508 place count 917 transition count 749
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 530 rules applied. Total rules applied 1038 place count 411 transition count 725
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1050 place count 399 transition count 725
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1050 place count 399 transition count 679
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1142 place count 353 transition count 679
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1159 place count 336 transition count 653
Iterating global reduction 3 with 17 rules applied. Total rules applied 1176 place count 336 transition count 653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 1179 place count 336 transition count 650
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1181 place count 334 transition count 650
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1194 place count 321 transition count 631
Iterating global reduction 5 with 13 rules applied. Total rules applied 1207 place count 321 transition count 631
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 5 with 8 rules applied. Total rules applied 1215 place count 321 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1216 place count 320 transition count 623
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1218 place count 318 transition count 619
Iterating global reduction 7 with 2 rules applied. Total rules applied 1220 place count 318 transition count 619
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1222 place count 316 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 1224 place count 316 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1226 place count 314 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1228 place count 314 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1230 place count 312 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1232 place count 312 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1234 place count 310 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1236 place count 310 transition count 603
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1237 place count 309 transition count 596
Iterating global reduction 7 with 1 rules applied. Total rules applied 1238 place count 309 transition count 596
Performed 150 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 7 with 300 rules applied. Total rules applied 1538 place count 159 transition count 359
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1552 place count 159 transition count 345
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1558 place count 153 transition count 333
Iterating global reduction 8 with 6 rules applied. Total rules applied 1564 place count 153 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1565 place count 153 transition count 332
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1589 place count 141 transition count 319
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1602 place count 141 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
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 1636 place count 124 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1653 place count 124 transition count 323
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1662 place count 115 transition count 305
Iterating global reduction 11 with 9 rules applied. Total rules applied 1671 place count 115 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1677 place count 115 transition count 299
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 12 with 36 rules applied. Total rules applied 1713 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1714 place count 114 transition count 262
Applied a total of 1714 rules in 68 ms. Remains 114 /1562 variables (removed 1448) and now considering 262/1999 (removed 1737) transitions.
[2024-05-21 15:58:42] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 114 cols
[2024-05-21 15:58:42] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 15:58:42] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-21 15:58:42] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2024-05-21 15:58:42] [INFO ] Invariant cache hit.
[2024-05-21 15:58:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:58:42] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [8, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 418 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1562 places, 262/1999 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 260
Applied a total of 1 rules in 4 ms. Remains 110 /112 variables (removed 2) and now considering 260/262 (removed 2) transitions.
[2024-05-21 15:58:42] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 110 cols
[2024-05-21 15:58:42] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 15:58:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 15:58:42] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-21 15:58:42] [INFO ] Invariant cache hit.
[2024-05-21 15:58:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 15:58:42] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1562 places, 260/1999 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 666 ms. Remains : 110/1562 places, 260/1999 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-15 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:(NEQ s39 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 756 steps with 62 reset in 1 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-15 finished in 799 ms.
All properties solved by simple procedures.
Total runtime 256426 ms.

BK_STOP 1716307124280

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CloudReconfiguration-PT-312, 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 r109-tall-171624207900128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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