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.r091-tall-171624187300228.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 greatspnxred
Input is CloudReconfiguration-PT-315, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187300228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K 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 50K 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 May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 19:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 19:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 19:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 19:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716270809140

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-315
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 05:53:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 05:53:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:53:30] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-21 05:53:30] [INFO ] Transformed 2585 places.
[2024-05-21 05:53:30] [INFO ] Transformed 3095 transitions.
[2024-05-21 05:53:30] [INFO ] Found NUPN structural information;
[2024-05-21 05:53:30] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CloudReconfiguration-PT-315-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 519 places :
Symmetric choice reduction at 0 with 519 rule applications. Total rules 519 place count 2066 transition count 2576
Iterating global reduction 0 with 519 rules applied. Total rules applied 1038 place count 2066 transition count 2576
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1067 place count 2066 transition count 2547
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1306 place count 1827 transition count 2308
Iterating global reduction 1 with 239 rules applied. Total rules applied 1545 place count 1827 transition count 2308
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 1632 place count 1740 transition count 2221
Iterating global reduction 1 with 87 rules applied. Total rules applied 1719 place count 1740 transition count 2221
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1736 place count 1740 transition count 2204
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1784 place count 1692 transition count 2156
Iterating global reduction 2 with 48 rules applied. Total rules applied 1832 place count 1692 transition count 2156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1841 place count 1692 transition count 2147
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1878 place count 1655 transition count 2106
Iterating global reduction 3 with 37 rules applied. Total rules applied 1915 place count 1655 transition count 2106
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1941 place count 1629 transition count 2080
Iterating global reduction 3 with 26 rules applied. Total rules applied 1967 place count 1629 transition count 2080
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1992 place count 1604 transition count 2055
Iterating global reduction 3 with 25 rules applied. Total rules applied 2017 place count 1604 transition count 2055
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2042 place count 1579 transition count 2030
Iterating global reduction 3 with 25 rules applied. Total rules applied 2067 place count 1579 transition count 2030
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2087 place count 1559 transition count 1998
Iterating global reduction 3 with 20 rules applied. Total rules applied 2107 place count 1559 transition count 1998
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2115 place count 1551 transition count 1984
Iterating global reduction 3 with 8 rules applied. Total rules applied 2123 place count 1551 transition count 1984
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2131 place count 1543 transition count 1973
Iterating global reduction 3 with 8 rules applied. Total rules applied 2139 place count 1543 transition count 1973
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2142 place count 1543 transition count 1970
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2145 place count 1540 transition count 1967
Iterating global reduction 4 with 3 rules applied. Total rules applied 2148 place count 1540 transition count 1967
Applied a total of 2148 rules in 1611 ms. Remains 1540 /2585 variables (removed 1045) and now considering 1967/3095 (removed 1128) transitions.
// Phase 1: matrix 1967 rows 1540 cols
[2024-05-21 05:53:32] [INFO ] Computed 4 invariants in 35 ms
[2024-05-21 05:53:33] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-05-21 05:53:33] [INFO ] Invariant cache hit.
[2024-05-21 05:53:34] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
Running 1966 sub problems to find dead transitions.
[2024-05-21 05:53:34] [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/1539 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/3507 variables, and 4 constraints, problems are : Problem set: 0 solved, 1966 unsolved in 30070 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1540 constraints, PredecessorRefiner: 1966/1966 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1539 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1966 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 1539/3507 variables, and 4 constraints, problems are : Problem set: 0 solved, 1966 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1540 constraints, PredecessorRefiner: 0/1966 constraints, Known Traps: 0/0 constraints]
After SMT, in 60797ms problems are : Problem set: 0 solved, 1966 unsolved
Search for dead transitions found 0 dead transitions in 60841ms
Starting structural reductions in LTL mode, iteration 1 : 1540/2585 places, 1967/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64205 ms. Remains : 1540/2585 places, 1967/3095 transitions.
Support contains 28 out of 1540 places after structural reductions.
[2024-05-21 05:54:35] [INFO ] Flatten gal took : 183 ms
[2024-05-21 05:54:35] [INFO ] Flatten gal took : 120 ms
[2024-05-21 05:54:35] [INFO ] Input system was already deterministic with 1967 transitions.
Support contains 26 out of 1540 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (318 resets) in 1493 ms. (26 steps per ms) remains 15/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (12 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (11 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
[2024-05-21 05:54:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1513/1529 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1529 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1957/3486 variables, 1529/1533 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3486 variables, 0/1533 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/3488 variables, 1/1534 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3488 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2/3490 variables, 1/1535 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3490 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/3492 variables, 1/1536 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3492 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 2/3494 variables, 1/1537 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3494 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 2/3496 variables, 1/1538 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3496 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 2/3498 variables, 1/1539 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3498 variables, 0/1539 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 2/3500 variables, 1/1540 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3500/3507 variables, and 1540 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1536/1540 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1513/1529 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1529 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1957/3486 variables, 1529/1533 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3486 variables, 14/1547 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3486 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 2/3488 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3488 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 2/3490 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3490 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 2/3492 variables, 1/1550 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3492 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 2/3494 variables, 1/1551 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3494 variables, 0/1551 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 2/3496 variables, 1/1552 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3496 variables, 0/1552 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SMT process timed out in 10044ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 1540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Graph (trivial) has 1834 edges and 1540 vertex of which 645 / 1540 are part of one of the 61 SCC in 11 ms
Free SCC test removed 584 places
Drop transitions (Empty/Sink Transition effects.) removed 729 transitions
Reduce isomorphic transitions removed 729 transitions.
Graph (complete) has 1410 edges and 956 vertex of which 947 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 509 transitions
Trivial Post-agglo rules discarded 509 transitions
Performed 509 trivial Post agglomeration. Transition count delta: 509
Iterating post reduction 0 with 515 rules applied. Total rules applied 517 place count 947 transition count 719
Reduce places removed 509 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 559 rules applied. Total rules applied 1076 place count 438 transition count 669
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 2 with 34 rules applied. Total rules applied 1110 place count 407 transition count 666
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 3 with 3 rules applied. Total rules applied 1113 place count 406 transition count 664
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 4 with 10 rules applied. Total rules applied 1123 place count 405 transition count 655
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 15 rules applied. Total rules applied 1138 place count 396 transition count 649
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 1142 place count 394 transition count 647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1143 place count 393 transition count 647
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 56 Pre rules applied. Total rules applied 1143 place count 393 transition count 591
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 8 with 112 rules applied. Total rules applied 1255 place count 337 transition count 591
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1266 place count 326 transition count 577
Iterating global reduction 8 with 11 rules applied. Total rules applied 1277 place count 326 transition count 577
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 8 with 2 rules applied. Total rules applied 1279 place count 326 transition count 575
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1281 place count 324 transition count 575
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 1281 place count 324 transition count 573
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1285 place count 322 transition count 573
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1292 place count 315 transition count 566
Iterating global reduction 10 with 7 rules applied. Total rules applied 1299 place count 315 transition count 566
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1305 place count 315 transition count 560
Performed 156 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 11 with 312 rules applied. Total rules applied 1617 place count 159 transition count 309
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 1641 place count 159 transition count 285
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1644 place count 156 transition count 282
Iterating global reduction 12 with 3 rules applied. Total rules applied 1647 place count 156 transition count 282
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 12 with 24 rules applied. Total rules applied 1671 place count 144 transition count 268
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1685 place count 144 transition count 254
Performed 38 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 13 with 76 rules applied. Total rules applied 1761 place count 106 transition count 286
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 13 with 31 rules applied. Total rules applied 1792 place count 106 transition count 255
Discarding 18 places :
Symmetric choice reduction at 14 with 18 rule applications. Total rules 1810 place count 88 transition count 219
Iterating global reduction 14 with 18 rules applied. Total rules applied 1828 place count 88 transition count 219
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 1837 place count 88 transition count 210
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 1842 place count 83 transition count 200
Iterating global reduction 15 with 5 rules applied. Total rules applied 1847 place count 83 transition count 200
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1852 place count 83 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 16 with 9 rules applied. Total rules applied 1861 place count 83 transition count 186
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1862 place count 82 transition count 185
Iterating global reduction 16 with 1 rules applied. Total rules applied 1863 place count 82 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1865 place count 81 transition count 184
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 1868 place count 81 transition count 181
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 1872 place count 78 transition count 180
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 1876 place count 78 transition count 180
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1878 place count 78 transition count 180
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1879 place count 78 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1880 place count 77 transition count 178
Applied a total of 1880 rules in 199 ms. Remains 77 /1540 variables (removed 1463) and now considering 178/1967 (removed 1789) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 77/1540 places, 178/1967 transitions.
RANDOM walk for 36399 steps (978 resets) in 1026 ms. (35 steps per ms) remains 0/14 properties
FORMULA CloudReconfiguration-PT-315-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 29 stabilizing places and 31 stable transitions
Graph (complete) has 2144 edges and 1540 vertex of which 1531 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' '!((p0 U (p1||X((G(p1)||F(p2))))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1528 transition count 1952
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1528 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1528 transition count 1951
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 1522 transition count 1945
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 1522 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 1519 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 1519 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1517 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1517 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1515 transition count 1938
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1515 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 1513 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 1513 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 1511 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1510 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1510 transition count 1932
Applied a total of 61 rules in 520 ms. Remains 1510 /1540 variables (removed 30) and now considering 1932/1967 (removed 35) transitions.
// Phase 1: matrix 1932 rows 1510 cols
[2024-05-21 05:54:48] [INFO ] Computed 4 invariants in 10 ms
[2024-05-21 05:54:48] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-21 05:54:48] [INFO ] Invariant cache hit.
[2024-05-21 05:54:49] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-21 05:54:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 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/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60669ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60689ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1540 places, 1932/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62696 ms. Remains : 1510/1540 places, 1932/1967 transitions.
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-00
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 4 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-00 finished in 63114 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(X(X(X(X(X(X(F(p0))))))))))'
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1526 transition count 1950
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1526 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1526 transition count 1949
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 1519 transition count 1942
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 1519 transition count 1942
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 1515 transition count 1938
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 1515 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 1513 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 1513 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 1511 transition count 1934
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 1511 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1509 transition count 1932
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1509 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 1507 transition count 1929
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1506 transition count 1928
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1506 transition count 1928
Applied a total of 69 rules in 405 ms. Remains 1506 /1540 variables (removed 34) and now considering 1928/1967 (removed 39) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 05:55:51] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 05:55:51] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-21 05:55:51] [INFO ] Invariant cache hit.
[2024-05-21 05:55:52] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 05:55:52] [INFO ] Invariant cache hit.
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 30031 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 30040 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 60560ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1540 places, 1928/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62203 ms. Remains : 1506/1540 places, 1928/1967 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-03
Product exploration explored 100000 steps with 11111 reset in 275 ms.
Product exploration explored 100000 steps with 11111 reset in 256 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 9 states, 9 edges and 1 AP (stutter sensitive) to 9 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (300 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (94 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 439627 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 439627 steps, saw 119735 distinct states, run finished after 3004 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-21 05:56:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 415/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1261 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 415/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1304 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2576ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 135 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 9 states, 9 edges and 1 AP (stutter sensitive) to 9 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 49 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2024-05-21 05:57:00] [INFO ] Invariant cache hit.
[2024-05-21 05:57:01] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-21 05:57:01] [INFO ] Invariant cache hit.
[2024-05-21 05:57:01] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 05:57:02] [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/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 30032 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
(s672 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 0)
(s359 0)
(s360 1)
(s361 1)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 1)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30046 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 60583ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60603ms
Finished structural reductions in LTL mode , in 1 iterations and 61874 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.13 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 9 states, 9 edges and 1 AP (stutter sensitive) to 9 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (306 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (95 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 443221 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 443221 steps, saw 120269 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2024-05-21 05:58:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 415/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1204 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 415/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1253 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2468ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 87 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=87 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 9 states, 9 edges and 1 AP (stutter sensitive) to 9 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 383 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 389 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 190 ms.
Product exploration explored 100000 steps with 11111 reset in 211 ms.
Applying partial POR strategy [true, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 401 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1838 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 5 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1367 edges and 876 vertex of which 867 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 474 rules applied. Total rules applied 476 place count 867 transition count 1191
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 488 place count 867 transition count 1179
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 488 place count 867 transition count 1192
Deduced a syphon composed of 495 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 509 place count 867 transition count 1192
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 792 place count 584 transition count 899
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1075 place count 584 transition count 899
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1087 place count 572 transition count 883
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1099 place count 572 transition count 883
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 572 transition count 877
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1117 place count 560 transition count 865
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1129 place count 560 transition count 865
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 558 transition count 861
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 558 transition count 861
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 556 transition count 857
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 556 transition count 857
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1141 place count 552 transition count 853
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1145 place count 552 transition count 853
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 550 transition count 849
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 550 transition count 849
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 548 transition count 845
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 548 transition count 845
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 544 transition count 839
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 544 transition count 839
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 540 transition count 823
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 540 transition count 823
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1170 place count 540 transition count 823
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1174 place count 536 transition count 819
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1178 place count 536 transition count 819
Performed 104 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 313 places in 1 ms
Iterating global reduction 4 with 104 rules applied. Total rules applied 1282 place count 536 transition count 893
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 1320 place count 536 transition count 855
Discarding 98 places :
Symmetric choice reduction at 5 with 98 rule applications. Total rules 1418 place count 438 transition count 749
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 98 rules applied. Total rules applied 1516 place count 438 transition count 749
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1520 place count 434 transition count 743
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 1524 place count 434 transition count 743
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 5 with 7 rules applied. Total rules applied 1531 place count 434 transition count 743
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1535 place count 434 transition count 739
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1550 place count 419 transition count 720
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1565 place count 419 transition count 720
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1569 place count 419 transition count 716
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1573 place count 415 transition count 712
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1577 place count 415 transition count 712
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1580 place count 415 transition count 712
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1586 place count 415 transition count 706
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1589 place count 412 transition count 703
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1592 place count 412 transition count 703
Performed 70 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 282 places in 0 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1662 place count 412 transition count 1018
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1783 place count 412 transition count 897
Discarding 125 places :
Symmetric choice reduction at 9 with 125 rule applications. Total rules 1908 place count 287 transition count 566
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 9 with 125 rules applied. Total rules applied 2033 place count 287 transition count 566
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2048 place count 287 transition count 551
Discarding 26 places :
Symmetric choice reduction at 10 with 26 rule applications. Total rules 2074 place count 261 transition count 498
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 26 rules applied. Total rules applied 2100 place count 261 transition count 498
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2103 place count 261 transition count 548
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2106 place count 258 transition count 520
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2109 place count 258 transition count 520
Deduced a syphon composed of 140 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 10 with 47 rules applied. Total rules applied 2156 place count 258 transition count 473
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2161 place count 253 transition count 468
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 5 rules applied. Total rules applied 2166 place count 253 transition count 468
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2169 place count 253 transition count 528
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2172 place count 250 transition count 513
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2175 place count 250 transition count 513
Deduced a syphon composed of 135 places in 0 ms
Applied a total of 2175 rules in 408 ms. Remains 250 /1506 variables (removed 1256) and now considering 513/1928 (removed 1415) transitions.
[2024-05-21 05:58:11] [INFO ] Redundant transitions in 28 ms returned []
Running 512 sub problems to find dead transitions.
[2024-05-21 05:58:11] [INFO ] Flow matrix only has 456 transitions (discarded 57 similar events)
// Phase 1: matrix 456 rows 250 cols
[2024-05-21 05:58:11] [INFO ] Computed 0 invariants in 6 ms
[2024-05-21 05:58:11] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 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 TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 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 TDEAD188 is UNSAT
Problem TDEAD190 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 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 TDEAD243 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 TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 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 TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 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 TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
At refinement iteration 1 (OVERLAPS) 455/704 variables, 249/249 constraints. Problems are: Problem set: 246 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 2/251 constraints. Problems are: Problem set: 246 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/251 constraints. Problems are: Problem set: 246 solved, 266 unsolved
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/705 variables, 1/252 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 0/252 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/706 variables, 1/253 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/706 variables, 0/253 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 0/706 variables, 0/253 constraints. Problems are: Problem set: 251 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 706/706 variables, and 253 constraints, problems are : Problem set: 251 solved, 261 unsolved in 20313 ms.
Refiners :[State Equation: 250/250 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 251 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 452/566 variables, 114/114 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 2/116 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 261/377 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/377 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 139/705 variables, 136/513 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 0/513 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 1/706 variables, 1/514 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/706 variables, 0/514 constraints. Problems are: Problem set: 251 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 0/706 variables, 0/514 constraints. Problems are: Problem set: 251 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 706/706 variables, and 514 constraints, problems are : Problem set: 251 solved, 261 unsolved in 27668 ms.
Refiners :[State Equation: 250/250 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 261/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 48241ms problems are : Problem set: 251 solved, 261 unsolved
Search for dead transitions found 251 dead transitions in 48247ms
Found 251 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 251 transitions
Dead transitions reduction (with SMT) removed 251 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 250/1506 places, 262/1928 transitions.
Graph (complete) has 406 edges and 250 vertex of which 115 are kept as prefixes of interest. Removing 135 places using SCC suffix rule.2 ms
Discarding 135 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 108 transition count 244
Applied a total of 8 rules in 12 ms. Remains 108 /250 variables (removed 142) and now considering 244/262 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/1506 places, 244/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48710 ms. Remains : 108/1506 places, 244/1928 transitions.
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 53 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 05:58:59] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 05:59:00] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 05:59:00] [INFO ] Invariant cache hit.
[2024-05-21 05:59:00] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 05:59:00] [INFO ] Invariant cache hit.
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 30029 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 30033 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 60571ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60589ms
Finished structural reductions in LTL mode , in 1 iterations and 61820 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Treatment of property CloudReconfiguration-PT-315-LTLFireability-03 finished in 251092 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(F(p0)))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Graph (trivial) has 1875 edges and 1540 vertex of which 688 / 1540 are part of one of the 62 SCC in 2 ms
Free SCC test removed 626 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1411 edges and 914 vertex of which 905 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 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 904 transition count 741
Reduce places removed 493 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 516 rules applied. Total rules applied 1011 place count 411 transition count 718
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1022 place count 400 transition count 718
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1022 place count 400 transition count 667
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1124 place count 349 transition count 667
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1144 place count 329 transition count 635
Iterating global reduction 3 with 20 rules applied. Total rules applied 1164 place count 329 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 3 with 2 rules applied. Total rules applied 1166 place count 329 transition count 633
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1168 place count 327 transition count 633
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1168 place count 327 transition count 632
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1170 place count 326 transition count 632
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1181 place count 315 transition count 617
Iterating global reduction 5 with 11 rules applied. Total rules applied 1192 place count 315 transition count 617
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1198 place count 315 transition count 611
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1200 place count 313 transition count 607
Iterating global reduction 6 with 2 rules applied. Total rules applied 1202 place count 313 transition count 607
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1204 place count 311 transition count 603
Iterating global reduction 6 with 2 rules applied. Total rules applied 1206 place count 311 transition count 603
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1208 place count 309 transition count 599
Iterating global reduction 6 with 2 rules applied. Total rules applied 1210 place count 309 transition count 599
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1212 place count 307 transition count 595
Iterating global reduction 6 with 2 rules applied. Total rules applied 1214 place count 307 transition count 595
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1216 place count 305 transition count 591
Iterating global reduction 6 with 2 rules applied. Total rules applied 1218 place count 305 transition count 591
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1219 place count 304 transition count 584
Iterating global reduction 6 with 1 rules applied. Total rules applied 1220 place count 304 transition count 584
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 6 with 1 rules applied. Total rules applied 1221 place count 304 transition count 583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1222 place count 303 transition count 583
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1223 place count 302 transition count 576
Iterating global reduction 8 with 1 rules applied. Total rules applied 1224 place count 302 transition count 576
Performed 141 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 141 places in 1 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 8 with 282 rules applied. Total rules applied 1506 place count 161 transition count 354
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
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 13 rules applied. Total rules applied 1519 place count 161 transition count 341
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 1521 place count 160 transition count 340
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1525 place count 156 transition count 335
Iterating global reduction 10 with 4 rules applied. Total rules applied 1529 place count 156 transition count 335
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 10 with 24 rules applied. Total rules applied 1553 place count 144 transition count 321
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1564 place count 144 transition count 310
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 1600 place count 126 transition count 344
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1617 place count 126 transition count 327
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1626 place count 117 transition count 309
Iterating global reduction 12 with 9 rules applied. Total rules applied 1635 place count 117 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1641 place count 117 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 13 with 37 rules applied. Total rules applied 1678 place count 117 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1679 place count 116 transition count 265
Applied a total of 1679 rules in 86 ms. Remains 116 /1540 variables (removed 1424) and now considering 265/1967 (removed 1702) transitions.
[2024-05-21 06:00:01] [INFO ] Flow matrix only has 209 transitions (discarded 56 similar events)
// Phase 1: matrix 209 rows 116 cols
[2024-05-21 06:00:01] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:00:01] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 06:00:01] [INFO ] Flow matrix only has 209 transitions (discarded 56 similar events)
[2024-05-21 06:00:01] [INFO ] Invariant cache hit.
[2024-05-21 06:00:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 06:00:02] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [43, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 227 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1540 places, 265/1967 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 263
Applied a total of 2 rules in 4 ms. Remains 112 /114 variables (removed 2) and now considering 263/265 (removed 2) transitions.
[2024-05-21 06:00:02] [INFO ] Flow matrix only has 207 transitions (discarded 56 similar events)
// Phase 1: matrix 207 rows 112 cols
[2024-05-21 06:00:02] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:00:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 06:00:02] [INFO ] Flow matrix only has 207 transitions (discarded 56 similar events)
[2024-05-21 06:00:02] [INFO ] Invariant cache hit.
[2024-05-21 06:00:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 06:00:02] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1540 places, 263/1967 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 471 ms. Remains : 112/1540 places, 263/1967 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-05 finished in 565 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((p0||X(p1)))||(((p0||X(p1)) U (G((p0||X(p1)))||(p2&&(p0||X(p1)))))&&G(F(p0)))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1527 transition count 1951
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1527 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1527 transition count 1950
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 1521 transition count 1944
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 1521 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 1518 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 1518 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1517 transition count 1940
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1517 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1516 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1516 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1515 transition count 1938
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1515 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1514 transition count 1937
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1514 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1513 transition count 1936
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1513 transition count 1936
Applied a total of 55 rules in 413 ms. Remains 1513 /1540 variables (removed 27) and now considering 1936/1967 (removed 31) transitions.
// Phase 1: matrix 1936 rows 1513 cols
[2024-05-21 06:00:02] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 06:00:02] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-21 06:00:02] [INFO ] Invariant cache hit.
[2024-05-21 06:00:03] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2024-05-21 06:00:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 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 1512/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints]
After SMT, in 60513ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60531ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1540 places, 1936/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62177 ms. Remains : 1513/1540 places, 1936/1967 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-06
Product exploration explored 100000 steps with 800 reset in 162 ms.
Product exploration explored 100000 steps with 781 reset in 207 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2113 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X p1), (X p2), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 126 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (315 resets) in 163 ms. (243 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (92 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (88 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
[2024-05-21 06:01:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 823/825 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/825 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1502 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1926/3428 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3449 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3449/3449 variables, and 1517 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2703 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1513/1513 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 823/825 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/825 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1502 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1926/3428 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3428 variables, 2/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3428 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3430 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3430 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3432 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3432 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3434 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3436 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3436 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3438 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3438 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3440 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3440 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3442 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3444 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3444 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3446 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3446 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3448 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3448 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3449 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3449 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3449 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3449/3449 variables, and 1519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2023 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1513/1513 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4755ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 253 steps, including 3 resets, run visited all 2 properties in 5 ms. (steps per millisecond=50 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X p1), (X p2), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 181 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Support contains 2 out of 1513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1936/1936 transitions.
Applied a total of 0 rules in 44 ms. Remains 1513 /1513 variables (removed 0) and now considering 1936/1936 (removed 0) transitions.
[2024-05-21 06:01:11] [INFO ] Invariant cache hit.
[2024-05-21 06:01:11] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-21 06:01:11] [INFO ] Invariant cache hit.
[2024-05-21 06:01:12] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2024-05-21 06:01:12] [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/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 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 1512/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints]
After SMT, in 60551ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60583ms
Finished structural reductions in LTL mode , in 1 iterations and 61802 ms. Remains : 1513/1513 places, 1936/1936 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2113 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (313 resets) in 207 ms. (192 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (90 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (90 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2024-05-21 06:02:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 823/825 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/825 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1502 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1926/3428 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3449 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3449/3449 variables, and 1517 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2602 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1513/1513 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 823/825 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/825 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1502 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1926/3428 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3428 variables, 2/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3428 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3430 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3430 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3432 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3432 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3434 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3436 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3436 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3438 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3438 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3440 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3440 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3442 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3444 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3444 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3446 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3446 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3448 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3448 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3449 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3449 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3449 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3449/3449 variables, and 1519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2044 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1513/1513 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4656ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 253 steps, including 3 resets, run visited all 2 properties in 4 ms. (steps per millisecond=63 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 764 reset in 154 ms.
Product exploration explored 100000 steps with 786 reset in 269 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Support contains 2 out of 1513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1513/1513 places, 1936/1936 transitions.
Graph (trivial) has 1845 edges and 1513 vertex of which 687 / 1513 are part of one of the 63 SCC in 4 ms
Free SCC test removed 624 places
Ensure Unique test removed 725 transitions
Reduce isomorphic transitions removed 725 transitions.
Graph (complete) has 1383 edges and 889 vertex of which 880 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
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 481 rules applied. Total rules applied 483 place count 880 transition count 1206
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 495 place count 880 transition count 1194
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 495 place count 880 transition count 1207
Deduced a syphon composed of 502 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 516 place count 880 transition count 1207
Discarding 286 places :
Symmetric choice reduction at 2 with 286 rule applications. Total rules 802 place count 594 transition count 911
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 2 with 286 rules applied. Total rules applied 1088 place count 594 transition count 911
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1099 place count 583 transition count 896
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1110 place count 583 transition count 896
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1115 place count 583 transition count 891
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1126 place count 572 transition count 880
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1137 place count 572 transition count 880
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1139 place count 570 transition count 876
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1141 place count 570 transition count 876
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1143 place count 568 transition count 872
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1145 place count 568 transition count 872
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1149 place count 564 transition count 868
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1153 place count 564 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1155 place count 562 transition count 864
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 562 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1159 place count 560 transition count 860
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1161 place count 560 transition count 860
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 556 transition count 854
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 556 transition count 854
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1173 place count 552 transition count 838
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1177 place count 552 transition count 838
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1178 place count 552 transition count 838
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1182 place count 548 transition count 834
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1186 place count 548 transition count 834
Performed 107 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1293 place count 548 transition count 911
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1332 place count 548 transition count 872
Discarding 102 places :
Symmetric choice reduction at 5 with 102 rule applications. Total rules 1434 place count 446 transition count 760
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 102 rules applied. Total rules applied 1536 place count 446 transition count 760
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1542 place count 440 transition count 751
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1548 place count 440 transition count 751
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1555 place count 440 transition count 751
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1559 place count 440 transition count 747
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1574 place count 425 transition count 728
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1589 place count 425 transition count 728
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1595 place count 425 transition count 722
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1599 place count 421 transition count 718
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1603 place count 421 transition count 718
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1606 place count 421 transition count 718
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1612 place count 421 transition count 712
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1615 place count 418 transition count 709
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1618 place count 418 transition count 709
Performed 71 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 285 places in 0 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1689 place count 418 transition count 1033
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1810 place count 418 transition count 912
Discarding 126 places :
Symmetric choice reduction at 9 with 126 rule applications. Total rules 1936 place count 292 transition count 575
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 9 with 126 rules applied. Total rules applied 2062 place count 292 transition count 575
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2077 place count 292 transition count 560
Discarding 25 places :
Symmetric choice reduction at 10 with 25 rule applications. Total rules 2102 place count 267 transition count 509
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 25 rules applied. Total rules applied 2127 place count 267 transition count 509
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2130 place count 267 transition count 559
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2133 place count 264 transition count 531
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2136 place count 264 transition count 531
Deduced a syphon composed of 143 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 2181 place count 264 transition count 486
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2185 place count 260 transition count 482
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2189 place count 260 transition count 482
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2192 place count 260 transition count 542
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2195 place count 257 transition count 527
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2198 place count 257 transition count 527
Deduced a syphon composed of 139 places in 0 ms
Applied a total of 2198 rules in 194 ms. Remains 257 /1513 variables (removed 1256) and now considering 527/1936 (removed 1409) transitions.
[2024-05-21 06:02:19] [INFO ] Redundant transitions in 11 ms returned []
Running 526 sub problems to find dead transitions.
[2024-05-21 06:02:19] [INFO ] Flow matrix only has 470 transitions (discarded 57 similar events)
// Phase 1: matrix 470 rows 257 cols
[2024-05-21 06:02:19] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 06:02:19] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 526 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD39 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 TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 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 TDEAD146 is UNSAT
Problem TDEAD147 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 TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD247 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 TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 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 TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 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 TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 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 TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 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 TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
At refinement iteration 1 (OVERLAPS) 469/725 variables, 256/256 constraints. Problems are: Problem set: 256 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/725 variables, 2/258 constraints. Problems are: Problem set: 256 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/725 variables, 0/258 constraints. Problems are: Problem set: 256 solved, 270 unsolved
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/726 variables, 1/259 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/259 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/727 variables, 1/260 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/727 variables, 0/260 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/727 variables, 0/260 constraints. Problems are: Problem set: 261 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 727/727 variables, and 260 constraints, problems are : Problem set: 261 solved, 265 unsolved in 21221 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 526/526 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 261 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 466/583 variables, 117/117 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 2/119 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 265/384 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/384 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 143/726 variables, 140/524 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/524 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/727 variables, 1/525 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/727 variables, 0/525 constraints. Problems are: Problem set: 261 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/727 variables, 0/525 constraints. Problems are: Problem set: 261 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 727/727 variables, and 525 constraints, problems are : Problem set: 261 solved, 265 unsolved in 28486 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 265/526 constraints, Known Traps: 0/0 constraints]
After SMT, in 49962ms problems are : Problem set: 261 solved, 265 unsolved
Search for dead transitions found 261 dead transitions in 49968ms
Found 261 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 261 transitions
Dead transitions reduction (with SMT) removed 261 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1513 places, 266/1936 transitions.
Graph (complete) has 414 edges and 257 vertex of which 118 are kept as prefixes of interest. Removing 139 places using SCC suffix rule.1 ms
Discarding 139 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 111 transition count 248
Applied a total of 8 rules in 6 ms. Remains 111 /257 variables (removed 146) and now considering 248/266 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1513 places, 248/1936 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50190 ms. Remains : 111/1513 places, 248/1936 transitions.
Support contains 2 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1936/1936 transitions.
Applied a total of 0 rules in 47 ms. Remains 1513 /1513 variables (removed 0) and now considering 1936/1936 (removed 0) transitions.
// Phase 1: matrix 1936 rows 1513 cols
[2024-05-21 06:03:09] [INFO ] Computed 4 invariants in 10 ms
[2024-05-21 06:03:10] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-21 06:03:10] [INFO ] Invariant cache hit.
[2024-05-21 06:03:11] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2024-05-21 06:03:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 1)
(s238 0)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 1)
(s299 1)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)timeout

