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.r092-tall-171624188600115.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 itstools
Input is CloudReconfiguration-PT-301, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624188600115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.7K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 11 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 19:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 19:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 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-301-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716261839111

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-301
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 03:24:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:24:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:24:00] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2024-05-21 03:24:00] [INFO ] Transformed 2584 places.
[2024-05-21 03:24:00] [INFO ] Transformed 3094 transitions.
[2024-05-21 03:24:00] [INFO ] Found NUPN structural information;
[2024-05-21 03:24:00] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 517 places :
Symmetric choice reduction at 0 with 517 rule applications. Total rules 517 place count 2067 transition count 2577
Iterating global reduction 0 with 517 rules applied. Total rules applied 1034 place count 2067 transition count 2577
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1062 place count 2067 transition count 2549
Discarding 235 places :
Symmetric choice reduction at 1 with 235 rule applications. Total rules 1297 place count 1832 transition count 2314
Iterating global reduction 1 with 235 rules applied. Total rules applied 1532 place count 1832 transition count 2314
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 1622 place count 1742 transition count 2224
Iterating global reduction 1 with 90 rules applied. Total rules applied 1712 place count 1742 transition count 2224
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1728 place count 1742 transition count 2208
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 1778 place count 1692 transition count 2158
Iterating global reduction 2 with 50 rules applied. Total rules applied 1828 place count 1692 transition count 2158
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1837 place count 1692 transition count 2149
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1875 place count 1654 transition count 2107
Iterating global reduction 3 with 38 rules applied. Total rules applied 1913 place count 1654 transition count 2107
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1941 place count 1626 transition count 2079
Iterating global reduction 3 with 28 rules applied. Total rules applied 1969 place count 1626 transition count 2079
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1994 place count 1601 transition count 2054
Iterating global reduction 3 with 25 rules applied. Total rules applied 2019 place count 1601 transition count 2054
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2044 place count 1576 transition count 2029
Iterating global reduction 3 with 25 rules applied. Total rules applied 2069 place count 1576 transition count 2029
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2091 place count 1554 transition count 1992
Iterating global reduction 3 with 22 rules applied. Total rules applied 2113 place count 1554 transition count 1992
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2120 place count 1547 transition count 1980
Iterating global reduction 3 with 7 rules applied. Total rules applied 2127 place count 1547 transition count 1980
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2134 place count 1540 transition count 1971
Iterating global reduction 3 with 7 rules applied. Total rules applied 2141 place count 1540 transition count 1971
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2144 place count 1540 transition count 1968
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2146 place count 1538 transition count 1966
Iterating global reduction 4 with 2 rules applied. Total rules applied 2148 place count 1538 transition count 1966
Applied a total of 2148 rules in 1322 ms. Remains 1538 /2584 variables (removed 1046) and now considering 1966/3094 (removed 1128) transitions.
// Phase 1: matrix 1966 rows 1538 cols
[2024-05-21 03:24:02] [INFO ] Computed 4 invariants in 36 ms
[2024-05-21 03:24:02] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-21 03:24:02] [INFO ] Invariant cache hit.
[2024-05-21 03:24:03] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
Running 1965 sub problems to find dead transitions.
[2024-05-21 03:24:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1537 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1965 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1537/3504 variables, and 4 constraints, problems are : Problem set: 0 solved, 1965 unsolved in 30081 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1538 constraints, PredecessorRefiner: 1965/1965 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1965 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1537 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1965 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1537/3504 variables, and 4 constraints, problems are : Problem set: 0 solved, 1965 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1538 constraints, PredecessorRefiner: 0/1965 constraints, Known Traps: 0/0 constraints]
After SMT, in 60717ms problems are : Problem set: 0 solved, 1965 unsolved
Search for dead transitions found 0 dead transitions in 60750ms
Starting structural reductions in LTL mode, iteration 1 : 1538/2584 places, 1966/3094 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63734 ms. Remains : 1538/2584 places, 1966/3094 transitions.
Support contains 25 out of 1538 places after structural reductions.
[2024-05-21 03:25:04] [INFO ] Flatten gal took : 139 ms
[2024-05-21 03:25:04] [INFO ] Flatten gal took : 67 ms
[2024-05-21 03:25:05] [INFO ] Input system was already deterministic with 1966 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (303 resets) in 1644 ms. (24 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (82 resets) in 326 ms. (122 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (82 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (84 resets) in 157 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (82 resets) in 184 ms. (216 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (81 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (77 resets) in 143 ms. (277 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (83 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (79 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (82 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (79 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (82 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (79 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 283561 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 12
Probabilistic random walk after 283561 steps, saw 71033 distinct states, run finished after 3006 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-21 03:25:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1504/1527 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1527 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1956/3483 variables, 1527/1531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3483 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/3485 variables, 1/1532 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3485 variables, 0/1532 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/3487 variables, 1/1533 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3487 variables, 0/1533 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2/3489 variables, 1/1534 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3489 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 2/3491 variables, 1/1535 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3491 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 2/3493 variables, 1/1536 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3493 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 2/3495 variables, 1/1537 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3495 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 2/3497 variables, 1/1538 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3497 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 2/3499 variables, 1/1539 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3499/3504 variables, and 1539 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1535/1538 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1504/1527 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1527 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1956/3483 variables, 1527/1531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3483 variables, 12/1543 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3483 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/3485 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3485 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 2/3487 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3487 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 2/3489 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3489 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 2/3491 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3491 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 2/3493 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3493 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 2/3495 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3495 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SMT process timed out in 10051ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1538/1538 places, 1966/1966 transitions.
Graph (trivial) has 1833 edges and 1538 vertex of which 671 / 1538 are part of one of the 62 SCC in 13 ms
Free SCC test removed 609 places
Drop transitions (Empty/Sink Transition effects.) removed 769 transitions
Reduce isomorphic transitions removed 769 transitions.
Graph (complete) has 1367 edges and 929 vertex of which 920 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 920 transition count 699
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 531 rules applied. Total rules applied 1027 place count 433 transition count 655
Reduce places removed 28 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 38 rules applied. Total rules applied 1065 place count 405 transition count 645
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1075 place count 395 transition count 645
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 1075 place count 395 transition count 594
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1177 place count 344 transition count 594
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1186 place count 335 transition count 582
Iterating global reduction 4 with 9 rules applied. Total rules applied 1195 place count 335 transition count 582
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1197 place count 335 transition count 580
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1199 place count 333 transition count 580
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1205 place count 327 transition count 574
Iterating global reduction 6 with 6 rules applied. Total rules applied 1211 place count 327 transition count 574
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1217 place count 327 transition count 568
Performed 155 Post agglomeration using F-continuation condition with reduction of 93 identical transitions.
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 7 with 310 rules applied. Total rules applied 1527 place count 172 transition count 320
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1548 place count 172 transition count 299
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1552 place count 168 transition count 294
Iterating global reduction 8 with 4 rules applied. Total rules applied 1556 place count 168 transition count 294
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1580 place count 156 transition count 280
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1592 place count 156 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1594 place count 155 transition count 267
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1597 place count 155 transition count 264
Performed 35 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 10 with 70 rules applied. Total rules applied 1667 place count 120 transition count 289
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 10 with 33 rules applied. Total rules applied 1700 place count 120 transition count 256
Discarding 20 places :
Symmetric choice reduction at 11 with 20 rule applications. Total rules 1720 place count 100 transition count 222
Iterating global reduction 11 with 20 rules applied. Total rules applied 1740 place count 100 transition count 222
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 1747 place count 100 transition count 215
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1751 place count 96 transition count 207
Iterating global reduction 12 with 4 rules applied. Total rules applied 1755 place count 96 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1757 place count 96 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 13 with 24 rules applied. Total rules applied 1781 place count 96 transition count 181
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1783 place count 94 transition count 177
Iterating global reduction 13 with 2 rules applied. Total rules applied 1785 place count 94 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1786 place count 94 transition count 176
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1788 place count 92 transition count 174
Iterating global reduction 14 with 2 rules applied. Total rules applied 1790 place count 92 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1792 place count 92 transition count 172
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 15 with 2 rules applied. Total rules applied 1794 place count 91 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1795 place count 91 transition count 170
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 1802 place count 91 transition count 163
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 1811 place count 84 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1812 place count 84 transition count 160
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 16 with 6 rules applied. Total rules applied 1818 place count 84 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1820 place count 84 transition count 158
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1821 place count 84 transition count 158
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1822 place count 84 transition count 157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1823 place count 83 transition count 156
Applied a total of 1823 rules in 182 ms. Remains 83 /1538 variables (removed 1455) and now considering 156/1966 (removed 1810) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 83/1538 places, 156/1966 transitions.
RANDOM walk for 8854 steps (119 resets) in 101 ms. (86 steps per ms) remains 0/12 properties
FORMULA CloudReconfiguration-PT-301-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2141 edges and 1538 vertex of which 1529 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.24 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Support contains 2 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 1966/1966 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1524 transition count 1952
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1524 transition count 1952
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 1524 transition count 1950
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 1518 transition count 1944
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 1518 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 1515 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 1515 transition count 1941
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 1515 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 1512 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 1510 transition count 1934
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1509 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1507 transition count 1929
Applied a total of 65 rules in 361 ms. Remains 1507 /1538 variables (removed 31) and now considering 1929/1966 (removed 37) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 03:25:20] [INFO ] Computed 4 invariants in 11 ms
[2024-05-21 03:25:20] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-21 03:25:20] [INFO ] Invariant cache hit.
[2024-05-21 03:25:21] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 03:25:21] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60612ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60629ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1538 places, 1929/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62076 ms. Remains : 1507/1538 places, 1929/1966 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 369 ms.
Product exploration explored 100000 steps with 33333 reset in 342 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2104 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-301-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-04 finished in 63132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 4 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 1966/1966 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1525 transition count 1953
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1525 transition count 1953
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 1525 transition count 1951
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 1519 transition count 1945
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 1519 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 1516 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 1516 transition count 1942
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 1516 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 1513 transition count 1937
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 1511 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1510 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1508 transition count 1930
Applied a total of 63 rules in 404 ms. Remains 1508 /1538 variables (removed 30) and now considering 1930/1966 (removed 36) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-21 03:26:23] [INFO ] Computed 4 invariants in 9 ms
[2024-05-21 03:26:23] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-21 03:26:23] [INFO ] Invariant cache hit.
[2024-05-21 03:26:24] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 03:26:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60508ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1538 places, 1930/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62010 ms. Remains : 1508/1538 places, 1930/1966 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-06 finished in 62170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 1966/1966 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1525 transition count 1953
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1525 transition count 1953
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 1525 transition count 1951
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 1520 transition count 1946
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 1520 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 1518 transition count 1944
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 1518 transition count 1944
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 1518 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 1516 transition count 1940
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 1515 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 1514 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 1514 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 1513 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 1513 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1512 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1512 transition count 1934
Applied a total of 55 rules in 385 ms. Remains 1512 /1538 variables (removed 26) and now considering 1934/1966 (removed 32) transitions.
// Phase 1: matrix 1934 rows 1512 cols
[2024-05-21 03:27:25] [INFO ] Computed 4 invariants in 11 ms
[2024-05-21 03:27:25] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 03:27:25] [INFO ] Invariant cache hit.
[2024-05-21 03:27:26] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-21 03:27:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60528ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60548ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1538 places, 1934/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62062 ms. Remains : 1512/1538 places, 1934/1966 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Product exploration explored 100000 steps with 50000 reset in 397 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2109 edges and 1512 vertex of which 1503 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-301-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-07 finished in 63060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1538/1538 places, 1966/1966 transitions.
Graph (trivial) has 1876 edges and 1538 vertex of which 698 / 1538 are part of one of the 63 SCC in 2 ms
Free SCC test removed 635 places
Ensure Unique test removed 738 transitions
Reduce isomorphic transitions removed 738 transitions.
Graph (complete) has 1397 edges and 903 vertex of which 894 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 893 transition count 728
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 517 rules applied. Total rules applied 1013 place count 399 transition count 705
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1025 place count 388 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1026 place count 387 transition count 704
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1026 place count 387 transition count 659
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1116 place count 342 transition count 659
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1131 place count 327 transition count 635
Iterating global reduction 4 with 15 rules applied. Total rules applied 1146 place count 327 transition count 635
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1148 place count 327 transition count 633
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1150 place count 325 transition count 633
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1159 place count 316 transition count 621
Iterating global reduction 6 with 9 rules applied. Total rules applied 1168 place count 316 transition count 621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1174 place count 316 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1176 place count 314 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1178 place count 314 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1180 place count 312 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1182 place count 312 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1184 place count 310 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1186 place count 310 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1188 place count 308 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1190 place count 308 transition count 599
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1191 place count 307 transition count 597
Iterating global reduction 7 with 1 rules applied. Total rules applied 1192 place count 307 transition count 597
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1193 place count 306 transition count 590
Iterating global reduction 7 with 1 rules applied. Total rules applied 1194 place count 306 transition count 590
Performed 147 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 7 with 294 rules applied. Total rules applied 1488 place count 159 transition count 356
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1503 place count 159 transition count 341
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1508 place count 154 transition count 331
Iterating global reduction 8 with 5 rules applied. Total rules applied 1513 place count 154 transition count 331
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 1514 place count 154 transition count 330
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 1516 place count 153 transition count 329
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1538 place count 142 transition count 316
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1547 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 1581 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 1598 place count 125 transition count 324
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1607 place count 116 transition count 306
Iterating global reduction 12 with 9 rules applied. Total rules applied 1616 place count 116 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1622 place count 116 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 13 with 36 rules applied. Total rules applied 1658 place count 116 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1659 place count 115 transition count 263
Applied a total of 1659 rules in 110 ms. Remains 115 /1538 variables (removed 1423) and now considering 263/1966 (removed 1703) transitions.
[2024-05-21 03:28:28] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 115 cols
[2024-05-21 03:28:28] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 03:28:28] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 03:28:28] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2024-05-21 03:28:28] [INFO ] Invariant cache hit.
[2024-05-21 03:28:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:28:28] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [8, 41, 74]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 207 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1538 places, 263/1966 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 260
Applied a total of 3 rules in 18 ms. Remains 109 /112 variables (removed 3) and now considering 260/263 (removed 3) transitions.
[2024-05-21 03:28:28] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 109 cols
[2024-05-21 03:28:28] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:28:28] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 03:28:28] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-21 03:28:28] [INFO ] Invariant cache hit.
[2024-05-21 03:28:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 03:28:28] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/1538 places, 260/1966 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 545 ms. Remains : 109/1538 places, 260/1966 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-09 finished in 593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1538/1538 places, 1966/1966 transitions.
Graph (trivial) has 1876 edges and 1538 vertex of which 698 / 1538 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 1397 edges and 903 vertex of which 894 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 (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 893 transition count 728
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 516 rules applied. Total rules applied 1012 place count 399 transition count 706
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1024 place count 388 transition count 705
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1025 place count 387 transition count 705
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1025 place count 387 transition count 660
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1115 place count 342 transition count 660
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1130 place count 327 transition count 636
Iterating global reduction 4 with 15 rules applied. Total rules applied 1145 place count 327 transition count 636
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1147 place count 327 transition count 634
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1149 place count 325 transition count 634
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1158 place count 316 transition count 622
Iterating global reduction 6 with 9 rules applied. Total rules applied 1167 place count 316 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1173 place count 316 transition count 616
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1175 place count 314 transition count 612
Iterating global reduction 7 with 2 rules applied. Total rules applied 1177 place count 314 transition count 612
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1179 place count 312 transition count 608
Iterating global reduction 7 with 2 rules applied. Total rules applied 1181 place count 312 transition count 608
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1183 place count 310 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 1185 place count 310 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1187 place count 308 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1189 place count 308 transition count 600
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1190 place count 307 transition count 598
Iterating global reduction 7 with 1 rules applied. Total rules applied 1191 place count 307 transition count 598
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1192 place count 306 transition count 591
Iterating global reduction 7 with 1 rules applied. Total rules applied 1193 place count 306 transition count 591
Performed 146 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 7 with 292 rules applied. Total rules applied 1485 place count 160 transition count 358
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1500 place count 160 transition count 343
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1505 place count 155 transition count 333
Iterating global reduction 8 with 5 rules applied. Total rules applied 1510 place count 155 transition count 333
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 1511 place count 155 transition count 332
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 1513 place count 154 transition count 331
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1535 place count 143 transition count 318
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1544 place count 143 transition count 309
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 1580 place count 125 transition count 343
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1597 place count 125 transition count 326
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1606 place count 116 transition count 308
Iterating global reduction 12 with 9 rules applied. Total rules applied 1615 place count 116 transition count 308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1620 place count 116 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 13 with 36 rules applied. Total rules applied 1656 place count 116 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1657 place count 115 transition count 266
Applied a total of 1657 rules in 122 ms. Remains 115 /1538 variables (removed 1423) and now considering 266/1966 (removed 1700) transitions.
[2024-05-21 03:28:28] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
// Phase 1: matrix 209 rows 115 cols
[2024-05-21 03:28:28] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:28:29] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 03:28:29] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
[2024-05-21 03:28:29] [INFO ] Invariant cache hit.
[2024-05-21 03:28:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:28:29] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [8, 45, 78]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 263 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1538 places, 266/1966 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 263
Applied a total of 3 rules in 8 ms. Remains 109 /112 variables (removed 3) and now considering 263/266 (removed 3) transitions.
[2024-05-21 03:28:29] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 109 cols
[2024-05-21 03:28:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:28:29] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 03:28:29] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2024-05-21 03:28:29] [INFO ] Invariant cache hit.
[2024-05-21 03:28:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 03:28:29] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/1538 places, 263/1966 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 502 ms. Remains : 109/1538 places, 263/1966 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-10 finished in 549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))||G(p2)))'
Support contains 4 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 1966/1966 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1526 transition count 1954
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1526 transition count 1954
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 1519 transition count 1947
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 1519 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1516 transition count 1944
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1516 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 1516 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 1513 transition count 1939
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 1513 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 1511 transition count 1937
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 1511 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1510 transition count 1935
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1509 transition count 1933
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1508 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1508 transition count 1932
Applied a total of 61 rules in 420 ms. Remains 1508 /1538 variables (removed 30) and now considering 1932/1966 (removed 34) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2024-05-21 03:28:29] [INFO ] Computed 4 invariants in 10 ms
[2024-05-21 03:28:30] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 03:28:30] [INFO ] Invariant cache hit.
[2024-05-21 03:28:30] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-21 03:28:30] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60537ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60555ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1538 places, 1932/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62081 ms. Remains : 1508/1538 places, 1932/1966 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-11
Product exploration explored 100000 steps with 768 reset in 240 ms.
Product exploration explored 100000 steps with 765 reset in 190 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X p1), (X (AND p0 p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X p1)), (X (X (AND p0 p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 125 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 15 to 10
RANDOM walk for 40000 steps (301 resets) in 680 ms. (58 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (79 resets) in 197 ms. (202 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (80 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (82 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (79 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (86 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (80 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
[2024-05-21 03:29:33] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1092/1096 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1096 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 401/1497 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1922/3419 variables, 1497/1501 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 0/1501 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3421 variables, 1/1502 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3421 variables, 0/1502 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3423 variables, 1/1503 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3423 variables, 0/1503 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3425 variables, 1/1504 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3440 variables, 1/1512 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3440/3440 variables, and 1512 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2849 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1092/1096 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1096 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 401/1497 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1922/3419 variables, 1497/1501 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 4/1505 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3419 variables, 0/1505 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3421 variables, 1/1506 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3421 variables, 0/1506 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3423 variables, 1/1507 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3423 variables, 0/1507 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3425 variables, 1/1508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3439 variables, 1/1515 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3439 variables, 0/1515 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/3440 variables, 1/1516 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3440 variables, 0/1516 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/3440 variables, 0/1516 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3440/3440 variables, and 1516 constraints, problems are : Problem set: 2 solved, 4 unsolved in 3228 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 6089ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 119 ms.
Support contains 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Graph (trivial) has 1838 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1306 edges and 878 vertex of which 869 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 869 transition count 639
Reduce places removed 486 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 539 rules applied. Total rules applied 1034 place count 383 transition count 586
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 1069 place count 349 transition count 585
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1070 place count 348 transition count 585
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1070 place count 348 transition count 535
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1170 place count 298 transition count 535
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1181 place count 287 transition count 519
Iterating global reduction 4 with 11 rules applied. Total rules applied 1192 place count 287 transition count 519
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1195 place count 287 transition count 516
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1198 place count 284 transition count 516
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1204 place count 278 transition count 510
Iterating global reduction 6 with 6 rules applied. Total rules applied 1210 place count 278 transition count 510
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1216 place count 278 transition count 504
Performed 145 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 7 with 290 rules applied. Total rules applied 1506 place count 133 transition count 264
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1524 place count 133 transition count 246
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1527 place count 130 transition count 243
Iterating global reduction 8 with 3 rules applied. Total rules applied 1530 place count 130 transition count 243
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 8 with 26 rules applied. Total rules applied 1556 place count 117 transition count 227
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1572 place count 117 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1574 place count 116 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1577 place count 116 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1579 place count 115 transition count 206
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1580 place count 115 transition count 205
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 11 with 66 rules applied. Total rules applied 1646 place count 82 transition count 235
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 11 with 36 rules applied. Total rules applied 1682 place count 82 transition count 199
Discarding 21 places :
Symmetric choice reduction at 12 with 21 rule applications. Total rules 1703 place count 61 transition count 164
Iterating global reduction 12 with 21 rules applied. Total rules applied 1724 place count 61 transition count 164
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1737 place count 61 transition count 151
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1742 place count 56 transition count 141
Iterating global reduction 13 with 5 rules applied. Total rules applied 1747 place count 56 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1752 place count 56 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 14 with 13 rules applied. Total rules applied 1765 place count 56 transition count 123
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1767 place count 54 transition count 119
Iterating global reduction 14 with 2 rules applied. Total rules applied 1769 place count 54 transition count 119
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1770 place count 53 transition count 118
Iterating global reduction 14 with 1 rules applied. Total rules applied 1771 place count 53 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1772 place count 53 transition count 117
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 15 with 2 rules applied. Total rules applied 1774 place count 52 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1775 place count 52 transition count 115
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 1779 place count 52 transition count 111
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1785 place count 48 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1786 place count 48 transition count 108
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 1793 place count 48 transition count 108
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1794 place count 48 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1795 place count 48 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1796 place count 47 transition count 105
Applied a total of 1796 rules in 57 ms. Remains 47 /1508 variables (removed 1461) and now considering 105/1932 (removed 1827) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 47/1508 places, 105/1932 transitions.
RANDOM walk for 40000 steps (801 resets) in 670 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (254 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
Probably explored full state space saw : 7866 states, properties seen :0
Probabilistic random walk after 33521 steps, saw 7866 distinct states, run finished after 50 ms. (steps per millisecond=670 ) properties seen :0
Explored full state space saw : 7866 states, properties seen :0
Exhaustive walk after 33521 steps, saw 7866 distinct states, run finished after 22 ms. (steps per millisecond=1523 ) properties seen :0
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X p1), (X (AND p0 p2 p1)), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X p1)), (X (X (AND p0 p2 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p0) p2)), (G (OR p2 p1)), (G (OR p0 (NOT p2))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p0)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p2) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 36 factoid took 489 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Graph (trivial) has 1838 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 3 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 878 vertex of which 869 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 (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 471 rules applied. Total rules applied 473 place count 868 transition count 723
Reduce places removed 471 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 493 rules applied. Total rules applied 966 place count 397 transition count 701
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 977 place count 386 transition count 701
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 977 place count 386 transition count 654
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1071 place count 339 transition count 654
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1087 place count 323 transition count 628
Iterating global reduction 3 with 16 rules applied. Total rules applied 1103 place count 323 transition count 628
Drop transitions (Trivial Post-Agglo cleanup.) 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 1106 place count 323 transition count 625
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1109 place count 320 transition count 625
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1119 place count 310 transition count 611
Iterating global reduction 5 with 10 rules applied. Total rules applied 1129 place count 310 transition count 611
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1135 place count 310 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1136 place count 309 transition count 603
Iterating global reduction 6 with 1 rules applied. Total rules applied 1137 place count 309 transition count 603
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1138 place count 308 transition count 601
Iterating global reduction 6 with 1 rules applied. Total rules applied 1139 place count 308 transition count 601
Performed 139 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 139 places in 1 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 6 with 278 rules applied. Total rules applied 1417 place count 169 transition count 384
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1430 place count 169 transition count 371
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1434 place count 165 transition count 366
Iterating global reduction 7 with 4 rules applied. Total rules applied 1438 place count 165 transition count 366
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1464 place count 152 transition count 350
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1479 place count 152 transition count 335
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1480 place count 151 transition count 333
Iterating global reduction 8 with 1 rules applied. Total rules applied 1481 place count 151 transition count 333
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1519 place count 132 transition count 375
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 1544 place count 132 transition count 350
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1553 place count 123 transition count 332
Iterating global reduction 9 with 9 rules applied. Total rules applied 1562 place count 123 transition count 332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1568 place count 123 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 10 with 44 rules applied. Total rules applied 1612 place count 123 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1613 place count 122 transition count 281
Applied a total of 1613 rules in 54 ms. Remains 122 /1508 variables (removed 1386) and now considering 281/1932 (removed 1651) transitions.
[2024-05-21 03:29:40] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
// Phase 1: matrix 223 rows 122 cols
[2024-05-21 03:29:40] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 03:29:40] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 03:29:40] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
[2024-05-21 03:29:40] [INFO ] Invariant cache hit.
[2024-05-21 03:29:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 03:29:40] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [16, 51, 84]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 178 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1508 places, 281/1932 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 116 transition count 278
Applied a total of 3 rules in 7 ms. Remains 116 /119 variables (removed 3) and now considering 278/281 (removed 3) transitions.
[2024-05-21 03:29:40] [INFO ] Flow matrix only has 220 transitions (discarded 58 similar events)
// Phase 1: matrix 220 rows 116 cols
[2024-05-21 03:29:40] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:29:40] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 03:29:40] [INFO ] Flow matrix only has 220 transitions (discarded 58 similar events)
[2024-05-21 03:29:40] [INFO ] Invariant cache hit.
[2024-05-21 03:29:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 03:29:40] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1508 places, 278/1932 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 381 ms. Remains : 116/1508 places, 278/1932 transitions.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X p1), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 119 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (5006 resets) in 664 ms. (60 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (723 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-05-21 03:29:41] [INFO ] Flow matrix only has 220 transitions (discarded 58 similar events)
[2024-05-21 03:29:41] [INFO ] Invariant cache hit.
[2024-05-21 03:29:41] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/88 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/246 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/333 variables, 57/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/335 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/336 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/88 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 158/246 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/333 variables, 57/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/335 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/335 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/336 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 278/278 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 116 transition count 209
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 77 place count 108 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 77 place count 108 transition count 208
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 79 place count 107 transition count 208
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 127 place count 83 transition count 184
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 138 place count 83 transition count 173
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 147 place count 74 transition count 164
Iterating global reduction 3 with 9 rules applied. Total rules applied 156 place count 74 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 159 place count 74 transition count 161
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 177 place count 65 transition count 152
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 181 place count 65 transition count 148
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 187 place count 59 transition count 138
Iterating global reduction 5 with 6 rules applied. Total rules applied 193 place count 59 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 199 place count 59 transition count 132
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 211 place count 53 transition count 132
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 219 place count 53 transition count 124
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 225 place count 47 transition count 114
Iterating global reduction 7 with 6 rules applied. Total rules applied 231 place count 47 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 237 place count 47 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 243 place count 47 transition count 102
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 244 place count 46 transition count 99
Iterating global reduction 8 with 1 rules applied. Total rules applied 245 place count 46 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 246 place count 46 transition count 98
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 247 place count 45 transition count 97
Iterating global reduction 9 with 1 rules applied. Total rules applied 248 place count 45 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 250 place count 45 transition count 95
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 257 place count 45 transition count 88
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 266 place count 38 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 267 place count 38 transition count 85
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 273 place count 38 transition count 85
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 274 place count 38 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 275 place count 38 transition count 83
Applied a total of 275 rules in 19 ms. Remains 38 /116 variables (removed 78) and now considering 83/278 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 38/116 places, 83/278 transitions.
RANDOM walk for 40000 steps (488 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (150 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6084 states, properties seen :0
Probabilistic random walk after 26433 steps, saw 6084 distinct states, run finished after 23 ms. (steps per millisecond=1149 ) properties seen :0
Explored full state space saw : 6084 states, properties seen :0
Exhaustive walk after 26433 steps, saw 6084 distinct states, run finished after 15 ms. (steps per millisecond=1762 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X p1), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 12 factoid took 243 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 10232 reset in 204 ms.
Product exploration explored 100000 steps with 10226 reset in 288 ms.
Built C files in :
/tmp/ltsmin9072968891176899983
[2024-05-21 03:29:42] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2024-05-21 03:29:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:29:42] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2024-05-21 03:29:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:29:42] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2024-05-21 03:29:42] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:29:42] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9072968891176899983
Running compilation step : cd /tmp/ltsmin9072968891176899983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 662 ms.
Running link step : cd /tmp/ltsmin9072968891176899983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9072968891176899983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3835452433368929368.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 278/278 transitions.
Applied a total of 0 rules in 11 ms. Remains 116 /116 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2024-05-21 03:29:57] [INFO ] Flow matrix only has 220 transitions (discarded 58 similar events)
[2024-05-21 03:29:57] [INFO ] Invariant cache hit.
[2024-05-21 03:29:57] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 03:29:57] [INFO ] Flow matrix only has 220 transitions (discarded 58 similar events)
[2024-05-21 03:29:57] [INFO ] Invariant cache hit.
[2024-05-21 03:29:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 03:29:57] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-21 03:29:57] [INFO ] Redundant transitions in 62 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-21 03:29:57] [INFO ] Flow matrix only has 220 transitions (discarded 58 similar events)
[2024-05-21 03:29:57] [INFO ] Invariant cache hit.
[2024-05-21 03:29:57] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 219/332 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 3/335 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 0/335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/336 variables, and 120 constraints, problems are : Problem set: 0 solved, 265 unsolved in 6670 ms.
Refiners :[State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 219/332 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 192/309 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 3/335 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 73/385 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/336 variables, and 385 constraints, problems are : Problem set: 0 solved, 265 unsolved in 9067 ms.
Refiners :[State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
After SMT, in 15893ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 15896ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16119 ms. Remains : 116/116 places, 278/278 transitions.
Built C files in :
/tmp/ltsmin4346842800827864259
[2024-05-21 03:30:13] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2024-05-21 03:30:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:30:13] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2024-05-21 03:30:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:30:13] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2024-05-21 03:30:13] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:30:13] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4346842800827864259
Running compilation step : cd /tmp/ltsmin4346842800827864259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 537 ms.
Running link step : cd /tmp/ltsmin4346842800827864259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4346842800827864259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3000891515357787995.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:30:29] [INFO ] Flatten gal took : 14 ms
[2024-05-21 03:30:29] [INFO ] Flatten gal took : 9 ms
[2024-05-21 03:30:29] [INFO ] Time to serialize gal into /tmp/LTL8680165257558607468.gal : 3 ms
[2024-05-21 03:30:29] [INFO ] Time to serialize properties into /tmp/LTL2819199270894970476.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8680165257558607468.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8241847471857963409.hoa' '-atoms' '/tmp/LTL2819199270894970476.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2819199270894970476.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8241847471857963409.hoa
Reverse transition relation is NOT exact ! Due to transitions t194, t307, t463, t669, t782, t934, t1138, t1254, t1408, t1695.t1696.t1697.t1813, t1579.t1580...1761
Computing Next relation with stutter on 22432 deadlock states
3 unique states visited
0 strongly connected components in search stack
6 transitions explored
3 items max in DFS search stack
442 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.45652,165092,1,0,481,586758,538,294,4458,1.13478e+06,748
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-11 finished in 125053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 1966/1966 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1524 transition count 1952
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1524 transition count 1952
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 1524 transition count 1950
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 1518 transition count 1944
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 1518 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 1515 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 1515 transition count 1941
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 1515 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 1512 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 1510 transition count 1934
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1509 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1507 transition count 1929
Applied a total of 65 rules in 391 ms. Remains 1507 /1538 variables (removed 31) and now considering 1929/1966 (removed 37) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 03:30:34] [INFO ] Computed 4 invariants in 20 ms
[2024-05-21 03:30:35] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-21 03:30:35] [INFO ] Invariant cache hit.
[2024-05-21 03:30:35] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 03:30:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60572ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60597ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1538 places, 1929/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62112 ms. Remains : 1507/1538 places, 1929/1966 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 355 ms.
Product exploration explored 100000 steps with 33333 reset in 371 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2104 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 26 stabilizing places and 28 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-301-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-13 finished in 63026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 4 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 1966/1966 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1526 transition count 1954
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1526 transition count 1954
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 1526 transition count 1952
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 1520 transition count 1946
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 1520 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 1518 transition count 1944
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 1516 transition count 1942
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 1514 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 1514 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1513 transition count 1938
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 1512 transition count 1936
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 1511 transition count 1935
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 1511 transition count 1935
Applied a total of 56 rules in 399 ms. Remains 1511 /1538 variables (removed 27) and now considering 1935/1966 (removed 31) transitions.
// Phase 1: matrix 1935 rows 1511 cols
[2024-05-21 03:31:37] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 03:31:38] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 03:31:38] [INFO ] Invariant cache hit.
[2024-05-21 03:31:38] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2024-05-21 03:31:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints]
After SMT, in 60500ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60519ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1538 places, 1935/1966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62035 ms. Remains : 1511/1538 places, 1935/1966 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-15
Product exploration explored 100000 steps with 771 reset in 130 ms.
Product exploration explored 100000 steps with 771 reset in 133 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2110 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 82 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (305 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (86 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 426013 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 426013 steps, saw 104455 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2024-05-21 03:32:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 682/1500 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1925/3425 variables, 1500/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3446/3446 variables, and 1515 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1171 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 682/1500 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1925/3425 variables, 1500/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3446 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3446 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3446 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3446/3446 variables, and 1516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1227 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2424ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 1511 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1511/1511 places, 1935/1935 transitions.
Applied a total of 0 rules in 42 ms. Remains 1511 /1511 variables (removed 0) and now considering 1935/1935 (removed 0) transitions.
[2024-05-21 03:32:46] [INFO ] Invariant cache hit.
[2024-05-21 03:32:46] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 03:32:46] [INFO ] Invariant cache hit.
[2024-05-21 03:32:47] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2024-05-21 03:32:47] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 1.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 1.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60501ms
Finished structural reductions in LTL mode , in 1 iterations and 61606 ms. Remains : 1511/1511 places, 1935/1935 transitions.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2110 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (308 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (82 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 426465 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 426465 steps, saw 104803 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2024-05-21 03:33:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 682/1500 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1925/3425 variables, 1500/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3446/3446 variables, and 1515 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1179 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 682/1500 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1925/3425 variables, 1500/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3446 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3446 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3446 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3446/3446 variables, and 1516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1312 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2502ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 110 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 776 reset in 126 ms.
Product exploration explored 100000 steps with 778 reset in 135 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 1511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1511/1511 places, 1935/1935 transitions.
Graph (trivial) has 1845 edges and 1511 vertex of which 693 / 1511 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1372 edges and 881 vertex of which 872 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 (Output transitions of discarded places.) removed 5 transitions
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 872 transition count 1198
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 490 place count 872 transition count 1186
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 490 place count 872 transition count 1198
Deduced a syphon composed of 497 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 511 place count 872 transition count 1198
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 794 place count 589 transition count 905
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1077 place count 589 transition count 905
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1088 place count 578 transition count 891
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1099 place count 578 transition count 891
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 578 transition count 885
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1116 place count 567 transition count 874
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1127 place count 567 transition count 874
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1129 place count 565 transition count 870
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1131 place count 565 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1133 place count 563 transition count 866
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1135 place count 563 transition count 866
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1139 place count 559 transition count 862
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1143 place count 559 transition count 862
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1145 place count 557 transition count 858
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1147 place count 557 transition count 858
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1149 place count 555 transition count 854
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1151 place count 555 transition count 854
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1154 place count 552 transition count 850
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1157 place count 552 transition count 850
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1159 place count 550 transition count 842
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1161 place count 550 transition count 842
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1163 place count 548 transition count 840
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1165 place count 548 transition count 840
Performed 107 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 3 with 107 rules applied. Total rules applied 1272 place count 548 transition count 913
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 1314 place count 548 transition count 871
Discarding 103 places :
Symmetric choice reduction at 4 with 103 rule applications. Total rules 1417 place count 445 transition count 758
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 4 with 103 rules applied. Total rules applied 1520 place count 445 transition count 758
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1527 place count 438 transition count 747
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1534 place count 438 transition count 747
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1535 place count 437 transition count 746
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1536 place count 437 transition count 746
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1543 place count 437 transition count 746
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1548 place count 437 transition count 741
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1563 place count 422 transition count 722
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1578 place count 422 transition count 722
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1584 place count 422 transition count 716
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1589 place count 417 transition count 710
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 6 with 5 rules applied. Total rules applied 1594 place count 417 transition count 710
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1596 place count 415 transition count 705
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 1598 place count 415 transition count 705
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1599 place count 414 transition count 704
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 1600 place count 414 transition count 704
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 6 with 3 rules applied. Total rules applied 1603 place count 414 transition count 704
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1609 place count 414 transition count 698
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1612 place count 411 transition count 695
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1615 place count 411 transition count 695
Performed 71 Post agglomeration using F-continuation condition with reduction of 129 identical transitions.
Deduced a syphon composed of 281 places in 0 ms
Iterating global reduction 7 with 71 rules applied. Total rules applied 1686 place count 411 transition count 1023
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 7 with 120 rules applied. Total rules applied 1806 place count 411 transition count 903
Discarding 124 places :
Symmetric choice reduction at 8 with 124 rule applications. Total rules 1930 place count 287 transition count 571
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 8 with 124 rules applied. Total rules applied 2054 place count 287 transition count 571
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 2068 place count 287 transition count 557
Discarding 24 places :
Symmetric choice reduction at 9 with 24 rule applications. Total rules 2092 place count 263 transition count 510
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 9 with 24 rules applied. Total rules applied 2116 place count 263 transition count 510
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 2118 place count 263 transition count 544
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2120 place count 261 transition count 525
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 2122 place count 261 transition count 525
Deduced a syphon composed of 142 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 9 with 44 rules applied. Total rules applied 2166 place count 261 transition count 481
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2170 place count 257 transition count 477
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2174 place count 257 transition count 477
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2177 place count 257 transition count 537
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2180 place count 254 transition count 522
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2183 place count 254 transition count 522
Deduced a syphon composed of 138 places in 0 ms
Applied a total of 2183 rules in 326 ms. Remains 254 /1511 variables (removed 1257) and now considering 522/1935 (removed 1413) transitions.
[2024-05-21 03:33:54] [INFO ] Redundant transitions in 9 ms returned []
Running 521 sub problems to find dead transitions.
[2024-05-21 03:33:54] [INFO ] Flow matrix only has 465 transitions (discarded 57 similar events)
// Phase 1: matrix 465 rows 254 cols
[2024-05-21 03:33:54] [INFO ] Computed 0 invariants in 7 ms
[2024-05-21 03:33:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
At refinement iteration 1 (OVERLAPS) 464/717 variables, 253/253 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/717 variables, 2/255 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/717 variables, 0/255 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 1/718 variables, 1/256 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/718 variables, 0/256 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 1/719 variables, 1/257 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/719 variables, 0/257 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 0/719 variables, 0/257 constraints. Problems are: Problem set: 254 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 719/719 variables, and 257 constraints, problems are : Problem set: 254 solved, 267 unsolved in 19417 ms.
Refiners :[State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 254 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 461/576 variables, 115/115 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 2/117 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 267/384 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 0/384 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 142/718 variables, 139/523 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 0/523 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/719 variables, 1/524 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/719 variables, 0/524 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 0/719 variables, 0/524 constraints. Problems are: Problem set: 254 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 719/719 variables, and 524 constraints, problems are : Problem set: 254 solved, 267 unsolved in 26012 ms.
Refiners :[State Equation: 254/254 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 267/521 constraints, Known Traps: 0/0 constraints]
After SMT, in 45638ms problems are : Problem set: 254 solved, 267 unsolved
Search for dead transitions found 254 dead transitions in 45643ms
Found 254 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 254 transitions
Dead transitions reduction (with SMT) removed 254 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 254/1511 places, 268/1935 transitions.
Graph (complete) has 412 edges and 254 vertex of which 116 are kept as prefixes of interest. Removing 138 places using SCC suffix rule.0 ms
Discarding 138 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 116 /254 variables (removed 138) and now considering 268/268 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1511 places, 268/1935 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46018 ms. Remains : 116/1511 places, 268/1935 transitions.
Built C files in :
/tmp/ltsmin384455727724294102
[2024-05-21 03:34:40] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin384455727724294102
Running compilation step : cd /tmp/ltsmin384455727724294102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin384455727724294102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin384455727724294102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1511/1511 places, 1935/1935 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1509 transition count 1933
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1508 transition count 1932
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1507 transition count 1931
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1507 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1506 transition count 1928
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1506 transition count 1928
Applied a total of 11 rules in 195 ms. Remains 1506 /1511 variables (removed 5) and now considering 1928/1935 (removed 7) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 03:34:43] [INFO ] Computed 4 invariants in 10 ms
[2024-05-21 03:34:43] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 03:34:43] [INFO ] Invariant cache hit.
[2024-05-21 03:34:44] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 03:34:44] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60488ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60505ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1511 places, 1928/1935 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61900 ms. Remains : 1506/1511 places, 1928/1935 transitions.
Built C files in :
/tmp/ltsmin6489694411838870765
[2024-05-21 03:35:45] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6489694411838870765
Running compilation step : cd /tmp/ltsmin6489694411838870765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6489694411838870765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6489694411838870765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 03:35:48] [INFO ] Flatten gal took : 45 ms
[2024-05-21 03:35:48] [INFO ] Flatten gal took : 42 ms
[2024-05-21 03:35:48] [INFO ] Time to serialize gal into /tmp/LTL11983186093321766455.gal : 16 ms
[2024-05-21 03:35:48] [INFO ] Time to serialize properties into /tmp/LTL13057519598308270556.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11983186093321766455.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9730697126121764504.hoa' '-atoms' '/tmp/LTL13057519598308270556.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13057519598308270556.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9730697126121764504.hoa
Detected timeout of ITS tools.
[2024-05-21 03:36:03] [INFO ] Flatten gal took : 44 ms
[2024-05-21 03:36:03] [INFO ] Flatten gal took : 39 ms
[2024-05-21 03:36:03] [INFO ] Time to serialize gal into /tmp/LTL12947040609509803559.gal : 8 ms
[2024-05-21 03:36:03] [INFO ] Time to serialize properties into /tmp/LTL11621042911927006784.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12947040609509803559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11621042911927006784.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("((p916==0)||(p431==1))"))&&(X(G("((p2463==0)||(p1513==1))"))))))
Formula 0 simplified : X(G!"((p916==0)||(p431==1))" | XF!"((p2463==0)||(p1513==1))")
Detected timeout of ITS tools.
[2024-05-21 03:36:18] [INFO ] Flatten gal took : 38 ms
[2024-05-21 03:36:18] [INFO ] Applying decomposition
[2024-05-21 03:36:18] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17202940785693994514.txt' '-o' '/tmp/graph17202940785693994514.bin' '-w' '/tmp/graph17202940785693994514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17202940785693994514.bin' '-l' '-1' '-v' '-w' '/tmp/graph17202940785693994514.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:36:19] [INFO ] Decomposing Gal with order
[2024-05-21 03:36:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:36:19] [INFO ] Removed a total of 501 redundant transitions.
[2024-05-21 03:36:19] [INFO ] Flatten gal took : 151 ms
[2024-05-21 03:36:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 33 ms.
[2024-05-21 03:36:19] [INFO ] Time to serialize gal into /tmp/LTL142599276635717178.gal : 24 ms
[2024-05-21 03:36:19] [INFO ] Time to serialize properties into /tmp/LTL13955284859974345686.ltl : 11 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL142599276635717178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13955284859974345686.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F("((i15.i1.i0.u214.p916==0)||(i0.u78.p431==1))"))&&(X(G("((i36.i3.i1.u597.p2463==0)||(i26.i0.i2.u400.p1513==1))"))))))
Formula 0 simplified : X(G!"((i15.i1.i0.u214.p916==0)||(i0.u78.p431==1))" | XF!"((i36.i3.i1.u597.p2463==0)||(i26.i0.i2.u400.p1513==1))")
Reverse transition relation is NOT exact ! Due to transitions t26, t190, t272, t332, t384, t456, t508, t665, t694, t746, t807, t927, t978, t1163, t1219, t1...2086
Computing Next relation with stutter on 91936 deadlock states
39 unique states visited
39 strongly connected components in search stack
40 transitions explored
39 items max in DFS search stack
584 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.0126,234392,1,0,385277,9100,22662,800942,683,58483,1753163
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-15 finished in 289098 ms.
All properties solved by simple procedures.
Total runtime 746264 ms.

BK_STOP 1716262586601

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-301, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624188600115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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