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-171620504700548.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-2b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504700548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 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 166K 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-2b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716464726173

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-2b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 11:45:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 11:45:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 11:45:27] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-23 11:45:27] [INFO ] Transformed 556 places.
[2024-05-23 11:45:27] [INFO ] Transformed 684 transitions.
[2024-05-23 11:45:27] [INFO ] Found NUPN structural information;
[2024-05-23 11:45:27] [INFO ] Parsed PT model containing 556 places and 684 transitions and 1987 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CloudDeployment-PT-2b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 684/684 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 553 transition count 684
Discarding 126 places :
Symmetric choice reduction at 1 with 126 rule applications. Total rules 129 place count 427 transition count 547
Iterating global reduction 1 with 126 rules applied. Total rules applied 255 place count 427 transition count 547
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 297 place count 385 transition count 505
Iterating global reduction 1 with 42 rules applied. Total rules applied 339 place count 385 transition count 505
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 341 place count 385 transition count 503
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 346 place count 380 transition count 498
Iterating global reduction 2 with 5 rules applied. Total rules applied 351 place count 380 transition count 498
Applied a total of 351 rules in 122 ms. Remains 380 /556 variables (removed 176) and now considering 498/684 (removed 186) transitions.
// Phase 1: matrix 498 rows 380 cols
[2024-05-23 11:45:27] [INFO ] Computed 6 invariants in 23 ms
[2024-05-23 11:45:28] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-23 11:45:28] [INFO ] Invariant cache hit.
[2024-05-23 11:45:28] [INFO ] Implicit Places using invariants and state equation in 281 ms returned [8, 16, 184, 192]
[2024-05-23 11:45:28] [INFO ] Actually due to overlaps returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 588 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 379/556 places, 498/684 transitions.
Applied a total of 0 rules in 19 ms. Remains 379 /379 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 747 ms. Remains : 379/556 places, 498/684 transitions.
Support contains 23 out of 379 places after structural reductions.
[2024-05-23 11:45:28] [INFO ] Flatten gal took : 81 ms
[2024-05-23 11:45:28] [INFO ] Flatten gal took : 46 ms
[2024-05-23 11:45:28] [INFO ] Input system was already deterministic with 498 transitions.
RANDOM walk for 40000 steps (626 resets) in 1395 ms. (28 steps per ms) remains 9/18 properties
BEST_FIRST walk for 40003 steps (139 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (139 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (137 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (132 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (144 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (144 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (99 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (93 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (141 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
// Phase 1: matrix 498 rows 379 cols
[2024-05-23 11:45:29] [INFO ] Computed 5 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 70/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 169/253 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 215/468 variables, 91/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 180/648 variables, 80/260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 160/808 variables, 76/336 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/808 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 53/861 variables, 38/374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/861 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 12/873 variables, 7/381 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 4/877 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/877 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/877 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 384 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1069 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 70/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 169/253 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 215/468 variables, 91/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 180/648 variables, 80/269 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 160/808 variables, 76/345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/808 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 53/861 variables, 38/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/861 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 12/873 variables, 7/390 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 4/877 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/877 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/877 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 393 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1814 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2957ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 5 properties in 1286 ms.
Support contains 9 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 498/498 transitions.
Graph (trivial) has 380 edges and 379 vertex of which 129 / 379 are part of one of the 14 SCC in 4 ms
Free SCC test removed 115 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Graph (complete) has 704 edges and 264 vertex of which 257 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 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 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 257 transition count 236
Reduce places removed 108 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 111 rules applied. Total rules applied 226 place count 149 transition count 233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 228 place count 147 transition count 233
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 228 place count 147 transition count 213
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 268 place count 127 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 270 place count 125 transition count 211
Iterating global reduction 3 with 2 rules applied. Total rules applied 272 place count 125 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 272 place count 125 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 276 place count 123 transition count 209
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
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 346 place count 88 transition count 174
Performed 15 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 376 place count 73 transition count 215
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 386 place count 73 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 406 place count 73 transition count 185
Free-agglomeration rule applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 421 place count 73 transition count 170
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 447 place count 58 transition count 159
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 450 place count 55 transition count 152
Iterating global reduction 5 with 3 rules applied. Total rules applied 453 place count 55 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 455 place count 55 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 459 place count 55 transition count 146
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 461 place count 55 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 464 place count 55 transition count 143
Applied a total of 464 rules in 90 ms. Remains 55 /379 variables (removed 324) and now considering 143/498 (removed 355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 55/379 places, 143/498 transitions.
RANDOM walk for 40000 steps (1261 resets) in 456 ms. (87 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (260 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-05-23 11:45:34] [INFO ] Flow matrix only has 114 transitions (discarded 29 similar events)
// Phase 1: matrix 114 rows 55 cols
[2024-05-23 11:45:34] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 11:45:34] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/130 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/167 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/168 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/169 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/169 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/169 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 38/38 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) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/130 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/167 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/168 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/169 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/169 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 143/143 transitions.
Graph (trivial) has 29 edges and 55 vertex of which 4 / 55 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 272 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
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 3 place count 52 transition count 136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 52 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 50 transition count 134
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 1 with 4 rules applied. Total rules applied 11 place count 48 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 47 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 47 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 39 place count 47 transition count 108
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 47 transition count 105
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 50 place count 44 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 44 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 43 transition count 93
Applied a total of 57 rules in 29 ms. Remains 43 /55 variables (removed 12) and now considering 93/143 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 43/55 places, 93/143 transitions.
RANDOM walk for 1919 steps (60 resets) in 10 ms. (174 steps per ms) remains 0/1 properties
Computed a total of 59 stabilizing places and 111 stable transitions
Graph (complete) has 886 edges and 379 vertex of which 372 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 374 transition count 493
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 374 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 373 transition count 492
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 373 transition count 492
Applied a total of 12 rules in 18 ms. Remains 373 /379 variables (removed 6) and now considering 492/498 (removed 6) transitions.
// Phase 1: matrix 492 rows 373 cols
[2024-05-23 11:45:34] [INFO ] Computed 5 invariants in 4 ms
[2024-05-23 11:45:34] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-23 11:45:34] [INFO ] Invariant cache hit.
[2024-05-23 11:45:35] [INFO ] Implicit Places using invariants and state equation in 261 ms returned [15, 181, 189]
[2024-05-23 11:45:35] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 353 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 372/379 places, 492/498 transitions.
Applied a total of 0 rules in 4 ms. Remains 372 /372 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 375 ms. Remains : 372/379 places, 492/498 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-00
Product exploration explored 100000 steps with 33243 reset in 251 ms.
Product exploration explored 100000 steps with 33385 reset in 193 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 872 edges and 372 vertex of which 366 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 119 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (654 resets) in 251 ms. (158 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (141 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
// Phase 1: matrix 492 rows 372 cols
[2024-05-23 11:45:36] [INFO ] Computed 4 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/123 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/167 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 225/392 variables, 114/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 191/583 variables, 92/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 164/747 variables, 72/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/747 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 90/837 variables, 56/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/837 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 19/856 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/856 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 863/864 variables, and 375 constraints, problems are : Problem set: 1 solved, 0 unsolved in 236 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 371/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 247ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 301 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 2 out of 372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 372/372 places, 492/492 transitions.
Graph (trivial) has 386 edges and 372 vertex of which 142 / 372 are part of one of the 16 SCC in 2 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (complete) has 702 edges and 246 vertex of which 240 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 239 transition count 248
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 142 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 141 transition count 247
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 198 place count 141 transition count 226
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 240 place count 120 transition count 226
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 314 place count 83 transition count 189
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 338 place count 71 transition count 223
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 350 place count 71 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 375 place count 71 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 376 place count 70 transition count 185
Applied a total of 376 rules in 40 ms. Remains 70 /372 variables (removed 302) and now considering 185/492 (removed 307) transitions.
[2024-05-23 11:45:37] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
// Phase 1: matrix 146 rows 70 cols
[2024-05-23 11:45:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 11:45:37] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-23 11:45:37] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-23 11:45:37] [INFO ] Invariant cache hit.
[2024-05-23 11:45:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 11:45:37] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-23 11:45:37] [INFO ] Redundant transitions in 105 ms returned []
Running 168 sub problems to find dead transitions.
[2024-05-23 11:45:37] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-23 11:45:37] [INFO ] Invariant cache hit.
[2024-05-23 11:45:37] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 145/213 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 2/215 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/216 variables, and 78 constraints, problems are : Problem set: 0 solved, 168 unsolved in 3071 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 145/213 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 2/215 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 155/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/216 variables, and 246 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4180 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 7390ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 7393ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/372 places, 185/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7676 ms. Remains : 70/372 places, 185/492 transitions.
Computed a total of 19 stabilizing places and 98 stable transitions
Computed a total of 19 stabilizing places and 98 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 128 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (4133 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (541 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (536 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (516 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (552 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (558 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (542 resets) in 34 ms. (1142 steps per ms) remains 1/6 properties
[2024-05-23 11:45:45] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-23 11:45:45] [INFO ] Invariant cache hit.
[2024-05-23 11:45:45] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/85 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/91 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 105/196 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 215/216 variables, and 74 constraints, problems are : Problem set: 1 solved, 0 unsolved in 56 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 2/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 325 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 9666 reset in 259 ms.
Product exploration explored 100000 steps with 9711 reset in 292 ms.
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 185/185 transitions.
Applied a total of 0 rules in 5 ms. Remains 70 /70 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-23 11:45:46] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-23 11:45:46] [INFO ] Invariant cache hit.
[2024-05-23 11:45:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-23 11:45:46] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-23 11:45:46] [INFO ] Invariant cache hit.
[2024-05-23 11:45:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 11:45:46] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-23 11:45:46] [INFO ] Redundant transitions in 114 ms returned []
Running 168 sub problems to find dead transitions.
[2024-05-23 11:45:46] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-23 11:45:46] [INFO ] Invariant cache hit.
[2024-05-23 11:45:46] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 145/213 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 2/215 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/216 variables, and 78 constraints, problems are : Problem set: 0 solved, 168 unsolved in 3019 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 145/213 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 2/215 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 155/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/216 variables, and 246 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4380 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 7520ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 7523ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7767 ms. Remains : 70/70 places, 185/185 transitions.
Treatment of property CloudDeployment-PT-2b-LTLFireability-00 finished in 19686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G((p0||X(G(p1)))) U (p0&&G((p0||X(G(p1))))))))))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 374 transition count 493
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 374 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 373 transition count 492
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 373 transition count 492
Applied a total of 12 rules in 17 ms. Remains 373 /379 variables (removed 6) and now considering 492/498 (removed 6) transitions.
// Phase 1: matrix 492 rows 373 cols
[2024-05-23 11:45:54] [INFO ] Computed 5 invariants in 3 ms
[2024-05-23 11:45:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-23 11:45:54] [INFO ] Invariant cache hit.
[2024-05-23 11:45:54] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [15, 181, 189]
[2024-05-23 11:45:54] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 340 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 372/379 places, 492/498 transitions.
Applied a total of 0 rules in 4 ms. Remains 372 /372 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 372/379 places, 492/498 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-02 finished in 627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0&&F(p1))))))))'
Support contains 3 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 375 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 375 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 374 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 374 transition count 493
Applied a total of 10 rules in 16 ms. Remains 374 /379 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 374 cols
[2024-05-23 11:45:55] [INFO ] Computed 5 invariants in 4 ms
[2024-05-23 11:45:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-23 11:45:55] [INFO ] Invariant cache hit.
[2024-05-23 11:45:55] [INFO ] Implicit Places using invariants and state equation in 257 ms returned [15, 181, 189]
[2024-05-23 11:45:55] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 339 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 373/379 places, 493/498 transitions.
Applied a total of 0 rules in 6 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 373/379 places, 493/498 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-05
Product exploration explored 100000 steps with 20000 reset in 141 ms.
Product exploration explored 100000 steps with 20000 reset in 149 ms.
Computed a total of 56 stabilizing places and 108 stable transitions
Graph (complete) has 873 edges and 373 vertex of which 367 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 56 stabilizing places and 108 stable transitions
Detected a total of 56/373 stabilizing places and 108/493 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (602 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (137 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (138 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (142 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1202649 steps, run timeout after 3001 ms. (steps per millisecond=400 ) properties seen :2 out of 3
Probabilistic random walk after 1202649 steps, saw 250515 distinct states, run finished after 3004 ms. (steps per millisecond=400 ) properties seen :2
// Phase 1: matrix 493 rows 373 cols
[2024-05-23 11:45:59] [INFO ] Computed 4 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 96/100 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/145 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/376 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 196/572 variables, 93/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/744 variables, 74/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/744 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 95/839 variables, 60/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/839 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/858 variables, 12/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/858 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/865 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/865 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/866 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/866 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/866 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 866/866 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 373/373 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) 96/100 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/145 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 231/376 variables, 116/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 196/572 variables, 93/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 172/744 variables, 74/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/744 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 95/839 variables, 60/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/839 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 19/858 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/858 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/865 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/865 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/866 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/866 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/866 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 866/866 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 479ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 493/493 transitions.
Graph (trivial) has 390 edges and 373 vertex of which 142 / 373 are part of one of the 16 SCC in 2 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Graph (complete) has 653 edges and 247 vertex of which 241 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 241 transition count 219
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 216 place count 137 transition count 219
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 216 place count 137 transition count 197
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 260 place count 115 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 262 place count 113 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 113 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 264 place count 113 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 111 transition count 193
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 332 place count 79 transition count 161
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 360 place count 65 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 374 place count 65 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 406 place count 65 transition count 151
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 426 place count 65 transition count 129
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 225 edges and 45 vertex of which 44 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 43 rules applied. Total rules applied 469 place count 44 transition count 107
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 470 place count 44 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 472 place count 42 transition count 100
Iterating global reduction 5 with 2 rules applied. Total rules applied 474 place count 42 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 486 place count 42 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 487 place count 41 transition count 87
Applied a total of 487 rules in 60 ms. Remains 41 /373 variables (removed 332) and now considering 87/493 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 41/373 places, 87/493 transitions.
RANDOM walk for 579 steps (15 resets) in 4 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 493/493 transitions.
Applied a total of 0 rules in 10 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2024-05-23 11:46:00] [INFO ] Invariant cache hit.
[2024-05-23 11:46:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 11:46:00] [INFO ] Invariant cache hit.
[2024-05-23 11:46:00] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [180, 188]
[2024-05-23 11:46:00] [INFO ] Actually due to overlaps returned [180]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 342 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 372/373 places, 493/493 transitions.
Applied a total of 0 rules in 5 ms. Remains 372 /372 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 358 ms. Remains : 372/373 places, 493/493 transitions.
Computed a total of 56 stabilizing places and 108 stable transitions
Graph (complete) has 865 edges and 372 vertex of which 367 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 56 stabilizing places and 108 stable transitions
Detected a total of 56/372 stabilizing places and 108/493 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (639 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (141 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (135 resets) in 20 ms. (1904 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (150 resets) in 22 ms. (1739 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1319011 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :2 out of 3
Probabilistic random walk after 1319011 steps, saw 269458 distinct states, run finished after 3001 ms. (steps per millisecond=439 ) properties seen :2
// Phase 1: matrix 493 rows 372 cols
[2024-05-23 11:46:04] [INFO ] Computed 3 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 96/100 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/139 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 235/374 variables, 114/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 197/571 variables, 94/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/743 variables, 74/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/743 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 95/838 variables, 60/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/838 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/857 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/857 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/864 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/864 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/865 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/865 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/865 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 372/372 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) 96/100 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/139 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 235/374 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 197/571 variables, 94/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 172/743 variables, 74/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/743 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 95/838 variables, 60/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/838 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 19/857 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/857 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/864 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/864 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/865 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/865 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/865 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 477ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 493/493 transitions.
Graph (trivial) has 389 edges and 372 vertex of which 142 / 372 are part of one of the 16 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 165 transitions
Reduce isomorphic transitions removed 165 transitions.
Graph (complete) has 645 edges and 246 vertex of which 241 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 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 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 241 transition count 219
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 215 place count 137 transition count 219
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 215 place count 137 transition count 197
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 259 place count 115 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 261 place count 113 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 113 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 263 place count 113 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 267 place count 111 transition count 193
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 331 place count 79 transition count 161
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 359 place count 65 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 373 place count 65 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 405 place count 65 transition count 151
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 425 place count 65 transition count 129
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 225 edges and 45 vertex of which 44 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 43 rules applied. Total rules applied 468 place count 44 transition count 107
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 469 place count 44 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 471 place count 42 transition count 100
Iterating global reduction 5 with 2 rules applied. Total rules applied 473 place count 42 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 485 place count 42 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 486 place count 41 transition count 87
Applied a total of 486 rules in 33 ms. Remains 41 /372 variables (removed 331) and now considering 87/493 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 41/372 places, 87/493 transitions.
RANDOM walk for 615 steps (17 resets) in 5 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 107 ms.
Product exploration explored 100000 steps with 20000 reset in 111 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 372/372 places, 493/493 transitions.
Graph (trivial) has 385 edges and 372 vertex of which 133 / 372 are part of one of the 15 SCC in 3 ms
Free SCC test removed 118 places
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Graph (complete) has 711 edges and 254 vertex of which 249 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 249 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 249 transition count 355
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 108 place count 249 transition count 368
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 123 place count 249 transition count 368
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 179 place count 193 transition count 312
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 235 place count 193 transition count 312
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 276 place count 193 transition count 312
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 307 place count 162 transition count 281
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 338 place count 162 transition count 281
Performed 15 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 353 place count 162 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 355 place count 162 transition count 369
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 372 place count 145 transition count 315
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 389 place count 145 transition count 315
Deduced a syphon composed of 72 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 419 place count 145 transition count 285
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 423 place count 141 transition count 281
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 427 place count 141 transition count 281
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 70 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 429 place count 141 transition count 311
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 433 place count 137 transition count 295
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 437 place count 137 transition count 295
Deduced a syphon composed of 66 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 450 place count 137 transition count 282
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 450 rules in 57 ms. Remains 137 /372 variables (removed 235) and now considering 282/493 (removed 211) transitions.
[2024-05-23 11:46:06] [INFO ] Redundant transitions in 109 ms returned []
Running 281 sub problems to find dead transitions.
[2024-05-23 11:46:06] [INFO ] Flow matrix only has 248 transitions (discarded 34 similar events)
// Phase 1: matrix 248 rows 137 cols
[2024-05-23 11:46:06] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 11:46:06] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 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 TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 2 (OVERLAPS) 247/383 variables, 136/138 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 28/166 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/166 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 1/384 variables, 1/167 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/167 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 1/385 variables, 1/168 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/168 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 0/385 variables, 0/168 constraints. Problems are: Problem set: 90 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 168 constraints, problems are : Problem set: 90 solved, 191 unsolved in 9153 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 137/137 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 90 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 6/76 variables, 2/2 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 241/317 variables, 76/78 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 28/106 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 191/297 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/297 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 67/384 variables, 61/358 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/358 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 1/385 variables, 1/359 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/359 constraints. Problems are: Problem set: 90 solved, 191 unsolved
At refinement iteration 11 (OVERLAPS) 0/385 variables, 0/359 constraints. Problems are: Problem set: 90 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 359 constraints, problems are : Problem set: 90 solved, 191 unsolved in 11972 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 137/137 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 191/281 constraints, Known Traps: 0/0 constraints]
After SMT, in 21296ms problems are : Problem set: 90 solved, 191 unsolved
Search for dead transitions found 90 dead transitions in 21301ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 137/372 places, 192/493 transitions.
Graph (complete) has 478 edges and 137 vertex of which 71 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.2 ms
Discarding 66 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 71 /137 variables (removed 66) and now considering 192/192 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/372 places, 192/493 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21486 ms. Remains : 71/372 places, 192/493 transitions.
Support contains 3 out of 372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 493/493 transitions.
Applied a total of 0 rules in 9 ms. Remains 372 /372 variables (removed 0) and now considering 493/493 (removed 0) transitions.
// Phase 1: matrix 493 rows 372 cols
[2024-05-23 11:46:27] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 11:46:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-23 11:46:27] [INFO ] Invariant cache hit.
[2024-05-23 11:46:28] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [187]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 300 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 371/372 places, 493/493 transitions.
Applied a total of 0 rules in 13 ms. Remains 371 /371 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 323 ms. Remains : 371/372 places, 493/493 transitions.
Treatment of property CloudDeployment-PT-2b-LTLFireability-05 finished in 33107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 6 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 374 transition count 493
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 374 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 373 transition count 492
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 373 transition count 492
Applied a total of 12 rules in 28 ms. Remains 373 /379 variables (removed 6) and now considering 492/498 (removed 6) transitions.
// Phase 1: matrix 492 rows 373 cols
[2024-05-23 11:46:28] [INFO ] Computed 5 invariants in 5 ms
[2024-05-23 11:46:28] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-23 11:46:28] [INFO ] Invariant cache hit.
[2024-05-23 11:46:28] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [15, 181, 189]
[2024-05-23 11:46:28] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 336 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 372/379 places, 492/498 transitions.
Applied a total of 0 rules in 4 ms. Remains 372 /372 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 371 ms. Remains : 372/379 places, 492/498 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-08 finished in 572 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 (p1||G(p0))))))))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 375 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 375 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 374 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 374 transition count 493
Applied a total of 10 rules in 20 ms. Remains 374 /379 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 374 cols
[2024-05-23 11:46:28] [INFO ] Computed 5 invariants in 6 ms
[2024-05-23 11:46:28] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-23 11:46:28] [INFO ] Invariant cache hit.
[2024-05-23 11:46:29] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [15, 181, 189]
[2024-05-23 11:46:29] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 352 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 373/379 places, 493/498 transitions.
Applied a total of 0 rules in 7 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 380 ms. Remains : 373/379 places, 493/498 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-10
Product exploration explored 100000 steps with 33330 reset in 138 ms.
Product exploration explored 100000 steps with 33430 reset in 145 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 873 edges and 373 vertex of which 367 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 177 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (626 resets) in 74 ms. (533 steps per ms) remains 1/4 properties
BEST_FIRST walk for 4486 steps (11 resets) in 4 ms. (897 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 231 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 493/493 transitions.
Applied a total of 0 rules in 4 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
// Phase 1: matrix 493 rows 373 cols
[2024-05-23 11:46:30] [INFO ] Computed 4 invariants in 5 ms
[2024-05-23 11:46:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 11:46:30] [INFO ] Invariant cache hit.
[2024-05-23 11:46:30] [INFO ] Implicit Places using invariants and state equation in 238 ms returned [180, 188]
[2024-05-23 11:46:30] [INFO ] Actually due to overlaps returned [180]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 372/373 places, 493/493 transitions.
Applied a total of 0 rules in 6 ms. Remains 372 /372 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 335 ms. Remains : 372/373 places, 493/493 transitions.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 865 edges and 372 vertex of which 367 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (614 resets) in 81 ms. (487 steps per ms) remains 1/4 properties
BEST_FIRST walk for 4339 steps (10 resets) in 7 ms. (542 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33531 reset in 123 ms.
Product exploration explored 100000 steps with 33374 reset in 139 ms.
Support contains 2 out of 372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 493/493 transitions.
Applied a total of 0 rules in 9 ms. Remains 372 /372 variables (removed 0) and now considering 493/493 (removed 0) transitions.
// Phase 1: matrix 493 rows 372 cols
[2024-05-23 11:46:31] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 11:46:31] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 11:46:31] [INFO ] Invariant cache hit.
[2024-05-23 11:46:32] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [187]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 371/372 places, 493/493 transitions.
Applied a total of 0 rules in 6 ms. Remains 371 /371 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 322 ms. Remains : 371/372 places, 493/493 transitions.
Treatment of property CloudDeployment-PT-2b-LTLFireability-10 finished in 3495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F((p1||G(p2)))))))'
Support contains 3 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 375 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 375 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 374 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 374 transition count 493
Applied a total of 10 rules in 16 ms. Remains 374 /379 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 374 cols
[2024-05-23 11:46:32] [INFO ] Computed 5 invariants in 4 ms
[2024-05-23 11:46:32] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-23 11:46:32] [INFO ] Invariant cache hit.
[2024-05-23 11:46:32] [INFO ] Implicit Places using invariants and state equation in 276 ms returned [15, 181, 189]
[2024-05-23 11:46:32] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 357 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 373/379 places, 493/498 transitions.
Applied a total of 0 rules in 6 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 381 ms. Remains : 373/379 places, 493/498 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 873 edges and 373 vertex of which 367 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-2b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-2b-LTLFireability-11 finished in 894 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((p0&&G(F(p0))))))'
Support contains 1 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 375 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 375 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 374 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 374 transition count 493
Applied a total of 10 rules in 18 ms. Remains 374 /379 variables (removed 5) and now considering 493/498 (removed 5) transitions.
[2024-05-23 11:46:33] [INFO ] Invariant cache hit.
[2024-05-23 11:46:33] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 11:46:33] [INFO ] Invariant cache hit.
[2024-05-23 11:46:33] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [15, 181, 189]
[2024-05-23 11:46:33] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 354 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 373/379 places, 493/498 transitions.
Applied a total of 0 rules in 6 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 378 ms. Remains : 373/379 places, 493/498 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-12
Product exploration explored 100000 steps with 1570 reset in 117 ms.
Product exploration explored 100000 steps with 1569 reset in 129 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 873 edges and 373 vertex of which 367 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (620 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (144 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 169457 steps, run visited all 1 properties in 408 ms. (steps per millisecond=415 )
Probabilistic random walk after 169457 steps, saw 39867 distinct states, run finished after 412 ms. (steps per millisecond=411 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 191 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 373 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 373/373 places, 493/493 transitions.
Graph (trivial) has 389 edges and 373 vertex of which 142 / 373 are part of one of the 16 SCC in 1 ms
Free SCC test removed 126 places
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Graph (complete) has 704 edges and 247 vertex of which 241 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 240 transition count 246
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 204 place count 139 transition count 246
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 204 place count 139 transition count 225
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 246 place count 118 transition count 225
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 320 place count 81 transition count 188
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 344 place count 69 transition count 222
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 356 place count 69 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 381 place count 69 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 382 place count 68 transition count 184
Applied a total of 382 rules in 30 ms. Remains 68 /373 variables (removed 305) and now considering 184/493 (removed 309) transitions.
[2024-05-23 11:46:34] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
// Phase 1: matrix 145 rows 68 cols
[2024-05-23 11:46:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 11:46:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-23 11:46:34] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-23 11:46:34] [INFO ] Invariant cache hit.
[2024-05-23 11:46:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 11:46:35] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-23 11:46:35] [INFO ] Redundant transitions in 91 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-23 11:46:35] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-23 11:46:35] [INFO ] Invariant cache hit.
[2024-05-23 11:46:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/210 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 2/212 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/213 variables, and 76 constraints, problems are : Problem set: 0 solved, 167 unsolved in 3045 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/210 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 2/212 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 156/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/213 variables, and 243 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4472 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 7621ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 7623ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/373 places, 184/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7870 ms. Remains : 68/373 places, 184/493 transitions.
Computed a total of 19 stabilizing places and 98 stable transitions
Computed a total of 19 stabilizing places and 98 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36717 steps (3800 resets) in 63 ms. (573 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9714 reset in 131 ms.
Product exploration explored 100000 steps with 9730 reset in 140 ms.
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2024-05-23 11:46:43] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-23 11:46:43] [INFO ] Invariant cache hit.
[2024-05-23 11:46:43] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-23 11:46:43] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-23 11:46:43] [INFO ] Invariant cache hit.
[2024-05-23 11:46:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 11:46:43] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-23 11:46:43] [INFO ] Redundant transitions in 97 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-23 11:46:43] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-23 11:46:43] [INFO ] Invariant cache hit.
[2024-05-23 11:46:43] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/210 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 2/212 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/213 variables, and 76 constraints, problems are : Problem set: 0 solved, 167 unsolved in 3031 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/210 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 2/212 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 156/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/213 variables, and 243 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4391 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 7523ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 7528ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7754 ms. Remains : 68/68 places, 184/184 transitions.
Treatment of property CloudDeployment-PT-2b-LTLFireability-12 finished in 18321 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 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Graph (trivial) has 395 edges and 379 vertex of which 143 / 379 are part of one of the 16 SCC in 0 ms
Free SCC test removed 127 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 715 edges and 252 vertex of which 245 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 244 transition count 246
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 211 place count 140 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 139 transition count 245
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 212 place count 139 transition count 226
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 250 place count 120 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 251 place count 119 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 252 place count 119 transition count 225
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 326 place count 82 transition count 188
Performed 12 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 350 place count 70 transition count 216
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 356 place count 70 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 381 place count 70 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 382 place count 69 transition count 184
Applied a total of 382 rules in 20 ms. Remains 69 /379 variables (removed 310) and now considering 184/498 (removed 314) transitions.
[2024-05-23 11:46:51] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
// Phase 1: matrix 145 rows 69 cols
[2024-05-23 11:46:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 11:46:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-23 11:46:51] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-23 11:46:51] [INFO ] Invariant cache hit.
[2024-05-23 11:46:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 11:46:51] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-23 11:46:51] [INFO ] Redundant transitions in 91 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-23 11:46:51] [INFO ] Flow matrix only has 145 transitions (discarded 39 similar events)
[2024-05-23 11:46:51] [INFO ] Invariant cache hit.
[2024-05-23 11:46:51] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/211 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 2/213 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/214 variables, and 77 constraints, problems are : Problem set: 0 solved, 167 unsolved in 3069 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 144/211 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 2/213 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 155/244 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/214 variables, and 244 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4311 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 7471ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 7473ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/379 places, 184/498 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7704 ms. Remains : 69/379 places, 184/498 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-13 finished in 7808 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 6 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Graph (trivial) has 385 edges and 379 vertex of which 134 / 379 are part of one of the 15 SCC in 0 ms
Free SCC test removed 119 places
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (complete) has 731 edges and 260 vertex of which 253 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 253 transition count 254
Reduce places removed 106 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 109 rules applied. Total rules applied 217 place count 147 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 219 place count 145 transition count 251
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 219 place count 145 transition count 232
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 257 place count 126 transition count 232
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 258 place count 125 transition count 231
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 125 transition count 231
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 339 place count 85 transition count 191
Performed 12 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 363 place count 73 transition count 220
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 369 place count 73 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 388 place count 73 transition count 195
Applied a total of 388 rules in 25 ms. Remains 73 /379 variables (removed 306) and now considering 195/498 (removed 303) transitions.
[2024-05-23 11:46:59] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
// Phase 1: matrix 157 rows 73 cols
[2024-05-23 11:46:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 11:46:59] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 11:46:59] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-23 11:46:59] [INFO ] Invariant cache hit.
[2024-05-23 11:46:59] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-23 11:46:59] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-23 11:46:59] [INFO ] Redundant transitions in 102 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-23 11:46:59] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-23 11:46:59] [INFO ] Invariant cache hit.
[2024-05-23 11:46:59] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 156/228 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 1/229 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 103 constraints, problems are : Problem set: 0 solved, 194 unsolved in 5756 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 156/228 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 194/295 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 1/229 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/230 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 297 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9109 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 14996ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 14998ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/379 places, 195/498 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15262 ms. Remains : 73/379 places, 195/498 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-14
Product exploration explored 100000 steps with 7470 reset in 161 ms.
Product exploration explored 100000 steps with 7519 reset in 165 ms.
Computed a total of 23 stabilizing places and 102 stable transitions
Computed a total of 23 stabilizing places and 102 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3134 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (343 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2948515 steps, run timeout after 3001 ms. (steps per millisecond=982 ) properties seen :0 out of 1
Probabilistic random walk after 2948515 steps, saw 432677 distinct states, run finished after 3001 ms. (steps per millisecond=982 ) properties seen :0
[2024-05-23 11:47:17] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-23 11:47:17] [INFO ] Invariant cache hit.
[2024-05-23 11:47:17] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 114/217 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/229 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/230 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 114/217 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/229 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/230 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/230 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 825 steps, including 72 resets, run visited all 1 properties in 5 ms. (steps per millisecond=165 )
Parikh walk visited 1 properties in 14 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 195/195 transitions.
Applied a total of 0 rules in 7 ms. Remains 73 /73 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2024-05-23 11:47:18] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-23 11:47:18] [INFO ] Invariant cache hit.
[2024-05-23 11:47:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 11:47:18] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-23 11:47:18] [INFO ] Invariant cache hit.
[2024-05-23 11:47:18] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-23 11:47:18] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-23 11:47:18] [INFO ] Redundant transitions in 103 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-23 11:47:18] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-23 11:47:18] [INFO ] Invariant cache hit.
[2024-05-23 11:47:18] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 156/228 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 1/229 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 103 constraints, problems are : Problem set: 0 solved, 194 unsolved in 5813 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 156/228 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 194/295 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 1/229 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/230 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 297 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9104 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 15037ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 15039ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15285 ms. Remains : 73/73 places, 195/195 transitions.
Computed a total of 23 stabilizing places and 102 stable transitions
Computed a total of 23 stabilizing places and 102 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3164 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (360 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3036175 steps, run timeout after 3001 ms. (steps per millisecond=1011 ) properties seen :0 out of 1
Probabilistic random walk after 3036175 steps, saw 444539 distinct states, run finished after 3003 ms. (steps per millisecond=1011 ) properties seen :0
[2024-05-23 11:47:36] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-23 11:47:36] [INFO ] Invariant cache hit.
[2024-05-23 11:47:36] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 114/217 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/229 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/230 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 114/217 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/229 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/230 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/230 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 337 steps, including 27 resets, run visited all 1 properties in 3 ms. (steps per millisecond=112 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7504 reset in 153 ms.
Product exploration explored 100000 steps with 7440 reset in 158 ms.
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 195/195 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2024-05-23 11:47:37] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-23 11:47:37] [INFO ] Invariant cache hit.
[2024-05-23 11:47:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-23 11:47:37] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-23 11:47:37] [INFO ] Invariant cache hit.
[2024-05-23 11:47:37] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-23 11:47:37] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-23 11:47:37] [INFO ] Redundant transitions in 114 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-23 11:47:37] [INFO ] Flow matrix only has 157 transitions (discarded 38 similar events)
[2024-05-23 11:47:37] [INFO ] Invariant cache hit.
[2024-05-23 11:47:37] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 156/228 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 1/229 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 103 constraints, problems are : Problem set: 0 solved, 194 unsolved in 5843 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 156/228 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 194/295 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 1/229 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/230 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/230 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 297 constraints, problems are : Problem set: 0 solved, 194 unsolved in 8944 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 14901ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 14903ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15153 ms. Remains : 73/73 places, 195/195 transitions.
Treatment of property CloudDeployment-PT-2b-LTLFireability-14 finished in 53587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(X(p1)||G(p2))))))'
Support contains 7 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 375 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 375 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 374 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 374 transition count 493
Applied a total of 10 rules in 19 ms. Remains 374 /379 variables (removed 5) and now considering 493/498 (removed 5) transitions.
// Phase 1: matrix 493 rows 374 cols
[2024-05-23 11:47:52] [INFO ] Computed 5 invariants in 3 ms
[2024-05-23 11:47:52] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-23 11:47:52] [INFO ] Invariant cache hit.
[2024-05-23 11:47:53] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [15, 181, 189]
[2024-05-23 11:47:53] [INFO ] Actually due to overlaps returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 307 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 373/379 places, 493/498 transitions.
Applied a total of 0 rules in 5 ms. Remains 373 /373 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 331 ms. Remains : 373/379 places, 493/498 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-15
Stuttering criterion allowed to conclude after 52 steps with 1 reset in 1 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-15 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Found a Lengthening insensitive property : CloudDeployment-PT-2b-LTLFireability-00
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Graph (trivial) has 393 edges and 379 vertex of which 143 / 379 are part of one of the 16 SCC in 1 ms
Free SCC test removed 127 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 715 edges and 252 vertex of which 245 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 105 place count 244 transition count 247
Reduce places removed 103 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 104 rules applied. Total rules applied 209 place count 141 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 140 transition count 246
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 210 place count 140 transition count 227
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 248 place count 121 transition count 227
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 120 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 120 transition count 226
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 324 place count 83 transition count 189
Performed 12 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 348 place count 71 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 354 place count 71 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 356 place count 71 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 357 place count 70 transition count 208
Applied a total of 357 rules in 23 ms. Remains 70 /379 variables (removed 309) and now considering 208/498 (removed 290) transitions.
[2024-05-23 11:47:53] [INFO ] Flow matrix only has 169 transitions (discarded 39 similar events)
// Phase 1: matrix 169 rows 70 cols
[2024-05-23 11:47:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 11:47:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-23 11:47:53] [INFO ] Flow matrix only has 169 transitions (discarded 39 similar events)
[2024-05-23 11:47:53] [INFO ] Invariant cache hit.
[2024-05-23 11:47:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 11:47:53] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-23 11:47:53] [INFO ] Flow matrix only has 169 transitions (discarded 39 similar events)
[2024-05-23 11:47:53] [INFO ] Invariant cache hit.
[2024-05-23 11:47:53] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 168/236 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/238 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/239 variables, and 80 constraints, problems are : Problem set: 0 solved, 191 unsolved in 3714 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 168/236 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 2/238 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 178/271 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 0/238 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/239 variables, and 271 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5216 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 9055ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 9058ms
Starting structural reductions in LI_LTL mode, iteration 1 : 70/379 places, 208/498 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9199 ms. Remains : 70/379 places, 208/498 transitions.
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-00
Product exploration explored 100000 steps with 33597 reset in 166 ms.
Product exploration explored 100000 steps with 33569 reset in 173 ms.
Computed a total of 19 stabilizing places and 119 stable transitions
Computed a total of 19 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 125 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (4189 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (549 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (540 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (535 resets) in 25 ms. (1538 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (525 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (538 resets) in 25 ms. (1538 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (534 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 2927115 steps, run timeout after 3001 ms. (steps per millisecond=975 ) properties seen :5 out of 6
Probabilistic random walk after 2927115 steps, saw 442353 distinct states, run finished after 3001 ms. (steps per millisecond=975 ) properties seen :5
[2024-05-23 11:48:06] [INFO ] Flow matrix only has 169 transitions (discarded 39 similar events)
[2024-05-23 11:48:06] [INFO ] Invariant cache hit.
[2024-05-23 11:48:06] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/99 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/105 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 120/225 variables, 44/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 238/239 variables, and 80 constraints, problems are : Problem set: 1 solved, 0 unsolved in 68 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 309 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 208/208 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 70 transition count 185
Applied a total of 23 rules in 5 ms. Remains 70 /70 variables (removed 0) and now considering 185/208 (removed 23) transitions.
[2024-05-23 11:48:07] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
// Phase 1: matrix 146 rows 70 cols
[2024-05-23 11:48:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 11:48:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-23 11:48:07] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-23 11:48:07] [INFO ] Invariant cache hit.
[2024-05-23 11:48:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 11:48:07] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-23 11:48:07] [INFO ] Redundant transitions in 93 ms returned []
Running 168 sub problems to find dead transitions.
[2024-05-23 11:48:07] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-23 11:48:07] [INFO ] Invariant cache hit.
[2024-05-23 11:48:07] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 145/213 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 2/215 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/216 variables, and 78 constraints, problems are : Problem set: 0 solved, 168 unsolved in 3011 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 145/213 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 2/215 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 155/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/216 variables, and 246 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4405 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 7509ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 7510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/70 places, 185/208 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7735 ms. Remains : 70/70 places, 185/208 transitions.
Computed a total of 19 stabilizing places and 98 stable transitions
Computed a total of 19 stabilizing places and 98 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 122 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (4148 resets) in 139 ms. (285 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (555 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-05-23 11:48:15] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2024-05-23 11:48:15] [INFO ] Invariant cache hit.
[2024-05-23 11:48:15] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/85 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/91 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 105/196 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 215/216 variables, and 74 constraints, problems are : Problem set: 1 solved, 0 unsolved in 57 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 2/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 300 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND p1 (NOT p0)), true, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 9735 reset in 165 ms.
Stuttering criterion allowed to conclude after 62137 steps with 6073 reset in 109 ms.
Treatment of property CloudDeployment-PT-2b-LTLFireability-00 finished in 22924 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0&&F(p1))))))))'
Found a Shortening insensitive property : CloudDeployment-PT-2b-LTLFireability-05
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 379 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Graph (trivial) has 392 edges and 379 vertex of which 134 / 379 are part of one of the 15 SCC in 0 ms
Free SCC test removed 119 places
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (complete) has 731 edges and 260 vertex of which 253 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 252 transition count 250
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 143 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 142 transition count 248
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 223 place count 142 transition count 228
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 263 place count 122 transition count 228
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 341 place count 83 transition count 189
Performed 12 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 365 place count 71 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 371 place count 71 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 372 place count 71 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 373 place count 70 transition count 209
Applied a total of 373 rules in 22 ms. Remains 70 /379 variables (removed 309) and now considering 209/498 (removed 289) transitions.
[2024-05-23 11:48:16] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
// Phase 1: matrix 175 rows 70 cols
[2024-05-23 11:48:16] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 11:48:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-23 11:48:16] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
[2024-05-23 11:48:16] [INFO ] Invariant cache hit.
[2024-05-23 11:48:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 11:48:16] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-23 11:48:16] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
[2024-05-23 11:48:16] [INFO ] Invariant cache hit.
[2024-05-23 11:48:16] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 174/241 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 3/244 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/245 variables, and 80 constraints, problems are : Problem set: 0 solved, 196 unsolved in 3937 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 174/241 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 3/244 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 186/276 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/244 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/245 variables, and 276 constraints, problems are : Problem set: 0 solved, 196 unsolved in 5673 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 9744ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 9746ms
Starting structural reductions in LI_LTL mode, iteration 1 : 70/379 places, 209/498 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9896 ms. Remains : 70/379 places, 209/498 transitions.
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-05
Product exploration explored 100000 steps with 20000 reset in 136 ms.
Product exploration explored 100000 steps with 20000 reset in 142 ms.
Computed a total of 19 stabilizing places and 118 stable transitions
Computed a total of 19 stabilizing places and 118 stable transitions
Detected a total of 19/70 stabilizing places and 118/209 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3592 resets) in 98 ms. (404 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (476 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-05-23 11:48:27] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
[2024-05-23 11:48:27] [INFO ] Invariant cache hit.
[2024-05-23 11:48:27] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 113/117 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/123 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 114/237 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/244 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/244 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/245 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 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) 113/117 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/123 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 114/237 variables, 52/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/244 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/244 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/245 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 44 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 209/209 transitions.
Applied a total of 0 rules in 0 ms. Remains 70 /70 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2024-05-23 11:48:27] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
[2024-05-23 11:48:27] [INFO ] Invariant cache hit.
[2024-05-23 11:48:27] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-23 11:48:27] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
[2024-05-23 11:48:27] [INFO ] Invariant cache hit.
[2024-05-23 11:48:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 11:48:28] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-23 11:48:28] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
[2024-05-23 11:48:28] [INFO ] Invariant cache hit.
[2024-05-23 11:48:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 174/241 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 3/244 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/245 variables, and 80 constraints, problems are : Problem set: 0 solved, 196 unsolved in 3852 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 174/241 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 3/244 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 186/276 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/244 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/245 variables, and 276 constraints, problems are : Problem set: 0 solved, 196 unsolved in 5518 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 9508ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 9510ms
Finished structural reductions in LTL mode , in 1 iterations and 9634 ms. Remains : 70/70 places, 209/209 transitions.
Computed a total of 19 stabilizing places and 118 stable transitions
Computed a total of 19 stabilizing places and 118 stable transitions
Detected a total of 19/70 stabilizing places and 118/209 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3548 resets) in 86 ms. (459 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (493 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
[2024-05-23 11:48:37] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
[2024-05-23 11:48:37] [INFO ] Invariant cache hit.
[2024-05-23 11:48:37] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 113/117 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/123 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 114/237 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/244 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/244 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/245 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 65 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 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) 113/117 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/123 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 114/237 variables, 52/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/244 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/244 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/245 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 202 steps, including 33 resets, run visited all 1 properties in 2 ms. (steps per millisecond=101 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 133 ms.
Product exploration explored 100000 steps with 20000 reset in 135 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 209/209 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 70 transition count 193
Applied a total of 16 rules in 4 ms. Remains 70 /70 variables (removed 0) and now considering 193/209 (removed 16) transitions.
[2024-05-23 11:48:39] [INFO ] Redundant transitions in 116 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-23 11:48:39] [INFO ] Flow matrix only has 159 transitions (discarded 34 similar events)
// Phase 1: matrix 159 rows 70 cols
[2024-05-23 11:48:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 11:48:39] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 158/225 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 3/228 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/229 variables, and 78 constraints, problems are : Problem set: 0 solved, 180 unsolved in 3232 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 158/225 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 3/228 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 170/258 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/228 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/229 variables, and 258 constraints, problems are : Problem set: 0 solved, 180 unsolved in 4766 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
After SMT, in 8108ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 8110ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/70 places, 193/209 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8235 ms. Remains : 70/70 places, 193/209 transitions.
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 209/209 transitions.
Applied a total of 0 rules in 0 ms. Remains 70 /70 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2024-05-23 11:48:47] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
// Phase 1: matrix 175 rows 70 cols
[2024-05-23 11:48:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 11:48:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-23 11:48:47] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
[2024-05-23 11:48:47] [INFO ] Invariant cache hit.
[2024-05-23 11:48:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 11:48:47] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-23 11:48:47] [INFO ] Flow matrix only has 175 transitions (discarded 34 similar events)
[2024-05-23 11:48:47] [INFO ] Invariant cache hit.
[2024-05-23 11:48:47] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 174/241 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 3/244 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/245 variables, and 80 constraints, problems are : Problem set: 0 solved, 196 unsolved in 3796 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 174/241 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 3/244 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 186/276 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/244 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/245 variables, and 276 constraints, problems are : Problem set: 0 solved, 196 unsolved in 5236 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 9163ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 9167ms
Finished structural reductions in LTL mode , in 1 iterations and 9287 ms. Remains : 70/70 places, 209/209 transitions.
Treatment of property CloudDeployment-PT-2b-LTLFireability-05 finished in 40845 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 (p1||G(p0))))))))'
Found a Shortening insensitive property : CloudDeployment-PT-2b-LTLFireability-10
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 379/379 places, 498/498 transitions.
Graph (trivial) has 392 edges and 379 vertex of which 143 / 379 are part of one of the 16 SCC in 1 ms
Free SCC test removed 127 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 715 edges and 252 vertex of which 245 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 244 transition count 244
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 214 place count 138 transition count 244
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 214 place count 138 transition count 226
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 250 place count 120 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 251 place count 119 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 252 place count 119 transition count 225
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
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 324 place count 83 transition count 189
Performed 12 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 348 place count 71 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 354 place count 71 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 356 place count 71 transition count 209
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 357 place count 71 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 358 place count 70 transition count 208
Applied a total of 358 rules in 19 ms. Remains 70 /379 variables (removed 309) and now considering 208/498 (removed 290) transitions.
[2024-05-23 11:48:57] [INFO ] Flow matrix only has 169 transitions (discarded 39 similar events)
// Phase 1: matrix 169 rows 70 cols
[2024-05-23 11:48:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 11:48:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-23 11:48:57] [INFO ] Flow matrix only has 169 transitions (discarded 39 similar events)
[2024-05-23 11:48:57] [INFO ] Invariant cache hit.
[2024-05-23 11:48:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 11:48:57] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-23 11:48:57] [INFO ] Flow matrix only has 169 transitions (discarded 39 similar events)
[2024-05-23 11:48:57] [INFO ] Invariant cache hit.
[2024-05-23 11:48:57] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 168/236 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/238 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/239 variables, and 80 constraints, problems are : Problem set: 0 solved, 192 unsolved in 3839 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 168/236 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 2/238 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 175/272 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (OVERLAPS) 0/238 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/239 variables, and 272 constraints, problems are : Problem set: 0 solved, 192 unsolved in 5430 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 9413ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 9415ms
Starting structural reductions in LI_LTL mode, iteration 1 : 70/379 places, 208/498 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9557 ms. Remains : 70/379 places, 208/498 transitions.
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
Treatment of property CloudDeployment-PT-2b-LTLFireability-10 finished in 9771 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&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' '!(F(G(p0)))'
[2024-05-23 11:49:07] [INFO ] Flatten gal took : 25 ms
[2024-05-23 11:49:07] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 11:49:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 379 places, 498 transitions and 1515 arcs took 7 ms.
Total runtime 219750 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-2b

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 2251
MODEL NAME: /home/mcc/execution/410/model
379 places, 498 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.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudDeployment-PT-2b-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-2b-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-2b-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-2b-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-2b-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716465265680

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-2b"
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-2b, 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-171620504700548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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