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.r070-tall-171620506100547.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CloudDeployment-PT-2b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620506100547
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-2b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716323608220

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-2b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 20:33:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:33:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:33:29] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-21 20:33:29] [INFO ] Transformed 556 places.
[2024-05-21 20:33:29] [INFO ] Transformed 684 transitions.
[2024-05-21 20:33:29] [INFO ] Found NUPN structural information;
[2024-05-21 20:33:29] [INFO ] Parsed PT model containing 556 places and 684 transitions and 1987 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CloudDeployment-PT-2b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 122 place count 434 transition count 554
Iterating global reduction 1 with 119 rules applied. Total rules applied 241 place count 434 transition count 554
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 280 place count 395 transition count 515
Iterating global reduction 1 with 39 rules applied. Total rules applied 319 place count 395 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 320 place count 395 transition count 514
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 325 place count 390 transition count 509
Iterating global reduction 2 with 5 rules applied. Total rules applied 330 place count 390 transition count 509
Applied a total of 330 rules in 124 ms. Remains 390 /556 variables (removed 166) and now considering 509/684 (removed 175) transitions.
// Phase 1: matrix 509 rows 390 cols
[2024-05-21 20:33:30] [INFO ] Computed 6 invariants in 22 ms
[2024-05-21 20:33:30] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 20:33:30] [INFO ] Invariant cache hit.
[2024-05-21 20:33:30] [INFO ] Implicit Places using invariants and state equation in 304 ms returned [192]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 593 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 389/556 places, 509/684 transitions.
Applied a total of 0 rules in 15 ms. Remains 389 /389 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 747 ms. Remains : 389/556 places, 509/684 transitions.
Support contains 28 out of 389 places after structural reductions.
[2024-05-21 20:33:30] [INFO ] Flatten gal took : 71 ms
[2024-05-21 20:33:30] [INFO ] Flatten gal took : 35 ms
[2024-05-21 20:33:31] [INFO ] Input system was already deterministic with 509 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (600 resets) in 1237 ms. (32 steps per ms) remains 6/16 properties
BEST_FIRST walk for 40003 steps (144 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (140 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (138 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (139 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (150 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (138 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
// Phase 1: matrix 509 rows 389 cols
[2024-05-21 20:33:31] [INFO ] Computed 5 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 28/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 50/88 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 183/271 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 227/498 variables, 99/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 189/687 variables, 85/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/687 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 157/844 variables, 76/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/844 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 47/891 variables, 35/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/891 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 7/898 variables, 6/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/898 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/898 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 898/898 variables, and 394 constraints, problems are : Problem set: 0 solved, 6 unsolved in 662 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 389/389 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 28/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 50/88 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 183/271 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 227/498 variables, 99/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 5/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 189/687 variables, 85/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/687 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 157/844 variables, 76/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/844 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 47/891 variables, 35/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/891 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 7/898 variables, 6/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/898 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/898 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 898/898 variables, and 400 constraints, problems are : Problem set: 0 solved, 6 unsolved in 984 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 389/389 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1705ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 767 ms.
Support contains 4 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 509/509 transitions.
Graph (trivial) has 398 edges and 389 vertex of which 139 / 389 are part of one of the 15 SCC in 3 ms
Free SCC test removed 124 places
Drop transitions (Empty/Sink Transition effects.) removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Graph (complete) has 695 edges and 265 vertex of which 257 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 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 116 rules applied. Total rules applied 118 place count 257 transition count 233
Reduce places removed 108 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 109 rules applied. Total rules applied 227 place count 149 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 228 place count 148 transition count 232
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 148 transition count 212
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 128 transition count 212
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 272 place count 124 transition count 208
Iterating global reduction 3 with 4 rules applied. Total rules applied 276 place count 124 transition count 208
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 276 place count 124 transition count 204
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 284 place count 120 transition count 204
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 352 place count 86 transition count 170
Performed 14 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 380 place count 72 transition count 204
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 386 place count 72 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 404 place count 72 transition count 180
Free-agglomeration rule applied 20 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 424 place count 72 transition count 159
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 258 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 41 rules applied. Total rules applied 465 place count 51 transition count 139
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 466 place count 51 transition count 138
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 468 place count 49 transition count 131
Iterating global reduction 6 with 2 rules applied. Total rules applied 470 place count 49 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 482 place count 49 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 483 place count 48 transition count 118
Applied a total of 483 rules in 82 ms. Remains 48 /389 variables (removed 341) and now considering 118/509 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 48/389 places, 118/509 transitions.
RANDOM walk for 30033 steps (6 resets) in 329 ms. (91 steps per ms) remains 0/3 properties
Computed a total of 59 stabilizing places and 112 stable transitions
Graph (complete) has 900 edges and 389 vertex of which 381 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 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(((G(p1)||p0) U p2)))'
Support contains 4 out of 389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Graph (trivial) has 401 edges and 389 vertex of which 146 / 389 are part of one of the 16 SCC in 1 ms
Free SCC test removed 130 places
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Graph (complete) has 736 edges and 259 vertex of which 251 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 250 transition count 252
Reduce places removed 105 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 106 rules applied. Total rules applied 213 place count 145 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 144 transition count 251
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 214 place count 144 transition count 234
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 248 place count 127 transition count 234
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 251 place count 124 transition count 231
Iterating global reduction 3 with 3 rules applied. Total rules applied 254 place count 124 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 254 place count 124 transition count 229
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 258 place count 122 transition count 229
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 332 place count 85 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 333 place count 85 transition count 191
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 4 with 24 rules applied. Total rules applied 357 place count 73 transition count 219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 363 place count 73 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 383 place count 73 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 72 transition count 192
Applied a total of 384 rules in 57 ms. Remains 72 /389 variables (removed 317) and now considering 192/509 (removed 317) transitions.
[2024-05-21 20:33:34] [INFO ] Flow matrix only has 153 transitions (discarded 39 similar events)
// Phase 1: matrix 153 rows 72 cols
[2024-05-21 20:33:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:33:35] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 20:33:35] [INFO ] Flow matrix only has 153 transitions (discarded 39 similar events)
[2024-05-21 20:33:35] [INFO ] Invariant cache hit.
[2024-05-21 20:33:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:33:35] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-21 20:33:35] [INFO ] Redundant transitions in 122 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-21 20:33:35] [INFO ] Flow matrix only has 153 transitions (discarded 39 similar events)
[2024-05-21 20:33:35] [INFO ] Invariant cache hit.
[2024-05-21 20:33:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 152/221 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 3/224 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/225 variables, and 80 constraints, problems are : Problem set: 0 solved, 174 unsolved in 3373 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 152/221 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 3/224 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 161/254 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 0/224 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/225 variables, and 254 constraints, problems are : Problem set: 0 solved, 174 unsolved in 4523 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 8047ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 8051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/389 places, 192/509 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8466 ms. Remains : 72/389 places, 192/509 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-03
Stuttering criterion allowed to conclude after 57 steps with 4 reset in 4 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-03 finished in 8793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 381 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 381 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 378 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 378 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 378 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 377 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 377 transition count 496
Applied a total of 25 rules in 27 ms. Remains 377 /389 variables (removed 12) and now considering 496/509 (removed 13) transitions.
// Phase 1: matrix 496 rows 377 cols
[2024-05-21 20:33:43] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:33:43] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 20:33:43] [INFO ] Invariant cache hit.
[2024-05-21 20:33:44] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 495 sub problems to find dead transitions.
[2024-05-21 20:33:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 496/872 variables, 376/381 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/872 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Problem TDEAD396 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/873 variables, 1/382 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/873 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 6 (OVERLAPS) 0/873 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 494 unsolved
No progress, stopping.
After SMT solving in domain Real declared 873/873 variables, and 382 constraints, problems are : Problem set: 1 solved, 494 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 494 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 496/871 variables, 375/380 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/871 variables, 460/840 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/840 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 5 (OVERLAPS) 2/873 variables, 2/842 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 34/876 constraints. Problems are: Problem set: 1 solved, 494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 873/873 variables, and 876 constraints, problems are : Problem set: 1 solved, 494 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 494/495 constraints, Known Traps: 0/0 constraints]
After SMT, in 60226ms problems are : Problem set: 1 solved, 494 unsolved
Search for dead transitions found 1 dead transitions in 60236ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 377/389 places, 495/509 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 376 transition count 495
Applied a total of 1 rules in 5 ms. Remains 376 /377 variables (removed 1) and now considering 495/495 (removed 0) transitions.
// Phase 1: matrix 495 rows 376 cols
[2024-05-21 20:34:44] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 20:34:44] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 20:34:44] [INFO ] Invariant cache hit.
[2024-05-21 20:34:44] [INFO ] Implicit Places using invariants and state equation in 281 ms returned [8, 16, 192]
[2024-05-21 20:34:44] [INFO ] Actually due to overlaps returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 366 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 375/389 places, 495/509 transitions.
Applied a total of 0 rules in 7 ms. Remains 375 /375 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61010 ms. Remains : 375/389 places, 495/509 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 527 steps with 9 reset in 9 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-05 finished in 61117 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(p1)||G((F(p1)||p2))||p0)))'
Support contains 5 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 381 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 381 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 378 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 378 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 378 transition count 497
Applied a total of 23 rules in 17 ms. Remains 378 /389 variables (removed 11) and now considering 497/509 (removed 12) transitions.
// Phase 1: matrix 497 rows 378 cols
[2024-05-21 20:34:44] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:34:44] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 20:34:44] [INFO ] Invariant cache hit.
[2024-05-21 20:34:45] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-21 20:34:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/377 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 497/874 variables, 377/382 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/874 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Problem TDEAD397 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/875 variables, 1/383 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/875 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 6 (OVERLAPS) 0/875 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 495 unsolved
No progress, stopping.
After SMT solving in domain Real declared 875/875 variables, and 383 constraints, problems are : Problem set: 1 solved, 495 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 495 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 497/873 variables, 376/381 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/873 variables, 461/842 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/873 variables, 0/842 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 5 (OVERLAPS) 2/875 variables, 2/844 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/875 variables, 34/878 constraints. Problems are: Problem set: 1 solved, 495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 875/875 variables, and 878 constraints, problems are : Problem set: 1 solved, 495 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 495/496 constraints, Known Traps: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 1 solved, 495 unsolved
Search for dead transitions found 1 dead transitions in 60198ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 378/389 places, 496/509 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 377 transition count 496
Applied a total of 1 rules in 7 ms. Remains 377 /378 variables (removed 1) and now considering 496/496 (removed 0) transitions.
// Phase 1: matrix 496 rows 377 cols
[2024-05-21 20:35:45] [INFO ] Computed 5 invariants in 11 ms
[2024-05-21 20:35:45] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 20:35:45] [INFO ] Invariant cache hit.
[2024-05-21 20:35:45] [INFO ] Implicit Places using invariants and state equation in 255 ms returned [8, 16, 192]
[2024-05-21 20:35:45] [INFO ] Actually due to overlaps returned [8]
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 2 : 376/389 places, 496/509 transitions.
Applied a total of 0 rules in 10 ms. Remains 376 /376 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 60924 ms. Remains : 376/389 places, 496/509 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Computed a total of 56 stabilizing places and 108 stable transitions
Graph (complete) has 876 edges and 376 vertex of which 370 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 56 stabilizing places and 108 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-2b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-2b-LTLCardinality-07 finished in 61589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(p1))||p0)) U ((!p2&&X(p2))||X(G(p2)))))'
Support contains 6 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 381 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 381 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 378 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 378 transition count 498
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 377 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 377 transition count 497
Applied a total of 24 rules in 22 ms. Remains 377 /389 variables (removed 12) and now considering 497/509 (removed 12) transitions.
// Phase 1: matrix 497 rows 377 cols
[2024-05-21 20:35:46] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:35:46] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 20:35:46] [INFO ] Invariant cache hit.
[2024-05-21 20:35:46] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-21 20:35:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 497/873 variables, 376/381 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/873 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Problem TDEAD396 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/874 variables, 1/382 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 6 (OVERLAPS) 0/874 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 495 unsolved
No progress, stopping.
After SMT solving in domain Real declared 874/874 variables, and 382 constraints, problems are : Problem set: 1 solved, 495 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 495 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 497/872 variables, 375/380 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/872 variables, 460/840 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 0/840 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 5 (OVERLAPS) 2/874 variables, 2/842 constraints. Problems are: Problem set: 1 solved, 495 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 35/877 constraints. Problems are: Problem set: 1 solved, 495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/874 variables, and 877 constraints, problems are : Problem set: 1 solved, 495 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 495/496 constraints, Known Traps: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 1 solved, 495 unsolved
Search for dead transitions found 1 dead transitions in 60174ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 377/389 places, 496/509 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 376 transition count 496
Applied a total of 1 rules in 5 ms. Remains 376 /377 variables (removed 1) and now considering 496/496 (removed 0) transitions.
// Phase 1: matrix 496 rows 376 cols
[2024-05-21 20:36:46] [INFO ] Computed 5 invariants in 8 ms
[2024-05-21 20:36:46] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 20:36:46] [INFO ] Invariant cache hit.
[2024-05-21 20:36:47] [INFO ] Implicit Places using invariants and state equation in 261 ms returned [8, 16, 192]
[2024-05-21 20:36:47] [INFO ] Actually due to overlaps returned [8]
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 2 : 375/389 places, 496/509 transitions.
Applied a total of 0 rules in 5 ms. Remains 375 /375 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 60879 ms. Remains : 375/389 places, 496/509 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-09
Product exploration explored 100000 steps with 33392 reset in 162 ms.
Product exploration explored 100000 steps with 33298 reset in 193 ms.
Computed a total of 56 stabilizing places and 108 stable transitions
Graph (complete) has 877 edges and 375 vertex of which 369 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
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 126 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (612 resets) in 141 ms. (281 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (143 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (144 resets) in 368 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (144 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (137 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (144 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
// Phase 1: matrix 496 rows 375 cols
[2024-05-21 20:36:48] [INFO ] Computed 4 invariants in 2 ms
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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 40/71 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 154/225 variables, 71/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 232/457 variables, 94/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 189/646 variables, 89/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 156/802 variables, 72/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/802 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 55/857 variables, 40/370 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/857 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 11/868 variables, 7/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/868 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 3/871 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/871 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 871/871 variables, and 379 constraints, problems are : Problem set: 0 solved, 5 unsolved in 544 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 25/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 40/71 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 154/225 variables, 71/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 232/457 variables, 94/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 189/646 variables, 89/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 156/802 variables, 72/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/802 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 55/857 variables, 40/375 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/857 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf4 is UNSAT
At refinement iteration 16 (OVERLAPS) 11/868 variables, 7/382 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/868 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 3/871 variables, 2/384 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/871 variables, 0/384 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/871 variables, 0/384 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 871/871 variables, and 384 constraints, problems are : Problem set: 1 solved, 4 unsolved in 694 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1248ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 186 steps, including 1 resets, run visited all 4 properties in 5 ms. (steps per millisecond=37 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 14 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (G (OR p2 p0))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 374 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 6 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 496/496 transitions.
Graph (trivial) has 379 edges and 375 vertex of which 128 / 375 are part of one of the 15 SCC in 2 ms
Free SCC test removed 113 places
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Graph (complete) has 724 edges and 262 vertex of which 256 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 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 255 transition count 263
Reduce places removed 101 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 154 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 153 transition count 262
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 206 place count 153 transition count 240
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 250 place count 131 transition count 240
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 330 place count 91 transition count 200
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 356 place count 78 transition count 238
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 368 place count 78 transition count 226
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 395 place count 78 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 77 transition count 198
Applied a total of 396 rules in 39 ms. Remains 77 /375 variables (removed 298) and now considering 198/496 (removed 298) transitions.
[2024-05-21 20:36:50] [INFO ] Flow matrix only has 158 transitions (discarded 40 similar events)
// Phase 1: matrix 158 rows 77 cols
[2024-05-21 20:36:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:36:50] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 20:36:50] [INFO ] Flow matrix only has 158 transitions (discarded 40 similar events)
[2024-05-21 20:36:50] [INFO ] Invariant cache hit.
[2024-05-21 20:36:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:36:50] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-21 20:36:50] [INFO ] Redundant transitions in 118 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 20:36:50] [INFO ] Flow matrix only has 158 transitions (discarded 40 similar events)
[2024-05-21 20:36:50] [INFO ] Invariant cache hit.
[2024-05-21 20:36:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 157/232 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 2/234 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/235 variables, and 85 constraints, problems are : Problem set: 0 solved, 181 unsolved in 3631 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 157/232 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 2/234 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 161/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/235 variables, and 266 constraints, problems are : Problem set: 0 solved, 181 unsolved in 4603 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints]
After SMT, in 8341ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 8343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/375 places, 198/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8615 ms. Remains : 77/375 places, 198/496 transitions.
Computed a total of 21 stabilizing places and 101 stable transitions
Computed a total of 21 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 131 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
RANDOM walk for 40000 steps (3879 resets) in 967 ms. (41 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (536 resets) in 27 ms. (1428 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (527 resets) in 24 ms. (1600 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (510 resets) in 24 ms. (1600 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (520 resets) in 25 ms. (1538 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (525 resets) in 24 ms. (1600 steps per ms) remains 5/5 properties
[2024-05-21 20:36:59] [INFO ] Flow matrix only has 158 transitions (discarded 40 similar events)
[2024-05-21 20:36:59] [INFO ] Invariant cache hit.
[2024-05-21 20:36:59] [INFO ] State equation strengthened by 6 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 100/121 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 99/220 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 13/233 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/234 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/235 variables, and 85 constraints, problems are : Problem set: 0 solved, 5 unsolved in 136 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 100/121 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 99/220 variables, 50/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 13/233 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 14 (OVERLAPS) 1/234 variables, 1/90 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/234 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/235 variables, and 90 constraints, problems are : Problem set: 2 solved, 3 unsolved in 197 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 337ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 112 ms.
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 198/198 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 77 transition count 175
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 74 transition count 188
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 74 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 47 place count 74 transition count 170
Free-agglomeration rule applied 18 times with reduction of 1 identical transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 65 place count 74 transition count 151
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 242 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 37 rules applied. Total rules applied 102 place count 55 transition count 133
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 55 transition count 132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 54 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 54 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 113 place count 54 transition count 121
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 54 transition count 121
Applied a total of 116 rules in 17 ms. Remains 54 /77 variables (removed 23) and now considering 121/198 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 54/77 places, 121/198 transitions.
RANDOM walk for 40000 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-05-21 20:37:00] [INFO ] Flow matrix only has 89 transitions (discarded 32 similar events)
// Phase 1: matrix 89 rows 54 cols
[2024-05-21 20:37:00] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 20:37:00] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/20 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/62 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/112 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/140 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/143 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/143 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 48 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/20 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/62 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/112 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/140 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/143 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/143 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 68 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1524 steps, including 91 resets, run visited all 1 properties in 3 ms. (steps per millisecond=508 )
Parikh walk visited 1 properties in 2 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p2 p0 p1)), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 276 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 9348 reset in 208 ms.
Product exploration explored 100000 steps with 9395 reset in 296 ms.
Built C files in :
/tmp/ltsmin16612705882626035563
[2024-05-21 20:37:02] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2024-05-21 20:37:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:37:02] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2024-05-21 20:37:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:37:02] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2024-05-21 20:37:02] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:37:02] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16612705882626035563
Running compilation step : cd /tmp/ltsmin16612705882626035563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 679 ms.
Running link step : cd /tmp/ltsmin16612705882626035563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16612705882626035563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10716329927384928847.hoa' '--buchi-type=spotba'
LTSmin run took 521 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-2b-LTLCardinality-09 finished in 77012 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(p1) U G((!p2&&X(p3))))&&p0)))'
Support contains 6 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 381 transition count 501
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 381 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 378 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 378 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 378 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 377 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 377 transition count 496
Applied a total of 25 rules in 19 ms. Remains 377 /389 variables (removed 12) and now considering 496/509 (removed 13) transitions.
// Phase 1: matrix 496 rows 377 cols
[2024-05-21 20:37:03] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 20:37:03] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 20:37:03] [INFO ] Invariant cache hit.
[2024-05-21 20:37:03] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 495 sub problems to find dead transitions.
[2024-05-21 20:37:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 496/872 variables, 376/381 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/872 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Problem TDEAD396 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/873 variables, 1/382 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/873 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 6 (OVERLAPS) 0/873 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 494 unsolved
No progress, stopping.
After SMT solving in domain Real declared 873/873 variables, and 382 constraints, problems are : Problem set: 1 solved, 494 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 494 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/375 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 496/871 variables, 375/380 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/871 variables, 460/840 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/840 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 5 (OVERLAPS) 2/873 variables, 2/842 constraints. Problems are: Problem set: 1 solved, 494 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/873 variables, 34/876 constraints. Problems are: Problem set: 1 solved, 494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 873/873 variables, and 876 constraints, problems are : Problem set: 1 solved, 494 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 494/495 constraints, Known Traps: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 1 solved, 494 unsolved
Search for dead transitions found 1 dead transitions in 60173ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 377/389 places, 495/509 transitions.
Applied a total of 0 rules in 4 ms. Remains 377 /377 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60530 ms. Remains : 377/389 places, 495/509 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p3) p2), (OR (NOT p0) (NOT p3) p2), true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (OR (NOT p3) p2)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-10 finished in 60821 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 3 out of 389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Graph (trivial) has 398 edges and 389 vertex of which 137 / 389 are part of one of the 15 SCC in 0 ms
Free SCC test removed 122 places
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Graph (complete) has 747 edges and 267 vertex of which 259 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 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 108 rules applied. Total rules applied 110 place count 258 transition count 258
Reduce places removed 108 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 110 rules applied. Total rules applied 220 place count 150 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 149 transition count 256
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 221 place count 149 transition count 237
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 259 place count 130 transition count 237
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 264 place count 125 transition count 232
Iterating global reduction 3 with 5 rules applied. Total rules applied 269 place count 125 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 269 place count 125 transition count 230
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 273 place count 123 transition count 230
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 349 place count 85 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 85 transition count 191
Performed 12 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 374 place count 73 transition count 219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 380 place count 73 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 394 place count 73 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 395 place count 72 transition count 198
Applied a total of 395 rules in 32 ms. Remains 72 /389 variables (removed 317) and now considering 198/509 (removed 311) transitions.
[2024-05-21 20:38:04] [INFO ] Flow matrix only has 160 transitions (discarded 38 similar events)
// Phase 1: matrix 160 rows 72 cols
[2024-05-21 20:38:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:38:04] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:38:04] [INFO ] Flow matrix only has 160 transitions (discarded 38 similar events)
[2024-05-21 20:38:04] [INFO ] Invariant cache hit.
[2024-05-21 20:38:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:38:04] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-21 20:38:04] [INFO ] Redundant transitions in 205 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-21 20:38:04] [INFO ] Flow matrix only has 160 transitions (discarded 38 similar events)
[2024-05-21 20:38:04] [INFO ] Invariant cache hit.
[2024-05-21 20:38:04] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 159/228 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 3/231 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/232 variables, and 80 constraints, problems are : Problem set: 0 solved, 185 unsolved in 3905 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 159/228 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 3/231 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 171/265 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/232 variables, and 265 constraints, problems are : Problem set: 0 solved, 185 unsolved in 5186 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 9213ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 9216ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/389 places, 198/509 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9594 ms. Remains : 72/389 places, 198/509 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-11 finished in 9649 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||G(p1)))))'
Support contains 3 out of 389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 389/389 places, 509/509 transitions.
Graph (trivial) has 401 edges and 389 vertex of which 135 / 389 are part of one of the 16 SCC in 5 ms
Free SCC test removed 119 places
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Graph (complete) has 752 edges and 270 vertex of which 262 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 261 transition count 265
Reduce places removed 106 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 155 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 216 place count 154 transition count 264
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 216 place count 154 transition count 244
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 256 place count 134 transition count 244
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 260 place count 130 transition count 240
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 130 transition count 240
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 264 place count 130 transition count 238
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 268 place count 128 transition count 238
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 348 place count 88 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 349 place count 88 transition count 197
Performed 14 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 377 place count 74 transition count 230
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 386 place count 74 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 409 place count 74 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 410 place count 73 transition count 197
Applied a total of 410 rules in 53 ms. Remains 73 /389 variables (removed 316) and now considering 197/509 (removed 312) transitions.
[2024-05-21 20:38:13] [INFO ] Flow matrix only has 160 transitions (discarded 37 similar events)
// Phase 1: matrix 160 rows 73 cols
[2024-05-21 20:38:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:38:13] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:38:13] [INFO ] Flow matrix only has 160 transitions (discarded 37 similar events)
[2024-05-21 20:38:13] [INFO ] Invariant cache hit.
[2024-05-21 20:38:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 20:38:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-21 20:38:14] [INFO ] Redundant transitions in 104 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-21 20:38:14] [INFO ] Flow matrix only has 160 transitions (discarded 37 similar events)
[2024-05-21 20:38:14] [INFO ] Invariant cache hit.
[2024-05-21 20:38:14] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 159/230 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 2/232 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/233 variables, and 81 constraints, problems are : Problem set: 0 solved, 180 unsolved in 3573 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 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/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 159/230 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 2/232 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 164/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/233 variables, and 261 constraints, problems are : Problem set: 0 solved, 180 unsolved in 4664 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
After SMT, in 8350ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 8353ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/389 places, 197/509 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8662 ms. Remains : 73/389 places, 197/509 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLCardinality-15
Stuttering criterion allowed to conclude after 5131 steps with 484 reset in 13 ms.
FORMULA CloudDeployment-PT-2b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLCardinality-15 finished in 8775 ms.
All properties solved by simple procedures.
Total runtime 293287 ms.

BK_STOP 1716323902689

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-2b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620506100547"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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