About the Execution of GreatSPN+red for CloudDeployment-PT-5b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13114.684 | 3600000.00 | 9849673.00 | 4168.60 | T?FF??TFF?FFFF?T | normal |
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.r069-tall-171620504800596.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 CloudDeployment-PT-5b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504800596
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 CloudDeployment-PT-5b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716468639051
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 12:50:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 12:50:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:50:40] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-05-23 12:50:40] [INFO ] Transformed 1525 places.
[2024-05-23 12:50:40] [INFO ] Transformed 3132 transitions.
[2024-05-23 12:50:40] [INFO ] Found NUPN structural information;
[2024-05-23 12:50:40] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 359 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 2 formulas.
FORMULA CloudDeployment-PT-5b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1520 transition count 3132
Discarding 396 places :
Symmetric choice reduction at 1 with 396 rule applications. Total rules 401 place count 1124 transition count 2736
Iterating global reduction 1 with 396 rules applied. Total rules applied 797 place count 1124 transition count 2736
Discarding 152 places :
Symmetric choice reduction at 1 with 152 rule applications. Total rules 949 place count 972 transition count 2584
Iterating global reduction 1 with 152 rules applied. Total rules applied 1101 place count 972 transition count 2584
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 1120 place count 972 transition count 2565
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1137 place count 955 transition count 2548
Iterating global reduction 2 with 17 rules applied. Total rules applied 1154 place count 955 transition count 2548
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1155 place count 954 transition count 2547
Iterating global reduction 2 with 1 rules applied. Total rules applied 1156 place count 954 transition count 2547
Applied a total of 1156 rules in 405 ms. Remains 954 /1525 variables (removed 571) and now considering 2547/3132 (removed 585) transitions.
// Phase 1: matrix 2547 rows 954 cols
[2024-05-23 12:50:41] [INFO ] Computed 16 invariants in 54 ms
[2024-05-23 12:50:41] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-23 12:50:41] [INFO ] Invariant cache hit.
[2024-05-23 12:50:43] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
Running 2546 sub problems to find dead transitions.
[2024-05-23 12:50:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/953 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/3501 variables, and 16 constraints, problems are : Problem set: 0 solved, 2546 unsolved in 30086 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/954 constraints, PredecessorRefiner: 2546/1522 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/953 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 953/3501 variables, and 16 constraints, problems are : Problem set: 0 solved, 2546 unsolved in 30055 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/954 constraints, PredecessorRefiner: 1024/1522 constraints, Known Traps: 0/0 constraints]
After SMT, in 79936ms problems are : Problem set: 0 solved, 2546 unsolved
Search for dead transitions found 0 dead transitions in 79988ms
Starting structural reductions in LTL mode, iteration 1 : 954/1525 places, 2547/3132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82101 ms. Remains : 954/1525 places, 2547/3132 transitions.
Support contains 56 out of 954 places after structural reductions.
[2024-05-23 12:52:04] [INFO ] Flatten gal took : 740 ms
[2024-05-23 12:52:04] [INFO ] Flatten gal took : 500 ms
[2024-05-23 12:52:05] [INFO ] Input system was already deterministic with 2547 transitions.
RANDOM walk for 40000 steps (244 resets) in 1960 ms. (20 steps per ms) remains 20/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
[2024-05-23 12:52:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 184/232 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1737/1969 variables, 232/248 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1969 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 6 (OVERLAPS) 503/2472 variables, 212/460 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2472 variables, 0/460 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 439/2911 variables, 196/656 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2911 variables, 0/656 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 397/3308 variables, 186/842 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3308 variables, 0/842 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 154/3462 variables, 103/945 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3462 variables, 0/945 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 34/3496 variables, 20/965 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3496 variables, 0/965 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 5/3501 variables, 5/970 constraints. Problems are: Problem set: 6 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3501/3501 variables, and 970 constraints, problems are : Problem set: 6 solved, 14 unsolved in 5024 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 954/954 constraints, PredecessorRefiner: 20/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 190/232 variables, 15/16 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1737/1969 variables, 232/248 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1969 variables, 2/250 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1969 variables, 0/250 constraints. Problems are: Problem set: 6 solved, 14 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 7 (OVERLAPS) 503/2472 variables, 212/462 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2472 variables, 10/472 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2472 variables, 0/472 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 439/2911 variables, 196/668 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2911 variables, 0/668 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 397/3308 variables, 186/854 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3308 variables, 0/854 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 154/3462 variables, 103/957 constraints. Problems are: Problem set: 8 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3462/3501 variables, and 957 constraints, problems are : Problem set: 8 solved, 12 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 929/954 constraints, PredecessorRefiner: 14/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 10373ms problems are : Problem set: 8 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 951 edges and 954 vertex of which 311 / 954 are part of one of the 34 SCC in 6 ms
Free SCC test removed 277 places
Drop transitions (Empty/Sink Transition effects.) removed 1379 transitions
Reduce isomorphic transitions removed 1379 transitions.
Graph (complete) has 2476 edges and 677 vertex of which 649 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 282 rules applied. Total rules applied 284 place count 649 transition count 886
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 273 rules applied. Total rules applied 557 place count 383 transition count 879
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 562 place count 378 transition count 879
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 562 place count 378 transition count 822
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 676 place count 321 transition count 822
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 682 place count 315 transition count 816
Iterating global reduction 3 with 6 rules applied. Total rules applied 688 place count 315 transition count 816
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 689 place count 315 transition count 815
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 689 place count 315 transition count 811
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 697 place count 311 transition count 811
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 2 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 881 place count 219 transition count 719
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 951 place count 184 transition count 923
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 979 place count 184 transition count 895
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 980 place count 183 transition count 883
Iterating global reduction 5 with 1 rules applied. Total rules applied 981 place count 183 transition count 883
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 983 place count 182 transition count 900
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 986 place count 182 transition count 897
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 6 with 96 rules applied. Total rules applied 1082 place count 182 transition count 801
Free-agglomeration rule applied 40 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 1122 place count 182 transition count 755
Reduce places removed 40 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 6 with 136 rules applied. Total rules applied 1258 place count 142 transition count 659
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1263 place count 137 transition count 627
Iterating global reduction 7 with 5 rules applied. Total rules applied 1268 place count 137 transition count 627
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 7 with 50 rules applied. Total rules applied 1318 place count 137 transition count 577
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1323 place count 137 transition count 577
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1326 place count 137 transition count 574
Applied a total of 1326 rules in 454 ms. Remains 137 /954 variables (removed 817) and now considering 574/2547 (removed 1973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 137/954 places, 574/2547 transitions.
RANDOM walk for 40000 steps (528 resets) in 767 ms. (52 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (58 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (57 resets) in 168 ms. (236 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (53 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (30 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (55 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (54 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (61 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
[2024-05-23 12:52:18] [INFO ] Flow matrix only has 377 transitions (discarded 197 similar events)
// Phase 1: matrix 377 rows 137 cols
[2024-05-23 12:52:18] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 12:52:18] [INFO ] State equation strengthened by 157 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 56/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 42/125 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 368/493 variables, 125/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 111/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 21/514 variables, 12/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 46/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/514 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 310 constraints, problems are : Problem set: 0 solved, 6 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 137/137 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 56/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 42/125 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 12:52:19] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 7 ms to minimize.
[2024-05-23 12:52:19] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 368/493 variables, 125/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 111/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 21/514 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 46/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/514 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 318 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1625 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 137/137 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 2473ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 363 ms.
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 574/574 transitions.
Graph (trivial) has 77 edges and 137 vertex of which 12 / 137 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 131 transition count 556
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 129 transition count 556
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 129 transition count 554
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 127 transition count 554
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 122 transition count 549
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 122 transition count 548
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 120 transition count 556
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 31 place count 120 transition count 549
Drop transitions (Redundant composition of simpler transitions.) removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 4 with 65 rules applied. Total rules applied 96 place count 120 transition count 484
Free-agglomeration rule applied 12 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 108 place count 120 transition count 470
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 178 place count 108 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 208 place count 108 transition count 382
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 108 transition count 382
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 107 transition count 381
Applied a total of 210 rules in 94 ms. Remains 107 /137 variables (removed 30) and now considering 381/574 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 107/137 places, 381/574 transitions.
RANDOM walk for 40000 steps (612 resets) in 805 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (89 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 505191 steps, run visited all 1 properties in 1316 ms. (steps per millisecond=383 )
Probabilistic random walk after 505191 steps, saw 80015 distinct states, run finished after 1319 ms. (steps per millisecond=383 ) properties seen :1
FORMULA CloudDeployment-PT-5b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-5b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 153 stabilizing places and 1505 stable transitions
Graph (complete) has 2930 edges and 954 vertex of which 926 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.22 ms
FORMULA CloudDeployment-PT-5b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 933 transition count 1514
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 933 transition count 1514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 933 transition count 1513
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 929 transition count 1509
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 929 transition count 1509
Applied a total of 50 rules in 193 ms. Remains 929 /954 variables (removed 25) and now considering 1509/2547 (removed 1038) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2024-05-23 12:52:23] [INFO ] Computed 15 invariants in 7 ms
[2024-05-23 12:52:24] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-05-23 12:52:24] [INFO ] Invariant cache hit.
[2024-05-23 12:52:25] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
[2024-05-23 12:52:25] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1829 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/954 places, 1509/2547 transitions.
Applied a total of 0 rules in 31 ms. Remains 928 /928 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2064 ms. Remains : 928/954 places, 1509/2547 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 651 ms.
Product exploration explored 100000 steps with 50000 reset in 442 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2860 edges and 928 vertex of which 912 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.8 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 25 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLFireability-00 finished in 3575 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(G((F((p0||G(p1)))||(p2&&X((p2 U (!p0||G(p2))))))))))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 935 transition count 1516
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 935 transition count 1516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 935 transition count 1515
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 933 transition count 1513
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 933 transition count 1513
Applied a total of 42 rules in 163 ms. Remains 933 /954 variables (removed 21) and now considering 1513/2547 (removed 1034) transitions.
// Phase 1: matrix 1513 rows 933 cols
[2024-05-23 12:52:26] [INFO ] Computed 15 invariants in 7 ms
[2024-05-23 12:52:27] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-23 12:52:27] [INFO ] Invariant cache hit.
[2024-05-23 12:52:28] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned [11, 19, 185, 193, 358, 366, 533, 541, 706, 716]
[2024-05-23 12:52:28] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1475 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 932/954 places, 1513/2547 transitions.
Applied a total of 0 rules in 26 ms. Remains 932 /932 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1664 ms. Remains : 932/954 places, 1513/2547 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-01
Product exploration explored 100000 steps with 621 reset in 263 ms.
Product exploration explored 100000 steps with 620 reset in 337 ms.
Computed a total of 137 stabilizing places and 477 stable transitions
Graph (complete) has 2869 edges and 932 vertex of which 916 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.5 ms
Computed a total of 137 stabilizing places and 477 stable transitions
Detected a total of 137/932 stabilizing places and 477/1513 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 399 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (242 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (32 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (34 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (34 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (29 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 377853 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :5 out of 6
Probabilistic random walk after 377853 steps, saw 85861 distinct states, run finished after 3004 ms. (steps per millisecond=125 ) properties seen :5
// Phase 1: matrix 1513 rows 932 cols
[2024-05-23 12:52:33] [INFO ] Computed 14 invariants in 13 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 378/391 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/575 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 692/1267 variables, 327/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 452/1719 variables, 214/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1719 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 410/2129 variables, 172/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2129 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 255/2384 variables, 158/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2384 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 41/2425 variables, 29/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2425 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/2441 variables, 8/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2441 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/2445 variables, 4/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2445 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2445 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2445/2445 variables, and 946 constraints, problems are : Problem set: 0 solved, 1 unsolved in 921 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 932/932 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 378/391 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 184/575 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 692/1267 variables, 327/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1267 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 452/1719 variables, 214/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1719 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 410/2129 variables, 172/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2129 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 255/2384 variables, 158/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2384 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 41/2425 variables, 29/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2425 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 16/2441 variables, 8/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2441 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/2445 variables, 4/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2445 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2445 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2445/2445 variables, and 947 constraints, problems are : Problem set: 0 solved, 1 unsolved in 678 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 932/932 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1638ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 1513/1513 transitions.
Graph (trivial) has 972 edges and 932 vertex of which 355 / 932 are part of one of the 40 SCC in 2 ms
Free SCC test removed 315 places
Drop transitions (Empty/Sink Transition effects.) removed 403 transitions
Reduce isomorphic transitions removed 403 transitions.
Graph (complete) has 2319 edges and 617 vertex of which 601 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 273 rules applied. Total rules applied 275 place count 601 transition count 837
Reduce places removed 254 places and 0 transitions.
Iterating post reduction 1 with 254 rules applied. Total rules applied 529 place count 347 transition count 837
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 529 place count 347 transition count 782
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 639 place count 292 transition count 782
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 645 place count 286 transition count 776
Iterating global reduction 2 with 6 rules applied. Total rules applied 651 place count 286 transition count 776
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 651 place count 286 transition count 770
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 663 place count 280 transition count 770
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 823 place count 200 transition count 690
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 893 place count 165 transition count 900
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 928 place count 165 transition count 865
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1083 place count 165 transition count 710
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1133 place count 165 transition count 640
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 898 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 196 rules applied. Total rules applied 1329 place count 114 transition count 495
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1330 place count 114 transition count 494
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1335 place count 109 transition count 464
Iterating global reduction 5 with 5 rules applied. Total rules applied 1340 place count 109 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 1415 place count 109 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1416 place count 108 transition count 388
Applied a total of 1416 rules in 215 ms. Remains 108 /932 variables (removed 824) and now considering 388/1513 (removed 1125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 108/932 places, 388/1513 transitions.
RANDOM walk for 5006 steps (74 resets) in 17 ms. (278 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 1151 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1513/1513 transitions.
Applied a total of 0 rules in 18 ms. Remains 932 /932 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
[2024-05-23 12:52:36] [INFO ] Invariant cache hit.
[2024-05-23 12:52:37] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-23 12:52:37] [INFO ] Invariant cache hit.
[2024-05-23 12:52:38] [INFO ] Implicit Places using invariants and state equation in 948 ms returned [18, 184, 192, 357, 365, 532, 540, 705, 715]
[2024-05-23 12:52:38] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1611 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 931/932 places, 1513/1513 transitions.
Applied a total of 0 rules in 28 ms. Remains 931 /931 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1658 ms. Remains : 931/932 places, 1513/1513 transitions.
Computed a total of 137 stabilizing places and 477 stable transitions
Graph (complete) has 2852 edges and 931 vertex of which 916 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.5 ms
Computed a total of 137 stabilizing places and 477 stable transitions
Detected a total of 137/931 stabilizing places and 477/1513 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 461 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (250 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (31 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (31 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (31 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (31 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (30 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 336732 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :5 out of 6
Probabilistic random walk after 336732 steps, saw 77885 distinct states, run finished after 3006 ms. (steps per millisecond=112 ) properties seen :5
// Phase 1: matrix 1513 rows 931 cols
[2024-05-23 12:52:42] [INFO ] Computed 13 invariants in 6 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 378/391 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/555 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 688/1243 variables, 313/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1243 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 469/1712 variables, 223/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1712 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 414/2126 variables, 175/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2126 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 255/2381 variables, 158/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2381 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 43/2424 variables, 30/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2424 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/2440 variables, 8/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2440 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/2444 variables, 4/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2444 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2444 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2444/2444 variables, and 944 constraints, problems are : Problem set: 0 solved, 1 unsolved in 911 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 931/931 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 378/391 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/555 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 688/1243 variables, 313/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1243 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 469/1712 variables, 223/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1712 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 414/2126 variables, 175/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2126 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 255/2381 variables, 158/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2381 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/2424 variables, 30/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2424 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 16/2440 variables, 8/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2440 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/2444 variables, 4/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2444 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2444 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2444/2444 variables, and 945 constraints, problems are : Problem set: 0 solved, 1 unsolved in 682 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 931/931 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1648ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 1513/1513 transitions.
Graph (trivial) has 971 edges and 931 vertex of which 355 / 931 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Drop transitions (Empty/Sink Transition effects.) removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Graph (complete) has 2302 edges and 616 vertex of which 601 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.5 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 272 rules applied. Total rules applied 274 place count 601 transition count 837
Reduce places removed 254 places and 0 transitions.
Iterating post reduction 1 with 254 rules applied. Total rules applied 528 place count 347 transition count 837
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 528 place count 347 transition count 782
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 638 place count 292 transition count 782
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 644 place count 286 transition count 776
Iterating global reduction 2 with 6 rules applied. Total rules applied 650 place count 286 transition count 776
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 650 place count 286 transition count 770
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 662 place count 280 transition count 770
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 822 place count 200 transition count 690
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 892 place count 165 transition count 900
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 927 place count 165 transition count 865
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1082 place count 165 transition count 710
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1132 place count 165 transition count 640
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 898 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 196 rules applied. Total rules applied 1328 place count 114 transition count 495
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1329 place count 114 transition count 494
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1334 place count 109 transition count 464
Iterating global reduction 5 with 5 rules applied. Total rules applied 1339 place count 109 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 1414 place count 109 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1415 place count 108 transition count 388
Applied a total of 1415 rules in 176 ms. Remains 108 /931 variables (removed 823) and now considering 388/1513 (removed 1125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 108/931 places, 388/1513 transitions.
RANDOM walk for 18790 steps (284 resets) in 86 ms. (215 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 1055 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 617 reset in 218 ms.
Product exploration explored 100000 steps with 618 reset in 193 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 1513/1513 transitions.
Graph (trivial) has 969 edges and 931 vertex of which 355 / 931 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2427 edges and 616 vertex of which 601 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.5 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 248 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 248 rules applied. Total rules applied 250 place count 601 transition count 1151
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 250 place count 601 transition count 1180
Deduced a syphon composed of 282 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 284 place count 601 transition count 1180
Discarding 132 places :
Symmetric choice reduction at 1 with 132 rule applications. Total rules 416 place count 469 transition count 1048
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 548 place count 469 transition count 1048
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 650 place count 469 transition count 1048
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 727 place count 392 transition count 971
Deduced a syphon composed of 175 places in 1 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 804 place count 392 transition count 971
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 839 place count 392 transition count 1226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 844 place count 392 transition count 1221
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 884 place count 352 transition count 1096
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 924 place count 352 transition count 1096
Deduced a syphon composed of 170 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 2 with 75 rules applied. Total rules applied 999 place count 352 transition count 1021
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1009 place count 342 transition count 1011
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1019 place count 342 transition count 1011
Deduced a syphon composed of 160 places in 0 ms
Applied a total of 1019 rules in 334 ms. Remains 342 /931 variables (removed 589) and now considering 1011/1513 (removed 502) transitions.
[2024-05-23 12:52:49] [INFO ] Redundant transitions in 2794 ms returned []
Running 1010 sub problems to find dead transitions.
[2024-05-23 12:52:49] [INFO ] Flow matrix only has 852 transitions (discarded 159 similar events)
// Phase 1: matrix 852 rows 342 cols
[2024-05-23 12:52:49] [INFO ] Computed 5 invariants in 12 ms
[2024-05-23 12:52:49] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1010 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/341 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1010 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
At refinement iteration 2 (OVERLAPS) 851/1192 variables, 341/346 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1192 variables, 250/596 constraints. Problems are: Problem set: 209 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1192/1194 variables, and 596 constraints, problems are : Problem set: 209 solved, 801 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 341/342 constraints, ReadFeed: 250/251 constraints, PredecessorRefiner: 1010/1010 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 209 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 12/193 variables, 5/5 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/5 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 836/1029 variables, 193/198 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1029 variables, 250/448 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 801/1249 constraints. Problems are: Problem set: 209 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/1194 variables, and 1249 constraints, problems are : Problem set: 209 solved, 801 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 193/342 constraints, ReadFeed: 250/251 constraints, PredecessorRefiner: 801/1010 constraints, Known Traps: 0/0 constraints]
After SMT, in 62368ms problems are : Problem set: 209 solved, 801 unsolved
Search for dead transitions found 209 dead transitions in 62378ms
Found 209 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 209 transitions
Dead transitions reduction (with SMT) removed 209 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 342/931 places, 802/1513 transitions.
Graph (complete) has 1787 edges and 342 vertex of which 182 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.2 ms
Discarding 160 places :
Also discarding 0 output transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -105
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 182 transition count 907
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 101 place count 182 transition count 812
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 101 rules in 40 ms. Remains 182 /342 variables (removed 160) and now considering 812/802 (removed -10) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 182/931 places, 812/1513 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65558 ms. Remains : 182/931 places, 812/1513 transitions.
Support contains 2 out of 931 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 931/931 places, 1513/1513 transitions.
Applied a total of 0 rules in 20 ms. Remains 931 /931 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
// Phase 1: matrix 1513 rows 931 cols
[2024-05-23 12:53:52] [INFO ] Computed 13 invariants in 5 ms
[2024-05-23 12:53:52] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-23 12:53:52] [INFO ] Invariant cache hit.
[2024-05-23 12:53:53] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned [183, 191, 356, 364, 531, 539, 704, 714]
[2024-05-23 12:53:53] [INFO ] Actually due to overlaps returned [183]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1806 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 930/931 places, 1513/1513 transitions.
Applied a total of 0 rules in 20 ms. Remains 930 /930 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1846 ms. Remains : 930/931 places, 1513/1513 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-01 finished in 87700 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 X(p1)))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 934 transition count 1515
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 934 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 930 transition count 1510
Applied a total of 48 rules in 104 ms. Remains 930 /954 variables (removed 24) and now considering 1510/2547 (removed 1037) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2024-05-23 12:53:54] [INFO ] Computed 15 invariants in 5 ms
[2024-05-23 12:53:54] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-23 12:53:54] [INFO ] Invariant cache hit.
[2024-05-23 12:53:55] [INFO ] Implicit Places using invariants and state equation in 954 ms returned [11, 19, 185, 193, 359, 367, 532, 540, 705, 713]
[2024-05-23 12:53:55] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1194 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/954 places, 1510/2547 transitions.
Applied a total of 0 rules in 20 ms. Remains 929 /929 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1327 ms. Remains : 929/954 places, 1510/2547 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-03
Stuttering criterion allowed to conclude after 202 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-03 finished in 1503 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(((p1 U X(G(!p2)))&&p0)))'
Support contains 24 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 945 transition count 2538
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 945 transition count 2538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 945 transition count 2537
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 941 transition count 2533
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 941 transition count 2533
Applied a total of 27 rules in 138 ms. Remains 941 /954 variables (removed 13) and now considering 2533/2547 (removed 14) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2024-05-23 12:53:56] [INFO ] Computed 16 invariants in 13 ms
[2024-05-23 12:53:56] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-23 12:53:56] [INFO ] Invariant cache hit.
[2024-05-23 12:53:59] [INFO ] Implicit Places using invariants and state equation in 2352 ms returned []
Implicit Place search using SMT with State Equation took 2996 ms to find 0 implicit places.
Running 2532 sub problems to find dead transitions.
[2024-05-23 12:53:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 2532/1508 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 1024/1508 constraints, Known Traps: 0/0 constraints]
After SMT, in 81054ms problems are : Problem set: 0 solved, 2532 unsolved
Search for dead transitions found 0 dead transitions in 81080ms
Starting structural reductions in LTL mode, iteration 1 : 941/954 places, 2533/2547 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84234 ms. Remains : 941/954 places, 2533/2547 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-04
Product exploration explored 100000 steps with 625 reset in 400 ms.
Product exploration explored 100000 steps with 627 reset in 386 ms.
Computed a total of 145 stabilizing places and 1497 stable transitions
Graph (complete) has 2908 edges and 941 vertex of which 913 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Computed a total of 145 stabilizing places and 1497 stable transitions
Detected a total of 145/941 stabilizing places and 1497/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 187 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) p2), p2, p2]
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 40000 steps (250 resets) in 299 ms. (133 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (34 resets) in 436 ms. (91 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (29 resets) in 188 ms. (211 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (33 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (31 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (30 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (31 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (30 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
[2024-05-23 12:55:22] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 197/221 variables, 15/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1720/1941 variables, 221/237 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 486/2427 variables, 203/440 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2427 variables, 0/440 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 442/2869 variables, 196/636 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2869 variables, 0/636 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 408/3277 variables, 188/824 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3277 variables, 0/824 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 159/3436 variables, 109/933 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3436 variables, 0/933 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 33/3469 variables, 19/952 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3469 variables, 0/952 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 5/3474 variables, 5/957 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3474 variables, 0/957 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/3474 variables, 0/957 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3474/3474 variables, and 957 constraints, problems are : Problem set: 2 solved, 7 unsolved in 3120 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 941/941 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 197/221 variables, 15/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1720/1941 variables, 221/237 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 486/2427 variables, 203/440 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2427 variables, 3/443 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2427 variables, 0/443 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 442/2869 variables, 196/639 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2869 variables, 0/639 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 408/3277 variables, 188/827 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3277 variables, 0/827 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 159/3436 variables, 109/936 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3436 variables, 0/936 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 33/3469 variables, 19/955 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3469/3474 variables, and 955 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5006 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 936/941 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8305ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Graph (trivial) has 950 edges and 941 vertex of which 346 / 941 are part of one of the 39 SCC in 2 ms
Free SCC test removed 307 places
Drop transitions (Empty/Sink Transition effects.) removed 391 transitions
Reduce isomorphic transitions removed 391 transitions.
Graph (complete) has 2392 edges and 634 vertex of which 633 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 633 transition count 1890
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 250 rules applied. Total rules applied 504 place count 386 transition count 1887
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 506 place count 384 transition count 1887
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 506 place count 384 transition count 1825
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 630 place count 322 transition count 1825
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 802 place count 236 transition count 1739
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 872 place count 201 transition count 1949
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 904 place count 201 transition count 1917
Drop transitions (Redundant composition of simpler transitions.) removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 4 with 130 rules applied. Total rules applied 1034 place count 201 transition count 1787
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1082 place count 201 transition count 1727
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 4 with 166 rules applied. Total rules applied 1248 place count 153 transition count 1609
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1255 place count 146 transition count 1562
Iterating global reduction 5 with 7 rules applied. Total rules applied 1262 place count 146 transition count 1562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1264 place count 146 transition count 1560
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 6 with 61 rules applied. Total rules applied 1325 place count 146 transition count 1499
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1327 place count 146 transition count 1499
Applied a total of 1327 rules in 225 ms. Remains 146 /941 variables (removed 795) and now considering 1499/2533 (removed 1034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 146/941 places, 1499/2533 transitions.
RANDOM walk for 40000 steps (1020 resets) in 860 ms. (46 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (102 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (103 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (101 resets) in 163 ms. (243 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (103 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
[2024-05-23 12:55:31] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
// Phase 1: matrix 1299 rows 146 cols
[2024-05-23 12:55:31] [INFO ] Computed 21 invariants in 10 ms
[2024-05-23 12:55:31] [INFO ] State equation strengthened by 154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/1445 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1445/1445 variables, and 321 constraints, problems are : Problem set: 0 solved, 3 unsolved in 763 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1445 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1445/1445 variables, and 322 constraints, problems are : Problem set: 0 solved, 3 unsolved in 734 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1646ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 110 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 146/146 places, 1499/1499 transitions.
RANDOM walk for 40000 steps (1042 resets) in 424 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (105 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 787657 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 1
Probabilistic random walk after 787657 steps, saw 105524 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
[2024-05-23 12:55:36] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-23 12:55:36] [INFO ] Invariant cache hit.
[2024-05-23 12:55:36] [INFO ] State equation strengthened by 154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1445 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1445/1445 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1445 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1445/1445 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 846ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 146/146 places, 1499/1499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
[2024-05-23 12:55:37] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-23 12:55:37] [INFO ] Invariant cache hit.
[2024-05-23 12:55:37] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-05-23 12:55:37] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-23 12:55:37] [INFO ] Invariant cache hit.
[2024-05-23 12:55:38] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-05-23 12:55:39] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
[2024-05-23 12:55:39] [INFO ] Redundant transitions in 438 ms returned []
Running 1498 sub problems to find dead transitions.
[2024-05-23 12:55:39] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-23 12:55:39] [INFO ] Invariant cache hit.
[2024-05-23 12:55:39] [INFO ] State equation strengthened by 154 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 2 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1444/1445 variables, and 320 constraints, problems are : Problem set: 0 solved, 1498 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 145/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 1498/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 2 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1444 variables, 473/793 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1444/1445 variables, and 793 constraints, problems are : Problem set: 0 solved, 1498 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 145/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 1498/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 81563ms problems are : Problem set: 0 solved, 1498 unsolved
Search for dead transitions found 0 dead transitions in 81579ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83900 ms. Remains : 146/146 places, 1499/1499 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 146 vertex of which 32 / 146 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 118 transition count 1246
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 109 transition count 1244
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 107 transition count 1243
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 107 transition count 1235
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 99 transition count 1235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 96 transition count 1232
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 96 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 93 transition count 1214
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 93 transition count 1214
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 94 place count 93 transition count 1172
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 108 place count 86 transition count 1163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 114 place count 86 transition count 1157
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 83 transition count 1172
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 155 place count 83 transition count 1137
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 155 place count 83 transition count 1134
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 161 place count 80 transition count 1134
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 80 transition count 1132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 78 transition count 1132
Applied a total of 165 rules in 97 ms. Remains 78 /146 variables (removed 68) and now considering 1132/1499 (removed 367) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1132 rows 78 cols
[2024-05-23 12:57:01] [INFO ] Computed 21 invariants in 10 ms
[2024-05-23 12:57:01] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:57:01] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 4 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-23 12:57:01] [INFO ] After 327ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-05-23 12:57:01] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 689 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p1), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 32 factoid took 599 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Applied a total of 0 rules in 23 ms. Remains 941 /941 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2024-05-23 12:57:02] [INFO ] Computed 16 invariants in 26 ms
[2024-05-23 12:57:03] [INFO ] Implicit Places using invariants in 719 ms returned []
[2024-05-23 12:57:03] [INFO ] Invariant cache hit.
[2024-05-23 12:57:05] [INFO ] Implicit Places using invariants and state equation in 2476 ms returned []
Implicit Place search using SMT with State Equation took 3200 ms to find 0 implicit places.
Running 2532 sub problems to find dead transitions.
[2024-05-23 12:57:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 2532/1508 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 1024/1508 constraints, Known Traps: 0/0 constraints]
After SMT, in 82250ms problems are : Problem set: 0 solved, 2532 unsolved
Search for dead transitions found 0 dead transitions in 82279ms
Finished structural reductions in LTL mode , in 1 iterations and 85509 ms. Remains : 941/941 places, 2533/2533 transitions.
Computed a total of 145 stabilizing places and 1497 stable transitions
Graph (complete) has 2908 edges and 941 vertex of which 913 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.21 ms
Computed a total of 145 stabilizing places and 1497 stable transitions
Detected a total of 145/941 stabilizing places and 1497/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 242 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
RANDOM walk for 40000 steps (250 resets) in 310 ms. (128 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40002 steps (33 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (31 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (34 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
[2024-05-23 12:58:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 197/221 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1720/1941 variables, 221/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 486/2427 variables, 203/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2427 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 442/2869 variables, 196/636 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2869 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 408/3277 variables, 188/824 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3277 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 159/3436 variables, 109/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3436 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 33/3469 variables, 19/952 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3469 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 5/3474 variables, 5/957 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3474 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/3474 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3474/3474 variables, and 957 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2929 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 941/941 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 197/221 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1720/1941 variables, 221/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 486/2427 variables, 203/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2427 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2427 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 442/2869 variables, 196/639 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2869 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 408/3277 variables, 188/827 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3277 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 159/3436 variables, 109/936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3436 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 33/3469 variables, 19/955 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3469 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3474/3474 variables, and 960 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 941/941 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 8043ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Graph (trivial) has 950 edges and 941 vertex of which 346 / 941 are part of one of the 39 SCC in 0 ms
Free SCC test removed 307 places
Drop transitions (Empty/Sink Transition effects.) removed 391 transitions
Reduce isomorphic transitions removed 391 transitions.
Graph (complete) has 2392 edges and 634 vertex of which 633 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 633 transition count 1890
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 250 rules applied. Total rules applied 504 place count 386 transition count 1887
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 506 place count 384 transition count 1887
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 506 place count 384 transition count 1825
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 630 place count 322 transition count 1825
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 802 place count 236 transition count 1739
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 872 place count 201 transition count 1949
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 904 place count 201 transition count 1917
Drop transitions (Redundant composition of simpler transitions.) removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 4 with 130 rules applied. Total rules applied 1034 place count 201 transition count 1787
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1082 place count 201 transition count 1727
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 4 with 166 rules applied. Total rules applied 1248 place count 153 transition count 1609
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1255 place count 146 transition count 1562
Iterating global reduction 5 with 7 rules applied. Total rules applied 1262 place count 146 transition count 1562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1264 place count 146 transition count 1560
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 6 with 61 rules applied. Total rules applied 1325 place count 146 transition count 1499
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1327 place count 146 transition count 1499
Applied a total of 1327 rules in 275 ms. Remains 146 /941 variables (removed 795) and now considering 1499/2533 (removed 1034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 146/941 places, 1499/2533 transitions.
RANDOM walk for 40000 steps (1032 resets) in 1555 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (106 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (106 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (105 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (108 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (105 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (102 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 267189 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 6
Probabilistic random walk after 267189 steps, saw 40591 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-23 12:58:41] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
// Phase 1: matrix 1299 rows 146 cols
[2024-05-23 12:58:41] [INFO ] Computed 21 invariants in 8 ms
[2024-05-23 12:58:41] [INFO ] State equation strengthened by 154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/1445 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1445/1445 variables, and 321 constraints, problems are : Problem set: 0 solved, 6 unsolved in 718 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1445 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1445 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1445 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1445/1445 variables, and 324 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1254 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2101ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 1330 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 19 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 146/146 places, 1499/1499 transitions.
RANDOM walk for 40000 steps (1025 resets) in 937 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (108 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (106 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (107 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 552876 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 3
Probabilistic random walk after 552876 steps, saw 79884 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2024-05-23 12:58:48] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-23 12:58:48] [INFO ] Invariant cache hit.
[2024-05-23 12:58:48] [INFO ] State equation strengthened by 154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/1445 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1445/1445 variables, and 321 constraints, problems are : Problem set: 0 solved, 3 unsolved in 660 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1445 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1445/1445 variables, and 322 constraints, problems are : Problem set: 0 solved, 3 unsolved in 693 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1436ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 325 ms.
Support contains 19 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Graph (trivial) has 48 edges and 146 vertex of which 2 / 146 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 143 transition count 1495
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 143 transition count 1494
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 33 place count 143 transition count 1467
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 143 transition count 1464
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 56 place count 140 transition count 1447
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 71 place count 140 transition count 1432
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 140 transition count 1432
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 139 transition count 1431
Applied a total of 73 rules in 124 ms. Remains 139 /146 variables (removed 7) and now considering 1431/1499 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 139/146 places, 1431/1499 transitions.
RANDOM walk for 40000 steps (1478 resets) in 772 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (156 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 575987 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 2
Probabilistic random walk after 575987 steps, saw 80265 distinct states, run finished after 3002 ms. (steps per millisecond=191 ) properties seen :0
[2024-05-23 12:58:53] [INFO ] Flow matrix only has 1236 transitions (discarded 195 similar events)
// Phase 1: matrix 1236 rows 139 cols
[2024-05-23 12:58:53] [INFO ] Computed 21 invariants in 15 ms
[2024-05-23 12:58:53] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 90/109 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 30/139 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1236/1375 variables, 139/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1375 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1375 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1375 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1375/1375 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 377 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 139/139 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 90/109 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 30/139 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1236/1375 variables, 139/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1375 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1375 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1375 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1375 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1375/1375 variables, and 168 constraints, problems are : Problem set: 0 solved, 2 unsolved in 454 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 139/139 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 881ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) p0))), (F p2), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 18 factoid took 478 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Product exploration explored 100000 steps with 618 reset in 301 ms.
Product exploration explored 100000 steps with 627 reset in 290 ms.
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Applied a total of 0 rules in 27 ms. Remains 941 /941 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2024-05-23 12:58:55] [INFO ] Computed 16 invariants in 17 ms
[2024-05-23 12:58:56] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-23 12:58:56] [INFO ] Invariant cache hit.
[2024-05-23 12:58:58] [INFO ] Implicit Places using invariants and state equation in 2428 ms returned []
Implicit Place search using SMT with State Equation took 3037 ms to find 0 implicit places.
Running 2532 sub problems to find dead transitions.
[2024-05-23 12:58:58] [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/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30056 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 2532/1508 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 6)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(s20 1)
(s21 1)
(s22 1)
(s23 0)
(s24 1)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 1)
(s31 0)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 6)
(s187 1)
(s188 1)
(s189 1)
(s190 0)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 0)
(s196 1)
(s197 1)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 0)
(s362 1)
(s363 1)
(s364 1)
(s365 0)
(s366 1)
(s367 8)
(s368 1)
(s369 1)
(s370 0)
(s371 1)
(s372 1)
(s373 1)
(s374 0)
(s375 1)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 1)
(s538 13)
(s539 1)
(s540 0)
(s541 0)
(s542 1)
(s543 1)
(s544 0)
(s545 0)
(s546 1)
(s547 13)
(s548 1)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 1)
(s713 12)
(s714 1)
(s715 0)
(s716 1)
(s717 1)
(s718 1)
(s719 0)
(s720 0)
(s721 1)
(s722 13)
(s723 1)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 1024/1508 constraints, Known Traps: 0/0 constraints]
After SMT, in 80474ms problems are : Problem set: 0 solved, 2532 unsolved
Search for dead transitions found 0 dead transitions in 80498ms
Finished structural reductions in LTL mode , in 1 iterations and 83569 ms. Remains : 941/941 places, 2533/2533 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-04 finished in 383728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G((X(p2)||p1))))))))'
Support contains 9 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 933 transition count 1514
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 933 transition count 1514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 933 transition count 1513
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 929 transition count 1509
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 929 transition count 1509
Applied a total of 50 rules in 84 ms. Remains 929 /954 variables (removed 25) and now considering 1509/2547 (removed 1038) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2024-05-23 13:00:19] [INFO ] Computed 15 invariants in 5 ms
[2024-05-23 13:00:19] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-23 13:00:19] [INFO ] Invariant cache hit.
[2024-05-23 13:00:20] [INFO ] Implicit Places using invariants and state equation in 887 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
[2024-05-23 13:00:20] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1128 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/954 places, 1509/2547 transitions.
Applied a total of 0 rules in 20 ms. Remains 928 /928 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1234 ms. Remains : 928/954 places, 1509/2547 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-05
Product exploration explored 100000 steps with 611 reset in 204 ms.
Product exploration explored 100000 steps with 620 reset in 219 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2860 edges and 928 vertex of which 912 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (247 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (26 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (28 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (28 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (21 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 177236 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 5
Probabilistic random walk after 177236 steps, saw 41965 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 1509 rows 928 cols
[2024-05-23 13:00:25] [INFO ] Computed 14 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 187/196 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 681/877 variables, 196/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/877 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 484/1361 variables, 203/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1361 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 436/1797 variables, 194/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1797 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 423/2220 variables, 189/796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2220 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 167/2387 variables, 116/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2387 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 35/2422 variables, 20/932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2422 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 15/2437 variables, 10/942 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2437 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/2437 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 942 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1385 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 187/196 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 681/877 variables, 196/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/877 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 484/1361 variables, 203/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1361 variables, 5/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1361 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 436/1797 variables, 194/612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1797 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 423/2220 variables, 189/801 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2220 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 167/2387 variables, 116/917 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2387 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 35/2422 variables, 20/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2422 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 15/2437 variables, 10/947 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2437 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2437 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 947 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3653 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 5098ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 742 ms.
Support contains 9 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 1509/1509 transitions.
Graph (trivial) has 956 edges and 928 vertex of which 341 / 928 are part of one of the 38 SCC in 0 ms
Free SCC test removed 303 places
Drop transitions (Empty/Sink Transition effects.) removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Graph (complete) has 2349 edges and 625 vertex of which 609 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 609 transition count 850
Reduce places removed 254 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 257 rules applied. Total rules applied 530 place count 355 transition count 847
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 532 place count 353 transition count 847
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 532 place count 353 transition count 790
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 646 place count 296 transition count 790
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 651 place count 291 transition count 785
Iterating global reduction 3 with 5 rules applied. Total rules applied 656 place count 291 transition count 785
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 656 place count 291 transition count 781
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 664 place count 287 transition count 781
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 830 place count 204 transition count 698
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 900 place count 169 transition count 908
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 932 place count 169 transition count 876
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 934 place count 168 transition count 893
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 937 place count 168 transition count 890
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 1065 place count 168 transition count 762
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 5 with 43 rules applied. Total rules applied 1108 place count 168 transition count 707
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 5 with 161 rules applied. Total rules applied 1269 place count 125 transition count 589
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1276 place count 118 transition count 542
Iterating global reduction 6 with 7 rules applied. Total rules applied 1283 place count 118 transition count 542
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1285 place count 118 transition count 540
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 7 with 61 rules applied. Total rules applied 1346 place count 118 transition count 479
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1350 place count 118 transition count 479
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1353 place count 118 transition count 476
Applied a total of 1353 rules in 100 ms. Remains 118 /928 variables (removed 810) and now considering 476/1509 (removed 1033) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 118/928 places, 476/1509 transitions.
RANDOM walk for 40000 steps (670 resets) in 522 ms. (76 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (42 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (44 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
[2024-05-23 13:00:31] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
// Phase 1: matrix 276 rows 118 cols
[2024-05-23 13:00:31] [INFO ] Computed 18 invariants in 1 ms
[2024-05-23 13:00:31] [INFO ] State equation strengthened by 141 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/75 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/114 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 275/389 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 120/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/394 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 21/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/394 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 118/118 constraints, ReadFeed: 141/141 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/75 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/114 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 275/389 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 120/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/394 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 21/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/394 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 118/118 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 660ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 9 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1509/1509 transitions.
Applied a total of 0 rules in 25 ms. Remains 928 /928 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
// Phase 1: matrix 1509 rows 928 cols
[2024-05-23 13:00:32] [INFO ] Computed 14 invariants in 9 ms
[2024-05-23 13:00:33] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-23 13:00:33] [INFO ] Invariant cache hit.
[2024-05-23 13:00:33] [INFO ] Implicit Places using invariants and state equation in 799 ms returned [18, 184, 192, 357, 365, 530, 538, 703, 711]
[2024-05-23 13:00:33] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1005 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 927/928 places, 1509/1509 transitions.
Applied a total of 0 rules in 20 ms. Remains 927 /927 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1050 ms. Remains : 927/928 places, 1509/1509 transitions.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2843 edges and 927 vertex of which 912 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (246 resets) in 444 ms. (89 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (25 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (22 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (30 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (28 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (21 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 155492 steps, run timeout after 3013 ms. (steps per millisecond=51 ) properties seen :0 out of 5
Probabilistic random walk after 155492 steps, saw 37811 distinct states, run finished after 3013 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 1509 rows 927 cols
[2024-05-23 13:00:37] [INFO ] Computed 13 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 167/176 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 653/829 variables, 176/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/829 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 495/1324 variables, 202/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 450/1774 variables, 205/596 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1774 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 421/2195 variables, 186/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2195 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 188/2383 variables, 125/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2383 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 38/2421 variables, 23/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2421 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 15/2436 variables, 10/940 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2436 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/2436 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2436/2436 variables, and 940 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1327 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 927/927 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 167/176 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 653/829 variables, 176/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/829 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 495/1324 variables, 202/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 450/1774 variables, 205/601 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1774 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 421/2195 variables, 186/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2195 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 188/2383 variables, 125/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2383 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 38/2421 variables, 23/935 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2421 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 15/2436 variables, 10/945 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2436 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2436 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2436/2436 variables, and 945 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3583 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 927/927 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 4963ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 99 ms.
Support contains 4 out of 927 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 927/927 places, 1509/1509 transitions.
Graph (trivial) has 965 edges and 927 vertex of which 355 / 927 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Drop transitions (Empty/Sink Transition effects.) removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Graph (complete) has 2293 edges and 612 vertex of which 597 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 597 transition count 836
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 522 place count 346 transition count 836
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 522 place count 346 transition count 779
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 636 place count 289 transition count 779
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 641 place count 284 transition count 774
Iterating global reduction 2 with 5 rules applied. Total rules applied 646 place count 284 transition count 774
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 646 place count 284 transition count 770
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 654 place count 280 transition count 770
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 814 place count 200 transition count 690
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 884 place count 165 transition count 900
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 919 place count 165 transition count 865
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1074 place count 165 transition count 710
Free-agglomeration rule applied 48 times with reduction of 20 identical transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1122 place count 165 transition count 642
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 923 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 194 rules applied. Total rules applied 1316 place count 116 transition count 497
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1317 place count 116 transition count 496
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1322 place count 111 transition count 466
Iterating global reduction 5 with 5 rules applied. Total rules applied 1327 place count 111 transition count 466
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 1402 place count 111 transition count 391
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1404 place count 111 transition count 391
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1405 place count 110 transition count 390
Applied a total of 1405 rules in 79 ms. Remains 110 /927 variables (removed 817) and now considering 390/1509 (removed 1119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 110/927 places, 390/1509 transitions.
RANDOM walk for 5357 steps (82 resets) in 15 ms. (334 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 280 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 631 reset in 214 ms.
Product exploration explored 100000 steps with 612 reset in 218 ms.
Support contains 9 out of 927 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 927/927 places, 1509/1509 transitions.
Applied a total of 0 rules in 35 ms. Remains 927 /927 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
[2024-05-23 13:00:44] [INFO ] Invariant cache hit.
[2024-05-23 13:00:44] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-23 13:00:44] [INFO ] Invariant cache hit.
[2024-05-23 13:00:45] [INFO ] Implicit Places using invariants and state equation in 923 ms returned [183, 191, 356, 364, 529, 537, 702, 710]
[2024-05-23 13:00:45] [INFO ] Actually due to overlaps returned [183]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 926/927 places, 1509/1509 transitions.
Applied a total of 0 rules in 19 ms. Remains 926 /926 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1163 ms. Remains : 926/927 places, 1509/1509 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-05 finished in 25781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 983 edges and 954 vertex of which 348 / 954 are part of one of the 39 SCC in 1 ms
Free SCC test removed 309 places
Ensure Unique test removed 354 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 2513 edges and 645 vertex of which 617 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 616 transition count 913
Reduce places removed 254 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 255 rules applied. Total rules applied 511 place count 362 transition count 912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 512 place count 361 transition count 912
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 512 place count 361 transition count 862
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 612 place count 311 transition count 862
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 617 place count 306 transition count 857
Iterating global reduction 3 with 5 rules applied. Total rules applied 622 place count 306 transition count 857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 306 transition count 856
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 623 place count 306 transition count 854
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 627 place count 304 transition count 854
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 825 place count 205 transition count 755
Performed 26 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 877 place count 179 transition count 835
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 4 with 46 rules applied. Total rules applied 923 place count 179 transition count 789
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 933 place count 174 transition count 874
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1013 place count 174 transition count 794
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1014 place count 173 transition count 793
Applied a total of 1014 rules in 104 ms. Remains 173 /954 variables (removed 781) and now considering 793/2547 (removed 1754) transitions.
[2024-05-23 13:00:45] [INFO ] Flow matrix only has 600 transitions (discarded 193 similar events)
// Phase 1: matrix 600 rows 173 cols
[2024-05-23 13:00:45] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 13:00:45] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 13:00:45] [INFO ] Flow matrix only has 600 transitions (discarded 193 similar events)
[2024-05-23 13:00:45] [INFO ] Invariant cache hit.
[2024-05-23 13:00:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 13:00:45] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-23 13:00:47] [INFO ] Redundant transitions in 1167 ms returned []
Running 752 sub problems to find dead transitions.
[2024-05-23 13:00:47] [INFO ] Flow matrix only has 600 transitions (discarded 193 similar events)
[2024-05-23 13:00:47] [INFO ] Invariant cache hit.
[2024-05-23 13:00:47] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 2 (OVERLAPS) 599/767 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 30/203 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 5 (OVERLAPS) 5/772 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 772/773 variables, and 208 constraints, problems are : Problem set: 0 solved, 752 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 752/752 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 752 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 2 (OVERLAPS) 599/767 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 30/203 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 29/232 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 6 (OVERLAPS) 5/772 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/772 variables, 723/960 constraints. Problems are: Problem set: 0 solved, 752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/773 variables, and 960 constraints, problems are : Problem set: 0 solved, 752 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 752/752 constraints, Known Traps: 0/0 constraints]
After SMT, in 61686ms problems are : Problem set: 0 solved, 752 unsolved
Search for dead transitions found 0 dead transitions in 61693ms
Starting structural reductions in SI_LTL mode, iteration 1 : 173/954 places, 793/2547 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63415 ms. Remains : 173/954 places, 793/2547 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-08 finished in 63467 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 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 983 edges and 954 vertex of which 355 / 954 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2505 edges and 639 vertex of which 611 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 610 transition count 908
Reduce places removed 253 places and 0 transitions.
Iterating post reduction 1 with 253 rules applied. Total rules applied 508 place count 357 transition count 908
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 508 place count 357 transition count 860
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 604 place count 309 transition count 860
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 608 place count 305 transition count 856
Iterating global reduction 2 with 4 rules applied. Total rules applied 612 place count 305 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 613 place count 305 transition count 855
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 613 place count 305 transition count 854
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 615 place count 304 transition count 854
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 813 place count 205 transition count 755
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 863 place count 180 transition count 826
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 903 place count 180 transition count 786
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 913 place count 175 transition count 871
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 993 place count 175 transition count 791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 994 place count 174 transition count 790
Applied a total of 994 rules in 95 ms. Remains 174 /954 variables (removed 780) and now considering 790/2547 (removed 1757) transitions.
[2024-05-23 13:01:49] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
// Phase 1: matrix 606 rows 174 cols
[2024-05-23 13:01:49] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 13:01:49] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-23 13:01:49] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-23 13:01:49] [INFO ] Invariant cache hit.
[2024-05-23 13:01:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 13:01:49] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-05-23 13:01:50] [INFO ] Redundant transitions in 600 ms returned []
Running 749 sub problems to find dead transitions.
[2024-05-23 13:01:50] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-23 13:01:50] [INFO ] Invariant cache hit.
[2024-05-23 13:01:50] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 5/779 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/780 variables, and 209 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 27/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (OVERLAPS) 5/779 variables, 5/236 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 722/958 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/780 variables, and 958 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61712ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 61718ms
Starting structural reductions in SI_LTL mode, iteration 1 : 174/954 places, 790/2547 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62924 ms. Remains : 174/954 places, 790/2547 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-09
Product exploration explored 100000 steps with 3089 reset in 428 ms.
Product exploration explored 100000 steps with 3075 reset in 406 ms.
Computed a total of 54 stabilizing places and 505 stable transitions
Computed a total of 54 stabilizing places and 505 stable transitions
Detected a total of 54/174 stabilizing places and 505/790 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1314 resets) in 961 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (85 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1179492 steps, run timeout after 3001 ms. (steps per millisecond=393 ) properties seen :0 out of 1
Probabilistic random walk after 1179492 steps, saw 148608 distinct states, run finished after 3001 ms. (steps per millisecond=393 ) properties seen :0
[2024-05-23 13:02:56] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-23 13:02:56] [INFO ] Invariant cache hit.
[2024-05-23 13:02:56] [INFO ] State equation strengthened by 30 read => feed constraints.
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 354/388 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/397 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 341/738 variables, 112/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/738 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 41/779 variables, 25/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/779 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 779/780 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 354/388 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/397 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 341/738 variables, 112/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/738 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 41/779 variables, 25/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/779 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/779 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/779 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 779/780 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 471ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 790/790 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 174 transition count 730
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 164 transition count 810
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 164 transition count 800
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 175 place count 164 transition count 715
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 225 place count 164 transition count 645
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 876 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 196 rules applied. Total rules applied 421 place count 113 transition count 500
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 113 transition count 499
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 427 place count 108 transition count 469
Iterating global reduction 4 with 5 rules applied. Total rules applied 432 place count 108 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 502 place count 108 transition count 399
Applied a total of 502 rules in 42 ms. Remains 108 /174 variables (removed 66) and now considering 399/790 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 108/174 places, 399/790 transitions.
RANDOM walk for 1012 steps (18 resets) in 11 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 790/790 transitions.
Applied a total of 0 rules in 11 ms. Remains 174 /174 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2024-05-23 13:02:57] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-23 13:02:57] [INFO ] Invariant cache hit.
[2024-05-23 13:02:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-23 13:02:57] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-23 13:02:57] [INFO ] Invariant cache hit.
[2024-05-23 13:02:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 13:02:57] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-23 13:02:58] [INFO ] Redundant transitions in 538 ms returned []
Running 749 sub problems to find dead transitions.
[2024-05-23 13:02:58] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-23 13:02:58] [INFO ] Invariant cache hit.
[2024-05-23 13:02:58] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 5/779 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/780 variables, and 209 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 27/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (OVERLAPS) 5/779 variables, 5/236 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 722/958 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/780 variables, and 958 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61689ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 61704ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62687 ms. Remains : 174/174 places, 790/790 transitions.
Computed a total of 54 stabilizing places and 505 stable transitions
Computed a total of 54 stabilizing places and 505 stable transitions
Detected a total of 54/174 stabilizing places and 505/790 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1281 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (75 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1148584 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 1
Probabilistic random walk after 1148584 steps, saw 143927 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
[2024-05-23 13:04:03] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-23 13:04:03] [INFO ] Invariant cache hit.
[2024-05-23 13:04:03] [INFO ] State equation strengthened by 30 read => feed constraints.
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 354/388 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/397 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 341/738 variables, 112/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/738 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 41/779 variables, 25/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/779 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 779/780 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 354/388 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/397 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 341/738 variables, 112/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/738 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 41/779 variables, 25/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/779 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/779 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/779 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 779/780 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 494ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 790/790 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 174 transition count 730
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 164 transition count 810
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 164 transition count 800
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 175 place count 164 transition count 715
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 225 place count 164 transition count 645
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 876 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 196 rules applied. Total rules applied 421 place count 113 transition count 500
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 113 transition count 499
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 427 place count 108 transition count 469
Iterating global reduction 4 with 5 rules applied. Total rules applied 432 place count 108 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 502 place count 108 transition count 399
Applied a total of 502 rules in 50 ms. Remains 108 /174 variables (removed 66) and now considering 399/790 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 108/174 places, 399/790 transitions.
RANDOM walk for 1945 steps (37 resets) in 11 ms. (162 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3047 reset in 372 ms.
Product exploration explored 100000 steps with 3057 reset in 383 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 790/790 transitions.
Applied a total of 0 rules in 13 ms. Remains 174 /174 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2024-05-23 13:04:04] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-23 13:04:04] [INFO ] Invariant cache hit.
[2024-05-23 13:04:04] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-23 13:04:04] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-23 13:04:04] [INFO ] Invariant cache hit.
[2024-05-23 13:04:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 13:04:05] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2024-05-23 13:04:05] [INFO ] Redundant transitions in 515 ms returned []
Running 749 sub problems to find dead transitions.
[2024-05-23 13:04:05] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-23 13:04:05] [INFO ] Invariant cache hit.
[2024-05-23 13:04:05] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 5/779 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/780 variables, and 209 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 27/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (OVERLAPS) 5/779 variables, 5/236 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 722/958 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/780 variables, and 958 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61934ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 61942ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63108 ms. Remains : 174/174 places, 790/790 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-09 finished in 199077 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 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 934 transition count 1515
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 934 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 934 transition count 1514
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 931 transition count 1511
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 931 transition count 1511
Applied a total of 46 rules in 86 ms. Remains 931 /954 variables (removed 23) and now considering 1511/2547 (removed 1036) transitions.
// Phase 1: matrix 1511 rows 931 cols
[2024-05-23 13:05:08] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 13:05:08] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-23 13:05:08] [INFO ] Invariant cache hit.
[2024-05-23 13:05:09] [INFO ] Implicit Places using invariants and state equation in 910 ms returned [11, 19, 185, 193, 358, 366, 533, 541, 706, 714]
[2024-05-23 13:05:09] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1168 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 930/954 places, 1511/2547 transitions.
Applied a total of 0 rules in 20 ms. Remains 930 /930 variables (removed 0) and now considering 1511/1511 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1276 ms. Remains : 930/954 places, 1511/2547 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1144 steps with 6 reset in 4 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-12 finished in 1421 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&&X((p0 U (X(p1)||G(p0))))))))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 934 transition count 1515
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 934 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 930 transition count 1510
Applied a total of 48 rules in 121 ms. Remains 930 /954 variables (removed 24) and now considering 1510/2547 (removed 1037) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2024-05-23 13:05:09] [INFO ] Computed 15 invariants in 4 ms
[2024-05-23 13:05:09] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-23 13:05:09] [INFO ] Invariant cache hit.
[2024-05-23 13:05:10] [INFO ] Implicit Places using invariants and state equation in 944 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 705, 713]
[2024-05-23 13:05:10] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1211 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/954 places, 1510/2547 transitions.
Applied a total of 0 rules in 22 ms. Remains 929 /929 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1355 ms. Remains : 929/954 places, 1510/2547 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-14
Product exploration explored 100000 steps with 633 reset in 207 ms.
Product exploration explored 100000 steps with 625 reset in 220 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2861 edges and 929 vertex of which 913 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 136 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (248 resets) in 245 ms. (162 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (31 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (33 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
// Phase 1: matrix 1510 rows 929 cols
[2024-05-23 13:05:11] [INFO ] Computed 14 invariants in 4 ms
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 391/420 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 182/602 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 683/1285 variables, 325/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1285 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 434/1719 variables, 205/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1719 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 412/2131 variables, 172/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2131 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 246/2377 variables, 153/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2377 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 42/2419 variables, 29/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2419 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 16/2435 variables, 8/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2435 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/2439 variables, 4/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2439 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2439 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2439/2439 variables, and 943 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1179 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 929/929 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 391/420 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 182/602 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 683/1285 variables, 325/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1285 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 434/1719 variables, 205/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1719 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 412/2131 variables, 172/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2131 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 246/2377 variables, 153/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2377 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/2419 variables, 29/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2419 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 16/2435 variables, 8/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2435 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/2439 variables, 4/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2439 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2439 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2439/2439 variables, and 945 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1005 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 929/929 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2216ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 2 out of 929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 929/929 places, 1510/1510 transitions.
Graph (trivial) has 966 edges and 929 vertex of which 340 / 929 are part of one of the 39 SCC in 1 ms
Free SCC test removed 301 places
Drop transitions (Empty/Sink Transition effects.) removed 385 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 386 transitions.
Graph (complete) has 2330 edges and 628 vertex of which 612 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 278 rules applied. Total rules applied 280 place count 612 transition count 846
Reduce places removed 259 places and 0 transitions.
Iterating post reduction 1 with 259 rules applied. Total rules applied 539 place count 353 transition count 846
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 539 place count 353 transition count 789
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 653 place count 296 transition count 789
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 658 place count 291 transition count 784
Iterating global reduction 2 with 5 rules applied. Total rules applied 663 place count 291 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 663 place count 291 transition count 779
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 673 place count 286 transition count 779
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 837 place count 204 transition count 697
Performed 36 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 909 place count 168 transition count 910
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 941 place count 168 transition count 878
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1096 place count 168 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1098 place count 167 transition count 734
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1099 place count 167 transition count 733
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1109 place count 167 transition count 723
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1110 place count 166 transition count 716
Iterating global reduction 4 with 1 rules applied. Total rules applied 1111 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 1161 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 140 transitions.
Graph (complete) has 905 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 191 rules applied. Total rules applied 1352 place count 115 transition count 506
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1353 place count 115 transition count 505
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1357 place count 111 transition count 481
Iterating global reduction 6 with 4 rules applied. Total rules applied 1361 place count 111 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 6 with 82 rules applied. Total rules applied 1443 place count 111 transition count 399
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1444 place count 111 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1445 place count 110 transition count 398
Applied a total of 1445 rules in 103 ms. Remains 110 /929 variables (removed 819) and now considering 398/1510 (removed 1112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 110/929 places, 398/1510 transitions.
RANDOM walk for 802 steps (9 resets) in 7 ms. (100 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 6 factoid took 194 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 929 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 929/929 places, 1510/1510 transitions.
Applied a total of 0 rules in 20 ms. Remains 929 /929 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2024-05-23 13:05:14] [INFO ] Invariant cache hit.
[2024-05-23 13:05:15] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-23 13:05:15] [INFO ] Invariant cache hit.
[2024-05-23 13:05:16] [INFO ] Implicit Places using invariants and state equation in 942 ms returned [18, 184, 192, 357, 365, 530, 538, 704, 712]
[2024-05-23 13:05:16] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1153 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/929 places, 1510/1510 transitions.
Applied a total of 0 rules in 22 ms. Remains 928 /928 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1196 ms. Remains : 928/929 places, 1510/1510 transitions.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2844 edges and 928 vertex of which 913 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 110 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (247 resets) in 172 ms. (231 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (33 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
// Phase 1: matrix 1510 rows 928 cols
[2024-05-23 13:05:16] [INFO ] Computed 13 invariants in 5 ms
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 391/420 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 162/582 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 679/1261 variables, 311/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1261 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 451/1712 variables, 214/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1712 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 416/2128 variables, 175/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2128 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 246/2374 variables, 153/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2374 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 44/2418 variables, 30/929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2418 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 16/2434 variables, 8/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2434 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/2438 variables, 4/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2438 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2438 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2438/2438 variables, and 941 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1105 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 928/928 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 391/420 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 162/582 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 679/1261 variables, 311/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1261 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 451/1712 variables, 214/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1712 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 416/2128 variables, 175/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2128 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 246/2374 variables, 153/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2374 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 44/2418 variables, 30/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2418 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 16/2434 variables, 8/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2434 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/2438 variables, 4/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2438 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2438 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2438/2438 variables, and 943 constraints, problems are : Problem set: 0 solved, 2 unsolved in 996 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2127ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 105 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=52 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 635 reset in 211 ms.
Product exploration explored 100000 steps with 633 reset in 224 ms.
Support contains 2 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1510/1510 transitions.
Applied a total of 0 rules in 24 ms. Remains 928 /928 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2024-05-23 13:05:19] [INFO ] Invariant cache hit.
[2024-05-23 13:05:20] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-23 13:05:20] [INFO ] Invariant cache hit.
[2024-05-23 13:05:21] [INFO ] Implicit Places using invariants and state equation in 962 ms returned [183, 191, 356, 364, 529, 537, 703, 711]
[2024-05-23 13:05:21] [INFO ] Actually due to overlaps returned [183]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1189 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 927/928 places, 1510/1510 transitions.
Applied a total of 0 rules in 22 ms. Remains 927 /927 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1235 ms. Remains : 927/928 places, 1510/1510 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-14 finished in 11862 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(G((F((p0||G(p1)))||(p2&&X((p2 U (!p0||G(p2))))))))))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-01
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 981 edges and 954 vertex of which 355 / 954 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2505 edges and 639 vertex of which 611 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.17 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 610 transition count 909
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 506 place count 358 transition count 909
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 506 place count 358 transition count 861
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 602 place count 310 transition count 861
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 605 place count 307 transition count 858
Iterating global reduction 2 with 3 rules applied. Total rules applied 608 place count 307 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 609 place count 307 transition count 857
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 609 place count 307 transition count 856
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 611 place count 306 transition count 856
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 809 place count 207 transition count 757
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 859 place count 182 transition count 832
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 860 place count 181 transition count 831
Applied a total of 860 rules in 90 ms. Remains 181 /954 variables (removed 773) and now considering 831/2547 (removed 1716) transitions.
[2024-05-23 13:05:21] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
// Phase 1: matrix 672 rows 181 cols
[2024-05-23 13:05:21] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 13:05:21] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-23 13:05:21] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-23 13:05:21] [INFO ] Invariant cache hit.
[2024-05-23 13:05:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-23 13:05:22] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2024-05-23 13:05:22] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-23 13:05:22] [INFO ] Invariant cache hit.
[2024-05-23 13:05:22] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (OVERLAPS) 5/852 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/853 variables, and 221 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 40/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (OVERLAPS) 5/852 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 750/1011 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/853 variables, and 1011 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
After SMT, in 61841ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 61848ms
Starting structural reductions in LI_LTL mode, iteration 1 : 181/954 places, 831/2547 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62575 ms. Remains : 181/954 places, 831/2547 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-01
Product exploration explored 100000 steps with 3126 reset in 347 ms.
Product exploration explored 100000 steps with 3123 reset in 366 ms.
Computed a total of 51 stabilizing places and 521 stable transitions
Computed a total of 51 stabilizing places and 521 stable transitions
Detected a total of 51/181 stabilizing places and 521/831 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 442 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1327 resets) in 890 ms. (44 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (83 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (81 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 352598 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 6
Probabilistic random walk after 352598 steps, saw 52332 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-23 13:06:28] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-23 13:06:28] [INFO ] Invariant cache hit.
[2024-05-23 13:06:28] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 116/122 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 555/677 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/682 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 160/842 variables, 75/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/842 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 10/852 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/853 variables, and 221 constraints, problems are : Problem set: 0 solved, 6 unsolved in 569 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 116/122 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 555/677 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 5/682 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 160/842 variables, 75/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/842 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 10/852 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/852 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/852 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/853 variables, and 227 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1213 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1804ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 256 ms.
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 831/831 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 181 transition count 761
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 100 place count 166 transition count 906
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 135 place count 166 transition count 871
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 2 with 155 rules applied. Total rules applied 290 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 340 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 893 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 196 rules applied. Total rules applied 536 place count 115 transition count 501
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 115 transition count 500
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 542 place count 110 transition count 470
Iterating global reduction 4 with 5 rules applied. Total rules applied 547 place count 110 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 617 place count 110 transition count 400
Applied a total of 617 rules in 46 ms. Remains 110 /181 variables (removed 71) and now considering 400/831 (removed 431) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 110/181 places, 400/831 transitions.
RANDOM walk for 18461 steps (345 resets) in 71 ms. (256 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 923 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 831/831 transitions.
Applied a total of 0 rules in 2 ms. Remains 181 /181 variables (removed 0) and now considering 831/831 (removed 0) transitions.
[2024-05-23 13:06:32] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-23 13:06:32] [INFO ] Invariant cache hit.
[2024-05-23 13:06:32] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-23 13:06:32] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-23 13:06:32] [INFO ] Invariant cache hit.
[2024-05-23 13:06:32] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-23 13:06:32] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2024-05-23 13:06:32] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-23 13:06:32] [INFO ] Invariant cache hit.
[2024-05-23 13:06:32] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (OVERLAPS) 5/852 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/853 variables, and 221 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 40/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (OVERLAPS) 5/852 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 750/1011 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/853 variables, and 1011 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
After SMT, in 61798ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 61805ms
Finished structural reductions in LTL mode , in 1 iterations and 62310 ms. Remains : 181/181 places, 831/831 transitions.
Computed a total of 51 stabilizing places and 521 stable transitions
Computed a total of 51 stabilizing places and 521 stable transitions
Detected a total of 51/181 stabilizing places and 521/831 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 372 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1339 resets) in 1177 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (84 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (84 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 226710 steps, run timeout after 3014 ms. (steps per millisecond=75 ) properties seen :0 out of 6
Probabilistic random walk after 226710 steps, saw 35305 distinct states, run finished after 3014 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-23 13:07:38] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-23 13:07:38] [INFO ] Invariant cache hit.
[2024-05-23 13:07:38] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 116/122 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 555/677 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/682 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 160/842 variables, 75/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/842 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 10/852 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/853 variables, and 221 constraints, problems are : Problem set: 0 solved, 6 unsolved in 554 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 116/122 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 555/677 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 5/682 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 160/842 variables, 75/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/842 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 10/852 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/852 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/852 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/853 variables, and 227 constraints, problems are : Problem set: 0 solved, 6 unsolved in 543 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1137ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 179 ms.
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 831/831 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 181 transition count 761
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 100 place count 166 transition count 906
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 135 place count 166 transition count 871
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 2 with 155 rules applied. Total rules applied 290 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 340 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 893 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 196 rules applied. Total rules applied 536 place count 115 transition count 501
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 115 transition count 500
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 542 place count 110 transition count 470
Iterating global reduction 4 with 5 rules applied. Total rules applied 547 place count 110 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 617 place count 110 transition count 400
Applied a total of 617 rules in 47 ms. Remains 110 /181 variables (removed 71) and now considering 400/831 (removed 431) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 110/181 places, 400/831 transitions.
RANDOM walk for 26407 steps (499 resets) in 66 ms. (394 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 1040 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3144 reset in 352 ms.
Product exploration explored 100000 steps with 3147 reset in 374 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 831/831 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 181 transition count 791
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -105
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 45 place count 181 transition count 896
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 125 place count 181 transition count 816
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 125 rules in 40 ms. Remains 181 /181 variables (removed 0) and now considering 816/831 (removed 15) transitions.
[2024-05-23 13:07:43] [INFO ] Redundant transitions in 557 ms returned []
Running 775 sub problems to find dead transitions.
[2024-05-23 13:07:43] [INFO ] Flow matrix only has 632 transitions (discarded 184 similar events)
// Phase 1: matrix 632 rows 181 cols
[2024-05-23 13:07:43] [INFO ] Computed 5 invariants in 4 ms
[2024-05-23 13:07:43] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 775 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 775 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
At refinement iteration 2 (OVERLAPS) 631/807 variables, 176/181 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/807 variables, 30/211 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/211 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 5 (OVERLAPS) 5/812 variables, 5/216 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/812 variables, 0/216 constraints. Problems are: Problem set: 20 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 812/813 variables, and 216 constraints, problems are : Problem set: 20 solved, 755 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 775/775 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 5/5 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 2 (OVERLAPS) 626/797 variables, 171/176 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/797 variables, 30/206 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 36/242 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/797 variables, 0/242 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 6 (OVERLAPS) 15/812 variables, 10/252 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/812 variables, 719/971 constraints. Problems are: Problem set: 20 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 812/813 variables, and 971 constraints, problems are : Problem set: 20 solved, 755 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 755/775 constraints, Known Traps: 0/0 constraints]
After SMT, in 61746ms problems are : Problem set: 20 solved, 755 unsolved
Search for dead transitions found 20 dead transitions in 61754ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/181 places, 796/831 transitions.
Graph (complete) has 1766 edges and 181 vertex of which 176 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 176 /181 variables (removed 5) and now considering 796/796 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 176/181 places, 796/831 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62379 ms. Remains : 176/181 places, 796/831 transitions.
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 831/831 transitions.
Applied a total of 0 rules in 2 ms. Remains 181 /181 variables (removed 0) and now considering 831/831 (removed 0) transitions.
[2024-05-23 13:08:45] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
// Phase 1: matrix 672 rows 181 cols
[2024-05-23 13:08:45] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 13:08:45] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-23 13:08:45] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-23 13:08:45] [INFO ] Invariant cache hit.
[2024-05-23 13:08:45] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-23 13:08:45] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2024-05-23 13:08:45] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-23 13:08:45] [INFO ] Invariant cache hit.
[2024-05-23 13:08:45] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (OVERLAPS) 5/852 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/853 variables, and 221 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 40/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (OVERLAPS) 5/852 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 750/1011 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/853 variables, and 1011 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
After SMT, in 62116ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 62124ms
Finished structural reductions in LTL mode , in 1 iterations and 62612 ms. Remains : 181/181 places, 831/831 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-01 finished in 266695 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(((p1 U X(G(!p2)))&&p0)))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-04
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p2), p2, p2]
Support contains 24 out of 954 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 963 edges and 954 vertex of which 346 / 954 are part of one of the 39 SCC in 0 ms
Free SCC test removed 307 places
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Graph (complete) has 2521 edges and 647 vertex of which 646 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 646 transition count 1942
Reduce places removed 253 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 256 rules applied. Total rules applied 511 place count 393 transition count 1939
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 513 place count 391 transition count 1939
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 513 place count 391 transition count 1890
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 611 place count 342 transition count 1890
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 615 place count 338 transition count 1886
Iterating global reduction 3 with 4 rules applied. Total rules applied 619 place count 338 transition count 1886
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 620 place count 338 transition count 1885
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 620 place count 338 transition count 1883
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 624 place count 336 transition count 1883
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 824 place count 236 transition count 1783
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 874 place count 211 transition count 1913
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 894 place count 211 transition count 1893
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 898 place count 211 transition count 1889
Applied a total of 898 rules in 111 ms. Remains 211 /954 variables (removed 743) and now considering 1889/2547 (removed 658) transitions.
[2024-05-23 13:09:48] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2024-05-23 13:09:48] [INFO ] Computed 16 invariants in 17 ms
[2024-05-23 13:09:48] [INFO ] Implicit Places using invariants in 608 ms returned []
[2024-05-23 13:09:48] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-23 13:09:48] [INFO ] Invariant cache hit.
[2024-05-23 13:09:49] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-23 13:09:50] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
Running 1888 sub problems to find dead transitions.
[2024-05-23 13:09:50] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-23 13:09:50] [INFO ] Invariant cache hit.
[2024-05-23 13:09:50] [INFO ] State equation strengthened by 228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1915/1917 variables, and 453 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1915 variables, 864/1317 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1915/1917 variables, and 1317 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 80380ms problems are : Problem set: 0 solved, 1888 unsolved
Search for dead transitions found 0 dead transitions in 80399ms
Starting structural reductions in LI_LTL mode, iteration 1 : 211/954 places, 1889/2547 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 82797 ms. Remains : 211/954 places, 1889/2547 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-04
Product exploration explored 100000 steps with 2898 reset in 585 ms.
Product exploration explored 100000 steps with 2898 reset in 594 ms.
Computed a total of 68 stabilizing places and 1569 stable transitions
Graph (complete) has 2047 edges and 211 vertex of which 184 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Computed a total of 68 stabilizing places and 1569 stable transitions
Detected a total of 68/211 stabilizing places and 1569/1889 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 154 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) p2), p2, p2]
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 40000 steps (1196 resets) in 1540 ms. (25 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (81 resets) in 72 ms. (548 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (82 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (82 resets) in 278 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (80 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (74 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (82 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (77 resets) in 198 ms. (201 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (77 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (84 resets) in 191 ms. (208 steps per ms) remains 9/9 properties
[2024-05-23 13:11:13] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-23 13:11:13] [INFO ] Invariant cache hit.
[2024-05-23 13:11:13] [INFO ] State equation strengthened by 228 read => feed constraints.
Problem apf5 is UNSAT
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 85/109 variables, 15/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1578/1687 variables, 109/125 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 165/290 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 220/1907 variables, 93/383 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1907 variables, 62/445 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1907 variables, 0/445 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 9/1916 variables, 9/454 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1916 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/1917 variables, 1/455 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1917 variables, 0/455 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1917 variables, 0/455 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1917/1917 variables, and 455 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1403 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 85/109 variables, 15/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1578/1687 variables, 109/125 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 165/290 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 220/1907 variables, 93/383 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1907 variables, 62/445 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1907 variables, 1/446 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1907 variables, 0/446 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 9/1916 variables, 9/455 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1916 variables, 2/457 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1916 variables, 0/457 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/1917 variables, 1/458 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1917 variables, 0/458 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/1917 variables, 0/458 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1917/1917 variables, and 458 constraints, problems are : Problem set: 2 solved, 7 unsolved in 2834 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4391ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 1528 ms.
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 211 transition count 1850
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 59 place count 201 transition count 1930
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 201 transition count 1922
Drop transitions (Redundant composition of simpler transitions.) removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 2 with 130 rules applied. Total rules applied 197 place count 201 transition count 1792
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 245 place count 201 transition count 1732
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 2 with 166 rules applied. Total rules applied 411 place count 153 transition count 1614
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 418 place count 146 transition count 1567
Iterating global reduction 3 with 7 rules applied. Total rules applied 425 place count 146 transition count 1567
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 427 place count 146 transition count 1565
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 488 place count 146 transition count 1504
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 146 transition count 1504
Applied a total of 490 rules in 127 ms. Remains 146 /211 variables (removed 65) and now considering 1504/1889 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 146/211 places, 1504/1889 transitions.
RANDOM walk for 40000 steps (1055 resets) in 1047 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (106 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (103 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (108 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 205374 steps, run timeout after 3075 ms. (steps per millisecond=66 ) properties seen :0 out of 3
Probabilistic random walk after 205374 steps, saw 33239 distinct states, run finished after 3076 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-23 13:11:23] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
// Phase 1: matrix 1304 rows 146 cols
[2024-05-23 13:11:23] [INFO ] Computed 16 invariants in 7 ms
[2024-05-23 13:11:23] [INFO ] State equation strengthened by 158 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 50/74 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1213/1287 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1287 variables, 95/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1287 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 97/1384 variables, 37/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1384 variables, 38/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1384 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 58/1442 variables, 27/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1442 variables, 25/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1442 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 8/1450 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1450 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1450 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1450/1450 variables, and 320 constraints, problems are : Problem set: 0 solved, 3 unsolved in 682 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 146/146 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 50/74 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1213/1287 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1287 variables, 95/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1287 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 97/1384 variables, 37/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1384 variables, 38/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1384 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1384 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 58/1442 variables, 27/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1442 variables, 25/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1442 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1450 variables, 8/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1450 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1450 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1450/1450 variables, and 321 constraints, problems are : Problem set: 0 solved, 3 unsolved in 798 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 146/146 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1575ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2167 steps, including 42 resets, run visited all 1 properties in 9 ms. (steps per millisecond=240 )
Parikh walk visited 3 properties in 34 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p1), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 32 factoid took 613 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Applied a total of 0 rules in 9 ms. Remains 211 /211 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2024-05-23 13:11:25] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2024-05-23 13:11:25] [INFO ] Computed 16 invariants in 11 ms
[2024-05-23 13:11:26] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-23 13:11:26] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-23 13:11:26] [INFO ] Invariant cache hit.
[2024-05-23 13:11:26] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-23 13:11:27] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 2267 ms to find 0 implicit places.
Running 1888 sub problems to find dead transitions.
[2024-05-23 13:11:27] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-23 13:11:27] [INFO ] Invariant cache hit.
[2024-05-23 13:11:28] [INFO ] State equation strengthened by 228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1915/1917 variables, and 453 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1915 variables, 864/1317 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1915/1917 variables, and 1317 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 80337ms problems are : Problem set: 0 solved, 1888 unsolved
Search for dead transitions found 0 dead transitions in 80355ms
Finished structural reductions in LTL mode , in 1 iterations and 82648 ms. Remains : 211/211 places, 1889/1889 transitions.
Computed a total of 68 stabilizing places and 1569 stable transitions
Graph (complete) has 2047 edges and 211 vertex of which 184 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Computed a total of 68 stabilizing places and 1569 stable transitions
Detected a total of 68/211 stabilizing places and 1569/1889 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 159 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
RANDOM walk for 40000 steps (1224 resets) in 1228 ms. (32 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (80 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (83 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
[2024-05-23 13:12:49] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-23 13:12:49] [INFO ] Invariant cache hit.
[2024-05-23 13:12:49] [INFO ] State equation strengthened by 228 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 85/109 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1578/1687 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 165/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 220/1907 variables, 93/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1907 variables, 62/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1907 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/1916 variables, 9/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1916 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/1917 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1917 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1917 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1917/1917 variables, and 455 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1272 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 85/109 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1578/1687 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 165/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 220/1907 variables, 93/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1907 variables, 62/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1907 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1907 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 9/1916 variables, 9/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1916 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1916 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/1917 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1917 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1917 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1917/1917 variables, and 458 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2496 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3910ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 863 ms.
Support contains 19 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Graph (trivial) has 177 edges and 211 vertex of which 2 / 211 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 210 transition count 1846
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 208 transition count 1846
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 208 transition count 1845
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 26 place count 198 transition count 1925
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 36 place count 198 transition count 1915
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 2 with 155 rules applied. Total rules applied 191 place count 198 transition count 1760
Free-agglomeration rule applied 53 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 53 rules applied. Total rules applied 244 place count 198 transition count 1687
Reduce places removed 53 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Iterating post reduction 2 with 198 rules applied. Total rules applied 442 place count 145 transition count 1542
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 447 place count 140 transition count 1512
Iterating global reduction 3 with 5 rules applied. Total rules applied 452 place count 140 transition count 1512
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 527 place count 140 transition count 1437
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 528 place count 140 transition count 1437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 529 place count 139 transition count 1436
Applied a total of 529 rules in 198 ms. Remains 139 /211 variables (removed 72) and now considering 1436/1889 (removed 453) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 139/211 places, 1436/1889 transitions.
RANDOM walk for 40000 steps (1532 resets) in 1048 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (167 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (162 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 296240 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 296240 steps, saw 58115 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2024-05-23 13:12:57] [INFO ] Flow matrix only has 1241 transitions (discarded 195 similar events)
// Phase 1: matrix 1241 rows 139 cols
[2024-05-23 13:12:57] [INFO ] Computed 16 invariants in 6 ms
[2024-05-23 13:12:57] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 19/38 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 30/68 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1136/1204 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1204 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 93/1297 variables, 27/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1297 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1297 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 73/1370 variables, 34/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1370 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/1380 variables, 10/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1380 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1380 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1380/1380 variables, and 162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 369 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 139/139 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 19/38 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 30/68 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1136/1204 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1204 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 93/1297 variables, 27/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1297 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1297 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1297 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 73/1370 variables, 34/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1370 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/1380 variables, 10/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1380 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1380 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1380/1380 variables, and 163 constraints, problems are : Problem set: 0 solved, 2 unsolved in 488 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 139/139 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 918ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) p0))), (F p2), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 18 factoid took 483 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Product exploration explored 100000 steps with 2906 reset in 536 ms.
Product exploration explored 100000 steps with 2885 reset in 551 ms.
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Applied a total of 0 rules in 8 ms. Remains 211 /211 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2024-05-23 13:13:00] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2024-05-23 13:13:00] [INFO ] Computed 16 invariants in 10 ms
[2024-05-23 13:13:01] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-23 13:13:01] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-23 13:13:01] [INFO ] Invariant cache hit.
[2024-05-23 13:13:01] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-23 13:13:02] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
Running 1888 sub problems to find dead transitions.
[2024-05-23 13:13:03] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-23 13:13:03] [INFO ] Invariant cache hit.
[2024-05-23 13:13:03] [INFO ] State equation strengthened by 228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1915/1917 variables, and 453 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1915 variables, 864/1317 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1915/1917 variables, and 1317 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 80278ms problems are : Problem set: 0 solved, 1888 unsolved
Search for dead transitions found 0 dead transitions in 80297ms
Finished structural reductions in LTL mode , in 1 iterations and 82481 ms. Remains : 211/211 places, 1889/1889 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-04 finished in 275470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G((X(p2)||p1))))))))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-05
Stuttering acceptance computed with spot in 269 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 9 out of 954 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 971 edges and 954 vertex of which 341 / 954 are part of one of the 38 SCC in 0 ms
Free SCC test removed 303 places
Ensure Unique test removed 347 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 2525 edges and 651 vertex of which 623 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 623 transition count 920
Reduce places removed 255 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 258 rules applied. Total rules applied 515 place count 368 transition count 917
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 517 place count 366 transition count 917
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 517 place count 366 transition count 868
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 615 place count 317 transition count 868
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 620 place count 312 transition count 863
Iterating global reduction 3 with 5 rules applied. Total rules applied 625 place count 312 transition count 863
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 626 place count 312 transition count 862
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 626 place count 312 transition count 860
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 630 place count 310 transition count 860
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 832 place count 209 transition count 759
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 882 place count 184 transition count 834
Applied a total of 882 rules in 48 ms. Remains 184 /954 variables (removed 770) and now considering 834/2547 (removed 1713) transitions.
[2024-05-23 13:14:23] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
// Phase 1: matrix 677 rows 184 cols
[2024-05-23 13:14:23] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 13:14:23] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-23 13:14:23] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-23 13:14:24] [INFO ] Invariant cache hit.
[2024-05-23 13:14:24] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-23 13:14:24] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-23 13:14:24] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-23 13:14:24] [INFO ] Invariant cache hit.
[2024-05-23 13:14:24] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 1/860 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 860/861 variables, and 392 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 833/1224 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/861 variables, and 1224 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
After SMT, in 61812ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 61820ms
Starting structural reductions in LI_LTL mode, iteration 1 : 184/954 places, 834/2547 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62463 ms. Remains : 184/954 places, 834/2547 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-05
Product exploration explored 100000 steps with 2848 reset in 407 ms.
Product exploration explored 100000 steps with 2855 reset in 412 ms.
Computed a total of 49 stabilizing places and 491 stable transitions
Computed a total of 49 stabilizing places and 491 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1183 resets) in 689 ms. (57 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (63 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (56 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (58 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (57 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (57 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 330965 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 5
Probabilistic random walk after 330965 steps, saw 46723 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-23 13:15:30] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-23 13:15:30] [INFO ] Invariant cache hit.
[2024-05-23 13:15:30] [INFO ] State equation strengthened by 204 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 31/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/405 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 427/832 variables, 124/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 198/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 28/860 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/861 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/861 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 393 constraints, problems are : Problem set: 0 solved, 5 unsolved in 464 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 31/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/405 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 427/832 variables, 124/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 198/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 28/860 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/860 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/860 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/861 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/861 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/861 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 398 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1156 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1683ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 725 ms.
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 834/834 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 184 transition count 768
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 96 place count 169 transition count 913
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 128 place count 169 transition count 881
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 168 transition count 898
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 168 transition count 895
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 3 with 128 rules applied. Total rules applied 261 place count 168 transition count 767
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 304 place count 168 transition count 712
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 465 place count 125 transition count 594
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 472 place count 118 transition count 547
Iterating global reduction 4 with 7 rules applied. Total rules applied 479 place count 118 transition count 547
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 481 place count 118 transition count 545
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 542 place count 118 transition count 484
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 546 place count 118 transition count 484
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 549 place count 118 transition count 481
Applied a total of 549 rules in 66 ms. Remains 118 /184 variables (removed 66) and now considering 481/834 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 118/184 places, 481/834 transitions.
RANDOM walk for 40000 steps (782 resets) in 979 ms. (40 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (53 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (54 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
[2024-05-23 13:15:33] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
// Phase 1: matrix 281 rows 118 cols
[2024-05-23 13:15:33] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 13:15:33] [INFO ] State equation strengthened by 145 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 195/243 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 61/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/335 variables, 35/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 59/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/391 variables, 27/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 25/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/399 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/399 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 252 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 118/118 constraints, ReadFeed: 145/145 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 195/243 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 61/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/335 variables, 35/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 59/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/391 variables, 27/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 25/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/399 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/399 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 327 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 118/118 constraints, ReadFeed: 145/145 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 623ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 105 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=52 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 834/834 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 834/834 (removed 0) transitions.
[2024-05-23 13:15:34] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
// Phase 1: matrix 677 rows 184 cols
[2024-05-23 13:15:34] [INFO ] Computed 5 invariants in 5 ms
[2024-05-23 13:15:35] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-23 13:15:35] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-23 13:15:35] [INFO ] Invariant cache hit.
[2024-05-23 13:15:35] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-23 13:15:35] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-23 13:15:35] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-23 13:15:35] [INFO ] Invariant cache hit.
[2024-05-23 13:15:35] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 1/860 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 860/861 variables, and 392 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 833/1224 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/861 variables, and 1224 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
After SMT, in 62352ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 62372ms
Finished structural reductions in LTL mode , in 1 iterations and 62943 ms. Remains : 184/184 places, 834/834 transitions.
Computed a total of 49 stabilizing places and 491 stable transitions
Computed a total of 49 stabilizing places and 491 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1179 resets) in 1096 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (63 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (56 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (58 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (60 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (54 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 465023 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 5
Probabilistic random walk after 465023 steps, saw 65636 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2024-05-23 13:16:41] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-23 13:16:41] [INFO ] Invariant cache hit.
[2024-05-23 13:16:41] [INFO ] State equation strengthened by 204 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 31/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/405 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 427/832 variables, 124/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 198/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 28/860 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/861 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/861 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 393 constraints, problems are : Problem set: 0 solved, 5 unsolved in 485 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 31/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/405 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 427/832 variables, 124/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 198/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 28/860 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/860 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/860 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/861 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/861 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/861 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 398 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1260 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1782ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 482 ms.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 834/834 transitions.
Graph (trivial) has 183 edges and 184 vertex of which 5 / 184 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 181 transition count 760
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 3 place count 180 transition count 760
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 33 place count 165 transition count 905
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 68 place count 165 transition count 870
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 1 with 155 rules applied. Total rules applied 223 place count 165 transition count 715
Free-agglomeration rule applied 48 times with reduction of 20 identical transitions.
Iterating global reduction 1 with 48 rules applied. Total rules applied 271 place count 165 transition count 647
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 923 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 194 rules applied. Total rules applied 465 place count 116 transition count 502
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 466 place count 116 transition count 501
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 471 place count 111 transition count 471
Iterating global reduction 3 with 5 rules applied. Total rules applied 476 place count 111 transition count 471
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 551 place count 111 transition count 396
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 553 place count 111 transition count 396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 554 place count 110 transition count 395
Applied a total of 554 rules in 58 ms. Remains 110 /184 variables (removed 74) and now considering 395/834 (removed 439) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 110/184 places, 395/834 transitions.
RANDOM walk for 1917 steps (34 resets) in 13 ms. (136 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 255 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2836 reset in 459 ms.
Product exploration explored 100000 steps with 2832 reset in 413 ms.
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 834/834 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 834/834 (removed 0) transitions.
[2024-05-23 13:16:45] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-23 13:16:45] [INFO ] Invariant cache hit.
[2024-05-23 13:16:46] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 13:16:46] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-23 13:16:46] [INFO ] Invariant cache hit.
[2024-05-23 13:16:46] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-23 13:16:46] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-23 13:16:46] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-23 13:16:46] [INFO ] Invariant cache hit.
[2024-05-23 13:16:46] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 1/860 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 860/861 variables, and 392 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 833/1224 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/861 variables, and 1224 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
After SMT, in 62130ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 62139ms
Finished structural reductions in LTL mode , in 1 iterations and 62684 ms. Remains : 184/184 places, 834/834 transitions.
Treatment of property CloudDeployment-PT-5b-LTLFireability-05 finished in 205386 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)))'
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&&X((p0 U (X(p1)||G(p0))))))))'
[2024-05-23 13:17:49] [INFO ] Flatten gal took : 239 ms
[2024-05-23 13:17:49] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 13:17:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 954 places, 2547 transitions and 23539 arcs took 23 ms.
Total runtime 1629144 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CloudDeployment-PT-5b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 954
TRANSITIONS: 2547
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.110s, Sys 0.008s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.012s, 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: 2758
MODEL NAME: /home/mcc/execution/414/model
954 places, 2547 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.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
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="CloudDeployment-PT-5b"
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 CloudDeployment-PT-5b, 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 r069-tall-171620504800596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5b.tgz
mv CloudDeployment-PT-5b 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 '
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 ;