(s443 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints]
After SMT, in 60575ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60594ms
Finished structural reductions in LTL mode , in 1 iterations and 61858 ms. Remains : 1513/1513 places, 1936/1936 transitions.
Treatment of property CloudReconfiguration-PT-315-LTLFireability-06 finished in 249406 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)))'
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1527 transition count 1952
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1527 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1527 transition count 1951
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 1520 transition count 1944
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 1520 transition count 1944
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 1516 transition count 1940
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 1516 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1514 transition count 1938
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1514 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1512 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1510 transition count 1934
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1508 transition count 1931
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1507 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1507 transition count 1930
Applied a total of 67 rules in 381 ms. Remains 1507 /1540 variables (removed 33) and now considering 1930/1967 (removed 37) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 06:04:12] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 06:04:12] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 06:04:12] [INFO ] Invariant cache hit.
[2024-05-21 06:04:13] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 06:04:13] [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, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 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/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60543ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1540 places, 1930/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62206 ms. Remains : 1507/1540 places, 1930/1967 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-07
Product exploration explored 100000 steps with 772 reset in 177 ms.
Product exploration explored 100000 steps with 790 reset in 166 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (323 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (95 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 429970 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 429970 steps, saw 116454 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-05-21 06:05:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 417/418 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3418 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3420 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1282 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 417/418 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3418 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3437/3437 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1297 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2592ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 105 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=105 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-315-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-315-LTLFireability-07 finished in 68662 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)&&X(X(G(p1))))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Graph (trivial) has 1875 edges and 1540 vertex of which 681 / 1540 are part of one of the 62 SCC in 5 ms
Free SCC test removed 619 places
Ensure Unique test removed 717 transitions
Reduce isomorphic transitions removed 717 transitions.
Graph (complete) has 1421 edges and 921 vertex of which 912 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 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 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 911 transition count 745
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 526 rules applied. Total rules applied 1027 place count 412 transition count 718
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 with 15 rules applied. Total rules applied 1042 place count 399 transition count 716
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 3 with 3 rules applied. Total rules applied 1045 place count 398 transition count 714
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1048 place count 397 transition count 712
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 1052 place count 395 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1053 place count 394 transition count 710
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 48 Pre rules applied. Total rules applied 1053 place count 394 transition count 662
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 1149 place count 346 transition count 662
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 1168 place count 327 transition count 632
Iterating global reduction 7 with 19 rules applied. Total rules applied 1187 place count 327 transition count 632
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 7 with 2 rules applied. Total rules applied 1189 place count 327 transition count 630
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1191 place count 325 transition count 630
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1191 place count 325 transition count 629
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1193 place count 324 transition count 629
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1203 place count 314 transition count 616
Iterating global reduction 9 with 10 rules applied. Total rules applied 1213 place count 314 transition count 616
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1219 place count 314 transition count 610
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1220 place count 313 transition count 608
Iterating global reduction 10 with 1 rules applied. Total rules applied 1221 place count 313 transition count 608
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1222 place count 312 transition count 606
Iterating global reduction 10 with 1 rules applied. Total rules applied 1223 place count 312 transition count 606
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1224 place count 311 transition count 604
Iterating global reduction 10 with 1 rules applied. Total rules applied 1225 place count 311 transition count 604
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1226 place count 310 transition count 602
Iterating global reduction 10 with 1 rules applied. Total rules applied 1227 place count 310 transition count 602
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1228 place count 309 transition count 600
Iterating global reduction 10 with 1 rules applied. Total rules applied 1229 place count 309 transition count 600
Performed 142 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 142 places in 1 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 10 with 284 rules applied. Total rules applied 1513 place count 167 transition count 377
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1526 place count 167 transition count 364
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1531 place count 162 transition count 354
Iterating global reduction 11 with 5 rules applied. Total rules applied 1536 place count 162 transition count 354
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1562 place count 149 transition count 339
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1575 place count 149 transition count 326
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1576 place count 148 transition count 324
Iterating global reduction 12 with 1 rules applied. Total rules applied 1577 place count 148 transition count 324
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 12 with 40 rules applied. Total rules applied 1617 place count 128 transition count 363
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 12 with 25 rules applied. Total rules applied 1642 place count 128 transition count 338
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1651 place count 119 transition count 320
Iterating global reduction 13 with 9 rules applied. Total rules applied 1660 place count 119 transition count 320
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1666 place count 119 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 14 with 40 rules applied. Total rules applied 1706 place count 119 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1707 place count 118 transition count 273
Applied a total of 1707 rules in 119 ms. Remains 118 /1540 variables (removed 1422) and now considering 273/1967 (removed 1694) transitions.
[2024-05-21 06:05:20] [INFO ] Flow matrix only has 215 transitions (discarded 58 similar events)
// Phase 1: matrix 215 rows 118 cols
[2024-05-21 06:05:20] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 06:05:20] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 06:05:20] [INFO ] Flow matrix only has 215 transitions (discarded 58 similar events)
[2024-05-21 06:05:20] [INFO ] Invariant cache hit.
[2024-05-21 06:05:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:05:20] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [46, 80]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 181 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1540 places, 273/1967 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 271
Applied a total of 2 rules in 6 ms. Remains 114 /116 variables (removed 2) and now considering 271/273 (removed 2) transitions.
[2024-05-21 06:05:20] [INFO ] Flow matrix only has 213 transitions (discarded 58 similar events)
// Phase 1: matrix 213 rows 114 cols
[2024-05-21 06:05:20] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:05:20] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 06:05:20] [INFO ] Flow matrix only has 213 transitions (discarded 58 similar events)
[2024-05-21 06:05:20] [INFO ] Invariant cache hit.
[2024-05-21 06:05:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 06:05:20] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1540 places, 271/1967 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 451 ms. Remains : 114/1540 places, 271/1967 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-09
Stuttering criterion allowed to conclude after 100 steps with 11 reset in 1 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-09 finished in 709 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 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1527 transition count 1951
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1527 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1527 transition count 1950
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 1521 transition count 1944
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 1521 transition count 1944
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 1517 transition count 1940
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 1517 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1515 transition count 1938
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1515 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 1513 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 1513 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 1511 transition count 1934
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 1511 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1509 transition count 1931
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1508 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1508 transition count 1930
Applied a total of 65 rules in 395 ms. Remains 1508 /1540 variables (removed 32) and now considering 1930/1967 (removed 37) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-21 06:05:21] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 06:05:21] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 06:05:21] [INFO ] Invariant cache hit.
[2024-05-21 06:05:22] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 06:05:22] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
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, 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 30030 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
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 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30034 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 60531ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60547ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1540 places, 1930/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62111 ms. Remains : 1508/1540 places, 1930/1967 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-10
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-10 finished in 62229 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((F(p0)&&F((G(p2)&&p1)))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Graph (trivial) has 1867 edges and 1540 vertex of which 692 / 1540 are part of one of the 64 SCC in 1 ms
Free SCC test removed 628 places
Ensure Unique test removed 728 transitions
Reduce isomorphic transitions removed 728 transitions.
Graph (complete) has 1410 edges and 912 vertex of which 903 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 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 492 place count 902 transition count 743
Reduce places removed 490 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 513 rules applied. Total rules applied 1005 place count 412 transition count 720
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 14 rules applied. Total rules applied 1019 place count 401 transition count 717
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1022 place count 398 transition count 717
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1022 place count 398 transition count 669
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1118 place count 350 transition count 669
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1138 place count 330 transition count 637
Iterating global reduction 4 with 20 rules applied. Total rules applied 1158 place count 330 transition count 637
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 1160 place count 330 transition count 635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1162 place count 328 transition count 635
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1162 place count 328 transition count 634
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1164 place count 327 transition count 634
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1175 place count 316 transition count 619
Iterating global reduction 6 with 11 rules applied. Total rules applied 1186 place count 316 transition count 619
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1192 place count 316 transition count 613
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1194 place count 314 transition count 609
Iterating global reduction 7 with 2 rules applied. Total rules applied 1196 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1198 place count 312 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1200 place count 312 transition count 605
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 310 transition count 601
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 310 transition count 601
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 308 transition count 597
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 308 transition count 597
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1210 place count 306 transition count 593
Iterating global reduction 7 with 2 rules applied. Total rules applied 1212 place count 306 transition count 593
Performed 142 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1496 place count 164 transition count 370
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1509 place count 164 transition count 357
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1514 place count 159 transition count 347
Iterating global reduction 8 with 5 rules applied. Total rules applied 1519 place count 159 transition count 347
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 1543 place count 147 transition count 333
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1556 place count 147 transition count 320
Performed 19 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1594 place count 128 transition count 354
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1613 place count 128 transition count 335
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1622 place count 119 transition count 317
Iterating global reduction 10 with 9 rules applied. Total rules applied 1631 place count 119 transition count 317
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1637 place count 119 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 11 with 39 rules applied. Total rules applied 1676 place count 119 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1677 place count 118 transition count 271
Applied a total of 1677 rules in 74 ms. Remains 118 /1540 variables (removed 1422) and now considering 271/1967 (removed 1696) transitions.
[2024-05-21 06:06:23] [INFO ] Flow matrix only has 214 transitions (discarded 57 similar events)
// Phase 1: matrix 214 rows 118 cols
[2024-05-21 06:06:23] [INFO ] Computed 0 invariants in 4 ms
[2024-05-21 06:06:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 06:06:23] [INFO ] Flow matrix only has 214 transitions (discarded 57 similar events)
[2024-05-21 06:06:23] [INFO ] Invariant cache hit.
[2024-05-21 06:06:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:06:23] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [45, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 177 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1540 places, 271/1967 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 269
Applied a total of 2 rules in 4 ms. Remains 114 /116 variables (removed 2) and now considering 269/271 (removed 2) transitions.
[2024-05-21 06:06:23] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
// Phase 1: matrix 212 rows 114 cols
[2024-05-21 06:06:23] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 06:06:23] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 06:06:23] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
[2024-05-21 06:06:23] [INFO ] Invariant cache hit.
[2024-05-21 06:06:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 06:06:23] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1540 places, 269/1967 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 408 ms. Remains : 114/1540 places, 269/1967 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-12 finished in 617 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)||X(X(X(G(p1))))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1528 transition count 1952
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1528 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1528 transition count 1951
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 1523 transition count 1946
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 1523 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1521 transition count 1944
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1521 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1520 transition count 1943
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1520 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1519 transition count 1942
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1519 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1518 transition count 1941
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1518 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1517 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1517 transition count 1939
Applied a total of 47 rules in 375 ms. Remains 1517 /1540 variables (removed 23) and now considering 1939/1967 (removed 28) transitions.
// Phase 1: matrix 1939 rows 1517 cols
[2024-05-21 06:06:24] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 06:06:24] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-21 06:06:24] [INFO ] Invariant cache hit.
[2024-05-21 06:06:25] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
Running 1938 sub problems to find dead transitions.
[2024-05-21 06:06:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3456 variables, and 4 constraints, problems are : Problem set: 0 solved, 1938 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 1938/1938 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1938 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1938 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 1516/3456 variables, and 4 constraints, problems are : Problem set: 0 solved, 1938 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1938 constraints, Known Traps: 0/0 constraints]
After SMT, in 60573ms problems are : Problem set: 0 solved, 1938 unsolved
Search for dead transitions found 0 dead transitions in 60593ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1540 places, 1939/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62268 ms. Remains : 1517/1540 places, 1939/1967 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-13
Product exploration explored 100000 steps with 781 reset in 270 ms.
Stack based approach found an accepted trace after 39156 steps with 304 reset with depth 134 and stack size 134 in 96 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-13 finished in 62894 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 U (G(!p0)||(G(p2)&&p1)))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Graph (trivial) has 1871 edges and 1540 vertex of which 685 / 1540 are part of one of the 62 SCC in 1 ms
Free SCC test removed 623 places
Ensure Unique test removed 723 transitions
Reduce isomorphic transitions removed 723 transitions.
Graph (complete) has 1415 edges and 917 vertex of which 908 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 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 907 transition count 739
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 524 rules applied. Total rules applied 1025 place count 408 transition count 714
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1038 place count 396 transition count 713
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1041 place count 395 transition count 711
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1044 place count 394 transition count 709
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1045 place count 393 transition count 709
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 1045 place count 393 transition count 661
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 1141 place count 345 transition count 661
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1158 place count 328 transition count 635
Iterating global reduction 6 with 17 rules applied. Total rules applied 1175 place count 328 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 6 with 2 rules applied. Total rules applied 1177 place count 328 transition count 633
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1179 place count 326 transition count 633
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1179 place count 326 transition count 632
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1181 place count 325 transition count 632
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1190 place count 316 transition count 621
Iterating global reduction 8 with 9 rules applied. Total rules applied 1199 place count 316 transition count 621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1205 place count 316 transition count 615
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1207 place count 314 transition count 611
Iterating global reduction 9 with 2 rules applied. Total rules applied 1209 place count 314 transition count 611
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1211 place count 312 transition count 607
Iterating global reduction 9 with 2 rules applied. Total rules applied 1213 place count 312 transition count 607
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1215 place count 310 transition count 603
Iterating global reduction 9 with 2 rules applied. Total rules applied 1217 place count 310 transition count 603
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1219 place count 308 transition count 599
Iterating global reduction 9 with 2 rules applied. Total rules applied 1221 place count 308 transition count 599
Performed 144 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 9 with 288 rules applied. Total rules applied 1509 place count 164 transition count 375
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 1527 place count 164 transition count 357
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1531 place count 160 transition count 352
Iterating global reduction 10 with 4 rules applied. Total rules applied 1535 place count 160 transition count 352
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 10 with 24 rules applied. Total rules applied 1559 place count 148 transition count 338
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1573 place count 148 transition count 324
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -39
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 1609 place count 130 transition count 363
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1629 place count 130 transition count 343
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1638 place count 121 transition count 325
Iterating global reduction 12 with 9 rules applied. Total rules applied 1647 place count 121 transition count 325
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1652 place count 121 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 13 with 40 rules applied. Total rules applied 1692 place count 121 transition count 280
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1694 place count 121 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1695 place count 121 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1696 place count 120 transition count 278
Applied a total of 1696 rules in 82 ms. Remains 120 /1540 variables (removed 1420) and now considering 278/1967 (removed 1689) transitions.
[2024-05-21 06:07:26] [INFO ] Flow matrix only has 222 transitions (discarded 56 similar events)
// Phase 1: matrix 222 rows 120 cols
[2024-05-21 06:07:26] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:07:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 06:07:26] [INFO ] Flow matrix only has 222 transitions (discarded 56 similar events)
[2024-05-21 06:07:26] [INFO ] Invariant cache hit.
[2024-05-21 06:07:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 06:07:27] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [47, 80]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 176 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1540 places, 278/1967 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 276
Applied a total of 2 rules in 4 ms. Remains 116 /118 variables (removed 2) and now considering 276/278 (removed 2) transitions.
[2024-05-21 06:07:27] [INFO ] Flow matrix only has 220 transitions (discarded 56 similar events)
// Phase 1: matrix 220 rows 116 cols
[2024-05-21 06:07:27] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 06:07:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 06:07:27] [INFO ] Flow matrix only has 220 transitions (discarded 56 similar events)
[2024-05-21 06:07:27] [INFO ] Invariant cache hit.
[2024-05-21 06:07:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:07:27] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1540 places, 276/1967 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 116/1540 places, 276/1967 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-14
Stuttering criterion allowed to conclude after 588 steps with 59 reset in 3 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-14 finished in 533 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 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1527 transition count 1951
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1527 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1527 transition count 1950
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 1520 transition count 1943
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 1520 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 1516 transition count 1939
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 1516 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1514 transition count 1937
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1514 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1512 transition count 1935
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1512 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1510 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1510 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1508 transition count 1930
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1507 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1507 transition count 1929
Applied a total of 67 rules in 400 ms. Remains 1507 /1540 variables (removed 33) and now considering 1929/1967 (removed 38) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 06:07:27] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 06:07:27] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 06:07:27] [INFO ] Invariant cache hit.
[2024-05-21 06:07:29] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 06:07:29] [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 30033 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 "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 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30038 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 60565ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60585ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1540 places, 1929/1967 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62274 ms. Remains : 1507/1540 places, 1929/1967 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-15 finished in 62466 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(X(X(X(X(X(X(F(p0))))))))))'
Found a Shortening insensitive property : CloudReconfiguration-PT-315-LTLFireability-03
Stuttering acceptance computed with spot in 400 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1540/1540 places, 1967/1967 transitions.
Graph (trivial) has 1877 edges and 1540 vertex of which 698 / 1540 are part of one of the 63 SCC in 0 ms
Free SCC test removed 635 places
Ensure Unique test removed 738 transitions
Reduce isomorphic transitions removed 738 transitions.
Graph (complete) has 1400 edges and 905 vertex of which 896 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 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 895 transition count 731
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 517 rules applied. Total rules applied 1011 place count 403 transition count 706
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1024 place count 391 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 390 transition count 705
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1025 place count 390 transition count 658
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1119 place count 343 transition count 658
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1139 place count 323 transition count 626
Iterating global reduction 4 with 20 rules applied. Total rules applied 1159 place count 323 transition count 626
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 1161 place count 323 transition count 624
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1163 place count 321 transition count 624
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1163 place count 321 transition count 623
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1165 place count 320 transition count 623
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1176 place count 309 transition count 608
Iterating global reduction 6 with 11 rules applied. Total rules applied 1187 place count 309 transition count 608
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1193 place count 309 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1195 place count 307 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1197 place count 307 transition count 598
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1199 place count 305 transition count 594
Iterating global reduction 7 with 2 rules applied. Total rules applied 1201 place count 305 transition count 594
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1203 place count 303 transition count 590
Iterating global reduction 7 with 2 rules applied. Total rules applied 1205 place count 303 transition count 590
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1207 place count 301 transition count 586
Iterating global reduction 7 with 2 rules applied. Total rules applied 1209 place count 301 transition count 586
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1211 place count 299 transition count 582
Iterating global reduction 7 with 2 rules applied. Total rules applied 1213 place count 299 transition count 582
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1214 place count 298 transition count 575
Iterating global reduction 7 with 1 rules applied. Total rules applied 1215 place count 298 transition count 575
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 7 with 1 rules applied. Total rules applied 1216 place count 298 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1217 place count 297 transition count 574
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1218 place count 296 transition count 567
Iterating global reduction 9 with 1 rules applied. Total rules applied 1219 place count 296 transition count 567
Performed 139 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 9 with 278 rules applied. Total rules applied 1497 place count 157 transition count 350
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
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 9 with 12 rules applied. Total rules applied 1509 place count 157 transition count 338
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1511 place count 156 transition count 337
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1515 place count 152 transition count 332
Iterating global reduction 11 with 4 rules applied. Total rules applied 1519 place count 152 transition count 332
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 11 with 22 rules applied. Total rules applied 1541 place count 141 transition count 319
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1552 place count 141 transition count 308
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 12 with 34 rules applied. Total rules applied 1586 place count 124 transition count 342
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1603 place count 124 transition count 325
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1612 place count 115 transition count 307
Iterating global reduction 13 with 9 rules applied. Total rules applied 1621 place count 115 transition count 307
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1627 place count 115 transition count 301
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1628 place count 115 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1629 place count 115 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1630 place count 114 transition count 299
Applied a total of 1630 rules in 78 ms. Remains 114 /1540 variables (removed 1426) and now considering 299/1967 (removed 1668) transitions.
[2024-05-21 06:08:30] [INFO ] Flow matrix only has 242 transitions (discarded 57 similar events)
// Phase 1: matrix 242 rows 114 cols
[2024-05-21 06:08:30] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 06:08:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 06:08:30] [INFO ] Flow matrix only has 242 transitions (discarded 57 similar events)
[2024-05-21 06:08:30] [INFO ] Invariant cache hit.
[2024-05-21 06:08:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 06:08:30] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [41, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 179 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 112/1540 places, 299/1967 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 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 297
Applied a total of 2 rules in 4 ms. Remains 110 /112 variables (removed 2) and now considering 297/299 (removed 2) transitions.
[2024-05-21 06:08:30] [INFO ] Flow matrix only has 240 transitions (discarded 57 similar events)
// Phase 1: matrix 240 rows 110 cols
[2024-05-21 06:08:30] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:08:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 06:08:30] [INFO ] Flow matrix only has 240 transitions (discarded 57 similar events)
[2024-05-21 06:08:30] [INFO ] Invariant cache hit.
[2024-05-21 06:08:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 06:08:30] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 110/1540 places, 297/1967 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 402 ms. Remains : 110/1540 places, 297/1967 transitions.
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-03
Stuttering criterion allowed to conclude after 320 steps with 41 reset in 0 ms.
Treatment of property CloudReconfiguration-PT-315-LTLFireability-03 finished in 911 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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((p0||X(p1)))||(((p0||X(p1)) U (G((p0||X(p1)))||(p2&&(p0||X(p1)))))&&G(F(p0)))))'
[2024-05-21 06:08:30] [INFO ] Flatten gal took : 59 ms
[2024-05-21 06:08:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 06:08:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1540 places, 1967 transitions and 4105 arcs took 11 ms.
Total runtime 900525 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudReconfiguration-PT-315

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1540
TRANSITIONS: 1967
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.020s, Sys 0.009s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1702
MODEL NAME: /home/mcc/execution/410/model
1540 places, 1967 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudReconfiguration-PT-315-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudReconfiguration-PT-315-LTLFireability-06 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716272273101

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-315"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CloudReconfiguration-PT-315, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187300228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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