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.r087-tall-171620522000352.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 gold2023
Input is CloudDeployment-PT-3b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620522000352
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:42 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 308K 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-3b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-3b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716261681985

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-3b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 03:21:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:21:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:21:23] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-21 03:21:23] [INFO ] Transformed 859 places.
[2024-05-21 03:21:23] [INFO ] Transformed 1152 transitions.
[2024-05-21 03:21:23] [INFO ] Found NUPN structural information;
[2024-05-21 03:21:23] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-3b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 859 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 855 transition count 1152
Discarding 193 places :
Symmetric choice reduction at 1 with 193 rule applications. Total rules 197 place count 662 transition count 902
Iterating global reduction 1 with 193 rules applied. Total rules applied 390 place count 662 transition count 902
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 456 place count 596 transition count 836
Iterating global reduction 1 with 66 rules applied. Total rules applied 522 place count 596 transition count 836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 525 place count 596 transition count 833
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 534 place count 587 transition count 824
Iterating global reduction 2 with 9 rules applied. Total rules applied 543 place count 587 transition count 824
Applied a total of 543 rules in 145 ms. Remains 587 /859 variables (removed 272) and now considering 824/1152 (removed 328) transitions.
// Phase 1: matrix 824 rows 587 cols
[2024-05-21 03:21:24] [INFO ] Computed 9 invariants in 26 ms
[2024-05-21 03:21:24] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-21 03:21:24] [INFO ] Invariant cache hit.
[2024-05-21 03:21:24] [INFO ] Implicit Places using invariants and state equation in 567 ms returned [375]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1034 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 586/859 places, 824/1152 transitions.
Applied a total of 0 rules in 22 ms. Remains 586 /586 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1202 ms. Remains : 586/859 places, 824/1152 transitions.
Support contains 41 out of 586 places after structural reductions.
[2024-05-21 03:21:25] [INFO ] Flatten gal took : 89 ms
[2024-05-21 03:21:25] [INFO ] Flatten gal took : 52 ms
[2024-05-21 03:21:25] [INFO ] Input system was already deterministic with 824 transitions.
Support contains 37 out of 586 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 21) seen :9
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :2
Running SMT prover for 9 properties.
// Phase 1: matrix 824 rows 586 cols
[2024-05-21 03:21:26] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 03:21:26] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-21 03:21:26] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 18 ms returned sat
[2024-05-21 03:21:27] [INFO ] After 525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-21 03:21:27] [INFO ] After 979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 270 ms.
[2024-05-21 03:21:28] [INFO ] After 1731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 4 properties in 57 ms.
Support contains 11 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 824/824 transitions.
Graph (trivial) has 594 edges and 586 vertex of which 198 / 586 are part of one of the 24 SCC in 4 ms
Free SCC test removed 174 places
Drop transitions removed 222 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 224 transitions.
Graph (complete) has 1196 edges and 412 vertex of which 401 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 176 rules applied. Total rules applied 178 place count 401 transition count 424
Reduce places removed 164 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 167 rules applied. Total rules applied 345 place count 237 transition count 421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 348 place count 234 transition count 421
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 348 place count 234 transition count 392
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 406 place count 205 transition count 392
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 413 place count 198 transition count 385
Iterating global reduction 3 with 7 rules applied. Total rules applied 420 place count 198 transition count 385
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 420 place count 198 transition count 381
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 428 place count 194 transition count 381
Performed 55 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 538 place count 139 transition count 325
Performed 23 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 584 place count 116 transition count 397
Drop transitions removed 10 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 606 place count 116 transition count 375
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 663 place count 116 transition count 318
Free-agglomeration rule applied 29 times with reduction of 6 identical transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 692 place count 116 transition count 283
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 40 transitions.
Graph (complete) has 466 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 70 rules applied. Total rules applied 762 place count 86 transition count 243
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 763 place count 86 transition count 242
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 764 place count 85 transition count 238
Iterating global reduction 6 with 1 rules applied. Total rules applied 765 place count 85 transition count 238
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 786 place count 85 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 787 place count 84 transition count 216
Applied a total of 787 rules in 152 ms. Remains 84 /586 variables (removed 502) and now considering 216/824 (removed 608) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 84/586 places, 216/824 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-21 03:21:28] [INFO ] Flow matrix only has 141 transitions (discarded 75 similar events)
// Phase 1: matrix 141 rows 84 cols
[2024-05-21 03:21:28] [INFO ] Computed 11 invariants in 0 ms
[2024-05-21 03:21:28] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:21:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 03:21:28] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-21 03:21:28] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:21:28] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 03:21:28] [INFO ] After 14ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:21:28] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 03:21:28] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 216/216 transitions.
Graph (trivial) has 43 edges and 84 vertex of which 3 / 84 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 82 transition count 207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 79 transition count 207
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 79 transition count 205
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 77 transition count 205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 75 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 75 transition count 200
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 69 transition count 194
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 33 place count 69 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 68 transition count 189
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 45 place count 68 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 67 transition count 178
Applied a total of 46 rules in 25 ms. Remains 67 /84 variables (removed 17) and now considering 178/216 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 67/84 places, 178/216 transitions.
Finished random walk after 1459 steps, including 25 resets, run visited all 1 properties in 5 ms. (steps per millisecond=291 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 88 stabilizing places and 209 stable transitions
Graph (complete) has 1496 edges and 586 vertex of which 575 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(p1))))))'
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Graph (trivial) has 603 edges and 586 vertex of which 202 / 586 are part of one of the 22 SCC in 1 ms
Free SCC test removed 180 places
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Graph (complete) has 1257 edges and 406 vertex of which 395 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 394 transition count 444
Reduce places removed 169 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 171 rules applied. Total rules applied 342 place count 225 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 344 place count 223 transition count 442
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 344 place count 223 transition count 417
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 394 place count 198 transition count 417
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 405 place count 187 transition count 406
Iterating global reduction 3 with 11 rules applied. Total rules applied 416 place count 187 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 417 place count 187 transition count 405
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 417 place count 187 transition count 401
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 425 place count 183 transition count 401
Performed 57 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 539 place count 126 transition count 343
Performed 19 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 577 place count 107 transition count 421
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 593 place count 107 transition count 405
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 643 place count 107 transition count 355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 644 place count 106 transition count 354
Applied a total of 644 rules in 88 ms. Remains 106 /586 variables (removed 480) and now considering 354/824 (removed 470) transitions.
[2024-05-21 03:21:29] [INFO ] Flow matrix only has 282 transitions (discarded 72 similar events)
// Phase 1: matrix 282 rows 106 cols
[2024-05-21 03:21:29] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 03:21:29] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 03:21:29] [INFO ] Flow matrix only has 282 transitions (discarded 72 similar events)
[2024-05-21 03:21:29] [INFO ] Invariant cache hit.
[2024-05-21 03:21:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 03:21:29] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-21 03:21:29] [INFO ] Redundant transitions in 236 ms returned []
[2024-05-21 03:21:29] [INFO ] Flow matrix only has 282 transitions (discarded 72 similar events)
[2024-05-21 03:21:29] [INFO ] Invariant cache hit.
[2024-05-21 03:21:30] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/586 places, 354/824 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 798 ms. Remains : 106/586 places, 354/824 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 240 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s76 1)), p0:(OR (EQ s3 0) (EQ s76 1) (EQ s63 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-00 finished in 1103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p1)&&G(p2))))'
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Graph (trivial) has 603 edges and 586 vertex of which 189 / 586 are part of one of the 23 SCC in 1 ms
Free SCC test removed 166 places
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Graph (complete) has 1285 edges and 420 vertex of which 409 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 408 transition count 463
Reduce places removed 169 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 173 rules applied. Total rules applied 344 place count 239 transition count 459
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 347 place count 236 transition count 459
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 347 place count 236 transition count 433
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 399 place count 210 transition count 433
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 410 place count 199 transition count 422
Iterating global reduction 3 with 11 rules applied. Total rules applied 421 place count 199 transition count 422
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 199 transition count 421
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 422 place count 199 transition count 416
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 432 place count 194 transition count 416
Performed 61 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 554 place count 133 transition count 353
Performed 20 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 594 place count 113 transition count 416
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 610 place count 113 transition count 400
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 641 place count 113 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 642 place count 112 transition count 368
Applied a total of 642 rules in 103 ms. Remains 112 /586 variables (removed 474) and now considering 368/824 (removed 456) transitions.
[2024-05-21 03:21:30] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
// Phase 1: matrix 298 rows 112 cols
[2024-05-21 03:21:30] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 03:21:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 03:21:30] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-21 03:21:30] [INFO ] Invariant cache hit.
[2024-05-21 03:21:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 03:21:30] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-21 03:21:30] [INFO ] Redundant transitions in 172 ms returned []
[2024-05-21 03:21:30] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-21 03:21:30] [INFO ] Invariant cache hit.
[2024-05-21 03:21:30] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/586 places, 368/824 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 595 ms. Remains : 112/586 places, 368/824 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=p2, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s57 0) (EQ s90 1)), p2:(EQ s9 1), p1:(OR (EQ s51 0) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 5525 reset in 306 ms.
Product exploration explored 100000 steps with 5531 reset in 257 ms.
Computed a total of 33 stabilizing places and 217 stable transitions
Computed a total of 33 stabilizing places and 217 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 124 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 575 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1959961 steps, run timeout after 3001 ms. (steps per millisecond=653 ) properties seen :{}
Probabilistic random walk after 1959961 steps, saw 301406 distinct states, run finished after 3005 ms. (steps per millisecond=652 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:21:35] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-21 03:21:35] [INFO ] Invariant cache hit.
[2024-05-21 03:21:35] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:21:35] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-21 03:21:35] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:21:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 03:21:35] [INFO ] After 17ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:21:35] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-21 03:21:35] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 368/368 transitions.
Graph (trivial) has 101 edges and 112 vertex of which 7 / 112 are part of one of the 2 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 107 transition count 324
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 324
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 17 place count 99 transition count 355
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 23 place count 99 transition count 349
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 1 with 45 rules applied. Total rules applied 68 place count 99 transition count 304
Free-agglomeration rule applied 29 times with reduction of 6 identical transitions.
Iterating global reduction 1 with 29 rules applied. Total rules applied 97 place count 99 transition count 269
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 406 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 77 rules applied. Total rules applied 174 place count 69 transition count 222
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 69 transition count 221
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 67 transition count 213
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 67 transition count 213
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 206 place count 67 transition count 186
Applied a total of 206 rules in 32 ms. Remains 67 /112 variables (removed 45) and now considering 186/368 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 67/112 places, 186/368 transitions.
Finished random walk after 55 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 12 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 368/368 transitions.
Applied a total of 0 rules in 10 ms. Remains 112 /112 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-05-21 03:21:35] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-21 03:21:35] [INFO ] Invariant cache hit.
[2024-05-21 03:21:35] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 03:21:35] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-21 03:21:35] [INFO ] Invariant cache hit.
[2024-05-21 03:21:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 03:21:35] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-21 03:21:35] [INFO ] Redundant transitions in 199 ms returned []
[2024-05-21 03:21:35] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-21 03:21:35] [INFO ] Invariant cache hit.
[2024-05-21 03:21:36] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 525 ms. Remains : 112/112 places, 368/368 transitions.
Computed a total of 33 stabilizing places and 217 stable transitions
Computed a total of 33 stabilizing places and 217 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 589 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2057381 steps, run timeout after 3001 ms. (steps per millisecond=685 ) properties seen :{}
Probabilistic random walk after 2057381 steps, saw 314688 distinct states, run finished after 3001 ms. (steps per millisecond=685 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:21:39] [INFO ] Flow matrix only has 298 transitions (discarded 70 similar events)
[2024-05-21 03:21:39] [INFO ] Invariant cache hit.
[2024-05-21 03:21:39] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:21:39] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-21 03:21:39] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:21:39] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 03:21:39] [INFO ] After 11ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:21:39] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 03:21:39] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 368/368 transitions.
Graph (trivial) has 101 edges and 112 vertex of which 7 / 112 are part of one of the 2 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 107 transition count 324
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 324
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 17 place count 99 transition count 355
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 23 place count 99 transition count 349
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 1 with 45 rules applied. Total rules applied 68 place count 99 transition count 304
Free-agglomeration rule applied 29 times with reduction of 6 identical transitions.
Iterating global reduction 1 with 29 rules applied. Total rules applied 97 place count 99 transition count 269
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 406 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 77 rules applied. Total rules applied 174 place count 69 transition count 222
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 69 transition count 221
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 67 transition count 213
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 67 transition count 213
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 206 place count 67 transition count 186
Applied a total of 206 rules in 26 ms. Remains 67 /112 variables (removed 45) and now considering 186/368 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 67/112 places, 186/368 transitions.
Finished random walk after 2576 steps, including 68 resets, run visited all 1 properties in 5 ms. (steps per millisecond=515 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5523 reset in 181 ms.
Product exploration explored 100000 steps with 5564 reset in 192 ms.
Built C files in :
/tmp/ltsmin1053349298667102315
[2024-05-21 03:21:40] [INFO ] Computing symmetric may disable matrix : 368 transitions.
[2024-05-21 03:21:40] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:21:40] [INFO ] Computing symmetric may enable matrix : 368 transitions.
[2024-05-21 03:21:40] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:21:40] [INFO ] Computing Do-Not-Accords matrix : 368 transitions.
[2024-05-21 03:21:40] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:21:40] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1053349298667102315
Running compilation step : cd /tmp/ltsmin1053349298667102315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 948 ms.
Running link step : cd /tmp/ltsmin1053349298667102315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1053349298667102315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15212605826021944074.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 368/368 transitions.
Graph (trivial) has 101 edges and 112 vertex of which 7 / 112 are part of one of the 2 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 107 transition count 361
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 361
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 105 transition count 362
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 18 place count 105 transition count 349
Applied a total of 18 rules in 22 ms. Remains 105 /112 variables (removed 7) and now considering 349/368 (removed 19) transitions.
[2024-05-21 03:21:55] [INFO ] Flow matrix only has 275 transitions (discarded 74 similar events)
// Phase 1: matrix 275 rows 105 cols
[2024-05-21 03:21:55] [INFO ] Computed 3 invariants in 3 ms
[2024-05-21 03:21:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 03:21:55] [INFO ] Flow matrix only has 275 transitions (discarded 74 similar events)
[2024-05-21 03:21:55] [INFO ] Invariant cache hit.
[2024-05-21 03:21:55] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 03:21:55] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-21 03:21:55] [INFO ] Redundant transitions in 189 ms returned []
[2024-05-21 03:21:55] [INFO ] Flow matrix only has 275 transitions (discarded 74 similar events)
[2024-05-21 03:21:55] [INFO ] Invariant cache hit.
[2024-05-21 03:21:55] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/112 places, 349/368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 544 ms. Remains : 105/112 places, 349/368 transitions.
Built C files in :
/tmp/ltsmin15716461856568867470
[2024-05-21 03:21:55] [INFO ] Computing symmetric may disable matrix : 349 transitions.
[2024-05-21 03:21:55] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:21:55] [INFO ] Computing symmetric may enable matrix : 349 transitions.
[2024-05-21 03:21:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:21:55] [INFO ] Computing Do-Not-Accords matrix : 349 transitions.
[2024-05-21 03:21:55] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:21:55] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15716461856568867470
Running compilation step : cd /tmp/ltsmin15716461856568867470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 718 ms.
Running link step : cd /tmp/ltsmin15716461856568867470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15716461856568867470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12918776848648578619.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:22:11] [INFO ] Flatten gal took : 24 ms
[2024-05-21 03:22:11] [INFO ] Flatten gal took : 23 ms
[2024-05-21 03:22:11] [INFO ] Time to serialize gal into /tmp/LTL15129288751915816587.gal : 4 ms
[2024-05-21 03:22:11] [INFO ] Time to serialize properties into /tmp/LTL3829407598927770926.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15129288751915816587.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10933298817896966482.hoa' '-atoms' '/tmp/LTL3829407598927770926.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3829407598927770926.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10933298817896966482.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t168, t206, t214, t362, t398, t407, t557, t595, t606, t806.t609, t528.t562, t486.t495...3608
Computing Next relation with stutter on 3.85665e+07 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
226 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.33387,83248,1,0,520,398645,704,204,7901,354929,700
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-3b-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CloudDeployment-PT-3b-LTLCardinality-01 finished in 43428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((F(p2)||p1))||F(p3)||p0))))'
Support contains 6 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 571 transition count 809
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 571 transition count 809
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 565 transition count 803
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 565 transition count 803
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 565 transition count 801
Applied a total of 44 rules in 30 ms. Remains 565 /586 variables (removed 21) and now considering 801/824 (removed 23) transitions.
// Phase 1: matrix 801 rows 565 cols
[2024-05-21 03:22:13] [INFO ] Computed 8 invariants in 11 ms
[2024-05-21 03:22:13] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 03:22:13] [INFO ] Invariant cache hit.
[2024-05-21 03:22:14] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-21 03:22:14] [INFO ] Invariant cache hit.
[2024-05-21 03:22:14] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 565/586 places, 801/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 828 ms. Remains : 565/586 places, 801/824 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND p0 (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s408 0) (EQ s8 0) (EQ s14 1)), p3:(EQ s361 0), p1:(OR (EQ s381 0) (EQ s345 1)), p2:(OR (EQ s8 0) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1027 reset in 158 ms.
Product exploration explored 100000 steps with 1052 reset in 203 ms.
Computed a total of 81 stabilizing places and 202 stable transitions
Graph (complete) has 1462 edges and 565 vertex of which 554 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Computed a total of 81 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND p0 (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 104 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 03:22:15] [INFO ] Invariant cache hit.
[2024-05-21 03:22:15] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 03:22:15] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-21 03:22:16] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 03:22:16] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-21 03:22:16] [INFO ] After 803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 28 ms.
Support contains 6 out of 565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 565/565 places, 801/801 transitions.
Graph (trivial) has 581 edges and 565 vertex of which 213 / 565 are part of one of the 24 SCC in 0 ms
Free SCC test removed 189 places
Drop transitions removed 243 transitions
Reduce isomorphic transitions removed 243 transitions.
Graph (complete) has 1138 edges and 376 vertex of which 365 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 365 transition count 394
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 1 with 152 rules applied. Total rules applied 318 place count 213 transition count 394
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 318 place count 213 transition count 363
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 380 place count 182 transition count 363
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 383 place count 179 transition count 360
Iterating global reduction 2 with 3 rules applied. Total rules applied 386 place count 179 transition count 360
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 386 place count 179 transition count 357
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 392 place count 176 transition count 357
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 492 place count 126 transition count 307
Performed 20 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 532 place count 106 transition count 379
Drop transitions removed 6 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 550 place count 106 transition count 361
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 3 with 46 rules applied. Total rules applied 596 place count 106 transition count 315
Free-agglomeration rule applied 30 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 626 place count 106 transition count 279
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 29 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 439 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 78 rules applied. Total rules applied 704 place count 75 transition count 232
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 705 place count 75 transition count 231
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 708 place count 72 transition count 218
Iterating global reduction 5 with 3 rules applied. Total rules applied 711 place count 72 transition count 218
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 723 place count 72 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 724 place count 71 transition count 205
Applied a total of 724 rules in 44 ms. Remains 71 /565 variables (removed 494) and now considering 205/801 (removed 596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 71/565 places, 205/801 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 03:22:16] [INFO ] Flow matrix only has 135 transitions (discarded 70 similar events)
// Phase 1: matrix 135 rows 71 cols
[2024-05-21 03:22:16] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 03:22:16] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 03:22:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 03:22:16] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-21 03:22:16] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 03:22:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 03:22:16] [INFO ] After 16ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 03:22:17] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-21 03:22:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2024-05-21 03:22:17] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2024-05-21 03:22:17] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (G (NOT (AND (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND p0 (NOT p3)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 14 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLCardinality-02 finished in 3371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 568 transition count 806
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 568 transition count 806
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 560 transition count 798
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 560 transition count 798
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 560 transition count 795
Applied a total of 55 rules in 32 ms. Remains 560 /586 variables (removed 26) and now considering 795/824 (removed 29) transitions.
// Phase 1: matrix 795 rows 560 cols
[2024-05-21 03:22:17] [INFO ] Computed 8 invariants in 8 ms
[2024-05-21 03:22:17] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 03:22:17] [INFO ] Invariant cache hit.
[2024-05-21 03:22:17] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-21 03:22:17] [INFO ] Invariant cache hit.
[2024-05-21 03:22:17] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 560/586 places, 795/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 847 ms. Remains : 560/586 places, 795/824 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s391 0) (NEQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-03 finished in 956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 567 transition count 805
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 567 transition count 805
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 560 transition count 798
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 560 transition count 798
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 560 transition count 795
Applied a total of 55 rules in 29 ms. Remains 560 /586 variables (removed 26) and now considering 795/824 (removed 29) transitions.
// Phase 1: matrix 795 rows 560 cols
[2024-05-21 03:22:18] [INFO ] Computed 8 invariants in 8 ms
[2024-05-21 03:22:18] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 03:22:18] [INFO ] Invariant cache hit.
[2024-05-21 03:22:18] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-21 03:22:18] [INFO ] Invariant cache hit.
[2024-05-21 03:22:18] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 560/586 places, 795/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 822 ms. Remains : 560/586 places, 795/824 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s208 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 515 ms.
Product exploration explored 100000 steps with 50000 reset in 478 ms.
Computed a total of 80 stabilizing places and 201 stable transitions
Graph (complete) has 1455 edges and 560 vertex of which 549 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Computed a total of 80 stabilizing places and 201 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLCardinality-05 finished in 2029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&(p1||F(G(!p0))))))'
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Graph (trivial) has 605 edges and 586 vertex of which 214 / 586 are part of one of the 24 SCC in 0 ms
Free SCC test removed 190 places
Ensure Unique test removed 217 transitions
Reduce isomorphic transitions removed 217 transitions.
Graph (complete) has 1247 edges and 396 vertex of which 385 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 384 transition count 441
Reduce places removed 162 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 164 rules applied. Total rules applied 328 place count 222 transition count 439
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 330 place count 220 transition count 439
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 330 place count 220 transition count 414
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 380 place count 195 transition count 414
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 390 place count 185 transition count 404
Iterating global reduction 3 with 10 rules applied. Total rules applied 400 place count 185 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 401 place count 185 transition count 403
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 401 place count 185 transition count 399
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 409 place count 181 transition count 399
Performed 56 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 521 place count 125 transition count 341
Performed 17 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 555 place count 108 transition count 396
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 567 place count 108 transition count 384
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 598 place count 108 transition count 353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 599 place count 107 transition count 352
Applied a total of 599 rules in 57 ms. Remains 107 /586 variables (removed 479) and now considering 352/824 (removed 472) transitions.
[2024-05-21 03:22:20] [INFO ] Flow matrix only has 281 transitions (discarded 71 similar events)
// Phase 1: matrix 281 rows 107 cols
[2024-05-21 03:22:20] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 03:22:20] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 03:22:20] [INFO ] Flow matrix only has 281 transitions (discarded 71 similar events)
[2024-05-21 03:22:20] [INFO ] Invariant cache hit.
[2024-05-21 03:22:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 03:22:20] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-21 03:22:20] [INFO ] Redundant transitions in 200 ms returned []
[2024-05-21 03:22:20] [INFO ] Flow matrix only has 281 transitions (discarded 71 similar events)
[2024-05-21 03:22:20] [INFO ] Invariant cache hit.
[2024-05-21 03:22:20] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/586 places, 352/824 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 573 ms. Remains : 107/586 places, 352/824 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), false]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s43 0) (EQ s27 1)), p0:(AND (NEQ s86 0) (NEQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-07 finished in 750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X((G(p1)&&F(G(p2))))))'
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 569 transition count 807
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 569 transition count 807
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 562 transition count 800
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 562 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 562 transition count 797
Applied a total of 51 rules in 30 ms. Remains 562 /586 variables (removed 24) and now considering 797/824 (removed 27) transitions.
// Phase 1: matrix 797 rows 562 cols
[2024-05-21 03:22:20] [INFO ] Computed 8 invariants in 7 ms
[2024-05-21 03:22:20] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 03:22:20] [INFO ] Invariant cache hit.
[2024-05-21 03:22:21] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-21 03:22:21] [INFO ] Invariant cache hit.
[2024-05-21 03:22:21] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 562/586 places, 797/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 562/586 places, 797/824 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s378 0) (EQ s142 1)), p0:(EQ s316 1), p2:(OR (EQ s34 0) (EQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1052 reset in 141 ms.
Product exploration explored 100000 steps with 1039 reset in 194 ms.
Computed a total of 81 stabilizing places and 202 stable transitions
Graph (complete) has 1456 edges and 562 vertex of which 551 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Computed a total of 81 stabilizing places and 202 stable transitions
Detected a total of 81/562 stabilizing places and 202/797 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p2)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 173 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 107 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:22:22] [INFO ] Invariant cache hit.
[2024-05-21 03:22:22] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:22:22] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-21 03:22:23] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:22:23] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-21 03:22:23] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 797/797 transitions.
Graph (trivial) has 585 edges and 562 vertex of which 204 / 562 are part of one of the 23 SCC in 0 ms
Free SCC test removed 181 places
Drop transitions removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Graph (complete) has 1160 edges and 381 vertex of which 370 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 173 rules applied. Total rules applied 175 place count 370 transition count 391
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 162 rules applied. Total rules applied 337 place count 209 transition count 390
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 337 place count 209 transition count 358
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 401 place count 177 transition count 358
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 404 place count 174 transition count 355
Iterating global reduction 2 with 3 rules applied. Total rules applied 407 place count 174 transition count 355
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 407 place count 174 transition count 352
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 413 place count 171 transition count 352
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 511 place count 122 transition count 303
Performed 21 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 553 place count 101 transition count 373
Drop transitions removed 5 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 566 place count 101 transition count 360
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 600 place count 101 transition count 326
Free-agglomeration rule applied 29 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 629 place count 101 transition count 291
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (complete) has 439 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 72 rules applied. Total rules applied 701 place count 71 transition count 249
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 702 place count 71 transition count 248
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 707 place count 66 transition count 228
Iterating global reduction 5 with 5 rules applied. Total rules applied 712 place count 66 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 714 place count 66 transition count 226
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 6 with 44 rules applied. Total rules applied 758 place count 66 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 759 place count 65 transition count 181
Applied a total of 759 rules in 40 ms. Remains 65 /562 variables (removed 497) and now considering 181/797 (removed 616) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 65/562 places, 181/797 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 211892 steps, run visited all 1 properties in 240 ms. (steps per millisecond=882 )
Probabilistic random walk after 211892 steps, saw 30396 distinct states, run finished after 240 ms. (steps per millisecond=882 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p2)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 12 factoid took 466 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 5 out of 562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 797/797 transitions.
Applied a total of 0 rules in 17 ms. Remains 562 /562 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2024-05-21 03:22:24] [INFO ] Invariant cache hit.
[2024-05-21 03:22:24] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 03:22:24] [INFO ] Invariant cache hit.
[2024-05-21 03:22:24] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-21 03:22:24] [INFO ] Invariant cache hit.
[2024-05-21 03:22:25] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 772 ms. Remains : 562/562 places, 797/797 transitions.
Computed a total of 81 stabilizing places and 202 stable transitions
Graph (complete) has 1456 edges and 562 vertex of which 551 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Computed a total of 81 stabilizing places and 202 stable transitions
Detected a total of 81/562 stabilizing places and 202/797 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 137 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 103 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:22:25] [INFO ] Invariant cache hit.
[2024-05-21 03:22:25] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:22:25] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-21 03:22:25] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:22:25] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-21 03:22:25] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 797/797 transitions.
Graph (trivial) has 585 edges and 562 vertex of which 204 / 562 are part of one of the 23 SCC in 0 ms
Free SCC test removed 181 places
Drop transitions removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Graph (complete) has 1160 edges and 381 vertex of which 370 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 173 rules applied. Total rules applied 175 place count 370 transition count 391
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 162 rules applied. Total rules applied 337 place count 209 transition count 390
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 337 place count 209 transition count 358
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 401 place count 177 transition count 358
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 404 place count 174 transition count 355
Iterating global reduction 2 with 3 rules applied. Total rules applied 407 place count 174 transition count 355
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 407 place count 174 transition count 352
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 413 place count 171 transition count 352
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 511 place count 122 transition count 303
Performed 21 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 553 place count 101 transition count 373
Drop transitions removed 5 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 566 place count 101 transition count 360
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 600 place count 101 transition count 326
Free-agglomeration rule applied 29 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 629 place count 101 transition count 291
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (complete) has 439 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 72 rules applied. Total rules applied 701 place count 71 transition count 249
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 702 place count 71 transition count 248
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 707 place count 66 transition count 228
Iterating global reduction 5 with 5 rules applied. Total rules applied 712 place count 66 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 714 place count 66 transition count 226
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 6 with 44 rules applied. Total rules applied 758 place count 66 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 759 place count 65 transition count 181
Applied a total of 759 rules in 40 ms. Remains 65 /562 variables (removed 497) and now considering 181/797 (removed 616) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 65/562 places, 181/797 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 211892 steps, run visited all 1 properties in 231 ms. (steps per millisecond=917 )
Probabilistic random walk after 211892 steps, saw 30396 distinct states, run finished after 233 ms. (steps per millisecond=909 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 370 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Product exploration explored 100000 steps with 1041 reset in 137 ms.
Product exploration explored 100000 steps with 1072 reset in 148 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 5 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 797/797 transitions.
Graph (trivial) has 581 edges and 562 vertex of which 204 / 562 are part of one of the 23 SCC in 1 ms
Free SCC test removed 181 places
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Graph (complete) has 1217 edges and 381 vertex of which 370 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 156 rules applied. Total rules applied 158 place count 370 transition count 587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 159 place count 370 transition count 586
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 159 place count 370 transition count 602
Deduced a syphon composed of 175 places in 1 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 178 place count 370 transition count 602
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 259 place count 289 transition count 521
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 340 place count 289 transition count 521
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 2 with 62 rules applied. Total rules applied 402 place count 289 transition count 524
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 449 place count 242 transition count 477
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 496 place count 242 transition count 477
Performed 21 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 517 place count 242 transition count 625
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 532 place count 242 transition count 610
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 558 place count 216 transition count 528
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 584 place count 216 transition count 528
Deduced a syphon composed of 104 places in 0 ms
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 616 place count 216 transition count 496
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 619 place count 213 transition count 493
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 622 place count 213 transition count 493
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 213 transition count 511
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 625 place count 211 transition count 503
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 627 place count 211 transition count 503
Deduced a syphon composed of 100 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 630 place count 211 transition count 500
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 630 rules in 89 ms. Remains 211 /562 variables (removed 351) and now considering 500/797 (removed 297) transitions.
[2024-05-21 03:22:28] [INFO ] Redundant transitions in 174 ms returned []
[2024-05-21 03:22:28] [INFO ] Flow matrix only has 430 transitions (discarded 70 similar events)
// Phase 1: matrix 430 rows 211 cols
[2024-05-21 03:22:28] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 03:22:28] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 211/562 places, 500/797 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 424 ms. Remains : 211/562 places, 500/797 transitions.
Built C files in :
/tmp/ltsmin12179741903597163902
[2024-05-21 03:22:28] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12179741903597163902
Running compilation step : cd /tmp/ltsmin12179741903597163902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1268 ms.
Running link step : cd /tmp/ltsmin12179741903597163902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12179741903597163902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3451904448657650219.hoa' '--buchi-type=spotba'
LTSmin run took 812 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-3b-LTLCardinality-12 finished in 9742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 4 out of 586 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 586/586 places, 824/824 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 568 transition count 806
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 568 transition count 806
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 561 transition count 799
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 561 transition count 799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 561 transition count 797
Applied a total of 52 rules in 31 ms. Remains 561 /586 variables (removed 25) and now considering 797/824 (removed 27) transitions.
// Phase 1: matrix 797 rows 561 cols
[2024-05-21 03:22:30] [INFO ] Computed 8 invariants in 9 ms
[2024-05-21 03:22:30] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 03:22:30] [INFO ] Invariant cache hit.
[2024-05-21 03:22:31] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-21 03:22:31] [INFO ] Invariant cache hit.
[2024-05-21 03:22:31] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 561/586 places, 797/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 768 ms. Remains : 561/586 places, 797/824 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CloudDeployment-PT-3b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s371 1) (EQ s187 1)), p1:(AND (EQ s169 0) (EQ s177 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLCardinality-13 finished in 957 ms.
All properties solved by simple procedures.
Total runtime 68105 ms.

BK_STOP 1716261752519

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-3b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is CloudDeployment-PT-3b, 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 r087-tall-171620522000352"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-3b.tgz
mv CloudDeployment-PT-3b 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 ;