fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r069-smll-167814396300388
Last Updated
May 14, 2023

About the Execution of ITS-Tools for CloudDeployment-PT-3b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
521.012 50237.00 90080.00 773.80 FFTFTFFFFFFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r069-smll-167814396300388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CloudDeployment-PT-3b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396300388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 14:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 308K Mar 5 18:22 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-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-3b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678438469023

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-3b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 08:54:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 08:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 08:54:33] [INFO ] Load time of PNML (sax parser for PT used): 257 ms
[2023-03-10 08:54:33] [INFO ] Transformed 859 places.
[2023-03-10 08:54:33] [INFO ] Transformed 1152 transitions.
[2023-03-10 08:54:33] [INFO ] Found NUPN structural information;
[2023-03-10 08:54:33] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 440 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudDeployment-PT-3b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-3b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 859 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 856 transition count 1152
Discarding 199 places :
Symmetric choice reduction at 1 with 199 rule applications. Total rules 202 place count 657 transition count 953
Iterating global reduction 1 with 199 rules applied. Total rules applied 401 place count 657 transition count 953
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 471 place count 587 transition count 883
Iterating global reduction 1 with 70 rules applied. Total rules applied 541 place count 587 transition count 883
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 546 place count 587 transition count 878
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 555 place count 578 transition count 869
Iterating global reduction 2 with 9 rules applied. Total rules applied 564 place count 578 transition count 869
Applied a total of 564 rules in 374 ms. Remains 578 /859 variables (removed 281) and now considering 869/1152 (removed 283) transitions.
// Phase 1: matrix 869 rows 578 cols
[2023-03-10 08:54:33] [INFO ] Computed 10 place invariants in 54 ms
[2023-03-10 08:54:34] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-10 08:54:34] [INFO ] Invariant cache hit.
[2023-03-10 08:54:35] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
[2023-03-10 08:54:35] [INFO ] Invariant cache hit.
[2023-03-10 08:54:36] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/859 places, 869/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3195 ms. Remains : 578/859 places, 869/1152 transitions.
Support contains 50 out of 578 places after structural reductions.
[2023-03-10 08:54:37] [INFO ] Flatten gal took : 256 ms
[2023-03-10 08:54:37] [INFO ] Flatten gal took : 88 ms
[2023-03-10 08:54:37] [INFO ] Input system was already deterministic with 869 transitions.
Support contains 48 out of 578 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 903 ms. (steps per millisecond=11 ) properties (out of 31) seen :18
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-10 08:54:39] [INFO ] Invariant cache hit.
[2023-03-10 08:54:39] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-10 08:54:40] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 9 ms returned sat
[2023-03-10 08:54:41] [INFO ] After 1474ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2023-03-10 08:54:42] [INFO ] After 2536ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :11
Attempting to minimize the solution found.
Minimization took 712 ms.
[2023-03-10 08:54:43] [INFO ] After 3937ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
Fused 13 Parikh solutions to 9 different solutions.
Parikh walk visited 8 properties in 153 ms.
Support contains 6 out of 578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 869/869 transitions.
Graph (trivial) has 585 edges and 578 vertex of which 196 / 578 are part of one of the 23 SCC in 9 ms
Free SCC test removed 173 places
Drop transitions removed 284 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 285 transitions.
Graph (complete) has 1222 edges and 405 vertex of which 387 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.5 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 173 rules applied. Total rules applied 175 place count 387 transition count 411
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 166 rules applied. Total rules applied 341 place count 224 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 343 place count 222 transition count 408
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 343 place count 222 transition count 373
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 413 place count 187 transition count 373
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 421 place count 179 transition count 365
Iterating global reduction 3 with 8 rules applied. Total rules applied 429 place count 179 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 430 place count 179 transition count 364
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 430 place count 179 transition count 361
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 436 place count 176 transition count 361
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 540 place count 124 transition count 309
Performed 23 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 586 place count 101 transition count 395
Drop transitions removed 6 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 608 place count 101 transition count 373
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 658 place count 101 transition count 323
Free-agglomeration rule applied 24 times with reduction of 2 identical transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 682 place count 101 transition count 297
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 5 with 57 rules applied. Total rules applied 739 place count 77 transition count 264
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 743 place count 73 transition count 248
Iterating global reduction 6 with 4 rules applied. Total rules applied 747 place count 73 transition count 248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 749 place count 73 transition count 246
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 768 place count 73 transition count 227
Applied a total of 768 rules in 270 ms. Remains 73 /578 variables (removed 505) and now considering 227/869 (removed 642) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 73/578 places, 227/869 transitions.
Incomplete random walk after 10000 steps, including 251 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 08:54:44] [INFO ] Flow matrix only has 151 transitions (discarded 76 similar events)
// Phase 1: matrix 151 rows 73 cols
[2023-03-10 08:54:44] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 08:54:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 08:54:44] [INFO ] [Real]Absence check using 3 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-10 08:54:44] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 08:54:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 08:54:44] [INFO ] [Nat]Absence check using 3 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-10 08:54:44] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 08:54:44] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-10 08:54:44] [INFO ] After 72ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 08:54:44] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-10 08:54:44] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 227/227 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 71 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 71 transition count 225
Applied a total of 4 rules in 25 ms. Remains 71 /73 variables (removed 2) and now considering 225/227 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 71/73 places, 225/227 transitions.
Incomplete random walk after 10000 steps, including 251 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1003985 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1003985 steps, saw 137797 distinct states, run finished after 3003 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 08:54:48] [INFO ] Flow matrix only has 149 transitions (discarded 76 similar events)
// Phase 1: matrix 149 rows 71 cols
[2023-03-10 08:54:48] [INFO ] Computed 10 place invariants in 8 ms
[2023-03-10 08:54:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 08:54:48] [INFO ] [Real]Absence check using 3 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-10 08:54:48] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 08:54:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 08:54:48] [INFO ] [Nat]Absence check using 3 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-10 08:54:48] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 08:54:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-10 08:54:48] [INFO ] After 47ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 08:54:48] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-10 08:54:48] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 225/225 transitions.
Applied a total of 0 rules in 12 ms. Remains 71 /71 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 71/71 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 225/225 transitions.
Applied a total of 0 rules in 11 ms. Remains 71 /71 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-10 08:54:48] [INFO ] Flow matrix only has 149 transitions (discarded 76 similar events)
[2023-03-10 08:54:48] [INFO ] Invariant cache hit.
[2023-03-10 08:54:48] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 08:54:48] [INFO ] Flow matrix only has 149 transitions (discarded 76 similar events)
[2023-03-10 08:54:48] [INFO ] Invariant cache hit.
[2023-03-10 08:54:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-10 08:54:49] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-10 08:54:49] [INFO ] Redundant transitions in 262 ms returned []
[2023-03-10 08:54:49] [INFO ] Flow matrix only has 149 transitions (discarded 76 similar events)
[2023-03-10 08:54:49] [INFO ] Invariant cache hit.
[2023-03-10 08:54:49] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 876 ms. Remains : 71/71 places, 225/225 transitions.
Graph (trivial) has 54 edges and 71 vertex of which 16 / 71 are part of one of the 2 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions removed 22 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 98 transitions.
Ensure Unique test removed 3 places
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 6 rules applied. Total rules applied 7 place count 54 transition count 124
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 51 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 50 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 13 place count 50 transition count 118
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 21 place count 46 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 45 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 45 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 44 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 44 transition count 113
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 39 place count 44 transition count 99
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 47 place count 40 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 51 place count 40 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 57 place count 37 transition count 110
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 72 place count 37 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 76 place count 35 transition count 93
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 77 place count 34 transition count 88
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 34 transition count 88
Applied a total of 78 rules in 39 ms. Remains 34 /71 variables (removed 37) and now considering 88/225 (removed 137) transitions.
Running SMT prover for 2 properties.
[2023-03-10 08:54:49] [INFO ] Flow matrix only has 83 transitions (discarded 5 similar events)
// Phase 1: matrix 83 rows 34 cols
[2023-03-10 08:54:49] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 08:54:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 08:54:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 08:54:49] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 08:54:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 08:54:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-10 08:54:49] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 08:54:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 08:54:49] [INFO ] After 26ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 08:54:49] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-10 08:54:49] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 95 stabilizing places and 271 stable transitions
Graph (complete) has 1504 edges and 578 vertex of which 560 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.22 ms
FORMULA CloudDeployment-PT-3b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 577 transition count 869
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 560 transition count 795
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 560 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 560 transition count 794
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 558 transition count 792
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 558 transition count 792
Applied a total of 40 rules in 63 ms. Remains 558 /578 variables (removed 20) and now considering 792/869 (removed 77) transitions.
// Phase 1: matrix 792 rows 558 cols
[2023-03-10 08:54:50] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-10 08:54:50] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-10 08:54:50] [INFO ] Invariant cache hit.
[2023-03-10 08:54:51] [INFO ] Implicit Places using invariants and state equation in 882 ms returned [9, 17, 183, 191, 356, 364]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1102 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 552/578 places, 792/869 transitions.
Applied a total of 0 rules in 17 ms. Remains 552 /552 variables (removed 0) and now considering 792/792 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1183 ms. Remains : 552/578 places, 792/869 transitions.
Stuttering acceptance computed with spot in 438 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-00 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:(EQ s372 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 3 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-00 finished in 1730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 577 transition count 869
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 561 transition count 796
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 561 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 561 transition count 795
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 559 transition count 793
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 559 transition count 793
Applied a total of 38 rules in 66 ms. Remains 559 /578 variables (removed 19) and now considering 793/869 (removed 76) transitions.
// Phase 1: matrix 793 rows 559 cols
[2023-03-10 08:54:52] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-10 08:54:52] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-10 08:54:52] [INFO ] Invariant cache hit.
[2023-03-10 08:54:53] [INFO ] Implicit Places using invariants and state equation in 981 ms returned [9, 17, 184, 192, 357, 365]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1264 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 553/578 places, 793/869 transitions.
Applied a total of 0 rules in 21 ms. Remains 553 /553 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1351 ms. Remains : 553/578 places, 793/869 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s20 0)], 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 898 ms.
Product exploration explored 100000 steps with 33333 reset in 455 ms.
Computed a total of 80 stabilizing places and 200 stable transitions
Graph (complete) has 1399 edges and 553 vertex of which 548 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 ms
Computed a total of 80 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLFireability-02 finished in 2980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(!p1 U (p2||G(!p1))))))'
Support contains 7 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 577 transition count 869
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 561 transition count 796
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 561 transition count 796
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 559 transition count 794
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 559 transition count 794
Applied a total of 37 rules in 35 ms. Remains 559 /578 variables (removed 19) and now considering 794/869 (removed 75) transitions.
// Phase 1: matrix 794 rows 559 cols
[2023-03-10 08:54:55] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-10 08:54:55] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-10 08:54:55] [INFO ] Invariant cache hit.
[2023-03-10 08:54:56] [INFO ] Implicit Places using invariants and state equation in 967 ms returned [9, 17, 183, 192, 357, 365]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1162 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 553/578 places, 794/869 transitions.
Applied a total of 0 rules in 17 ms. Remains 553 /553 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1216 ms. Remains : 553/578 places, 794/869 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NEQ s184 1) (NOT (AND (EQ s12 1) (EQ s28 1) (EQ s88 1) (EQ s538 1) (EQ s549 1)))), p1:(AND (EQ s12 1) (EQ s28 1) (EQ s88 1) (EQ s538 1) (EQ s549 ...], 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 50000 reset in 767 ms.
Product exploration explored 100000 steps with 50000 reset in 745 ms.
Computed a total of 80 stabilizing places and 200 stable transitions
Graph (complete) has 1399 edges and 553 vertex of which 548 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 ms
Computed a total of 80 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p1)))
Knowledge based reduction with 9 factoid took 211 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-3b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-3b-LTLFireability-04 finished in 3213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||G(p1)||X(p2))))'
Support contains 3 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 577 transition count 869
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 561 transition count 796
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 561 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 561 transition count 795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 560 transition count 794
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 560 transition count 794
Applied a total of 36 rules in 42 ms. Remains 560 /578 variables (removed 18) and now considering 794/869 (removed 75) transitions.
// Phase 1: matrix 794 rows 560 cols
[2023-03-10 08:54:58] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-10 08:54:58] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-10 08:54:58] [INFO ] Invariant cache hit.
[2023-03-10 08:54:59] [INFO ] Implicit Places using invariants and state equation in 948 ms returned [9, 17, 183, 191, 356, 364]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1199 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 554/578 places, 794/869 transitions.
Applied a total of 0 rules in 20 ms. Remains 554 /554 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1261 ms. Remains : 554/578 places, 794/869 transitions.
Stuttering acceptance computed with spot in 497 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(EQ s338 0), p1:(EQ s196 1), p2:(EQ s526 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 216 steps with 1 reset in 1 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-05 finished in 1785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(G(p0))&&G(p1)))||(!p2 U G(p3))))'
Support contains 7 out of 578 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Graph (trivial) has 576 edges and 578 vertex of which 179 / 578 are part of one of the 22 SCC in 3 ms
Free SCC test removed 157 places
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Graph (complete) has 1307 edges and 421 vertex of which 403 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.5 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions removed 65 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 403 transition count 464
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 169 rules applied. Total rules applied 333 place count 241 transition count 457
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 340 place count 235 transition count 456
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 340 place count 235 transition count 422
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 408 place count 201 transition count 422
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 414 place count 195 transition count 416
Iterating global reduction 3 with 6 rules applied. Total rules applied 420 place count 195 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 421 place count 195 transition count 415
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 422 place count 194 transition count 414
Iterating global reduction 4 with 1 rules applied. Total rules applied 423 place count 194 transition count 414
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 547 place count 132 transition count 352
Performed 21 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 589 place count 111 transition count 432
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 612 place count 111 transition count 409
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 640 place count 111 transition count 381
Applied a total of 640 rules in 137 ms. Remains 111 /578 variables (removed 467) and now considering 381/869 (removed 488) transitions.
[2023-03-10 08:55:00] [INFO ] Flow matrix only has 306 transitions (discarded 75 similar events)
// Phase 1: matrix 306 rows 111 cols
[2023-03-10 08:55:00] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-10 08:55:00] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-10 08:55:00] [INFO ] Flow matrix only has 306 transitions (discarded 75 similar events)
[2023-03-10 08:55:00] [INFO ] Invariant cache hit.
[2023-03-10 08:55:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 08:55:00] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2023-03-10 08:55:01] [INFO ] Redundant transitions in 604 ms returned []
[2023-03-10 08:55:01] [INFO ] Flow matrix only has 306 transitions (discarded 75 similar events)
[2023-03-10 08:55:01] [INFO ] Invariant cache hit.
[2023-03-10 08:55:01] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/578 places, 381/869 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1479 ms. Remains : 111/578 places, 381/869 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p3 (NOT p2) p1), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={2} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0, 2} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=0 dest: 5}, { cond=(AND p3 p2), acceptance={} source=0 dest: 6}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={1, 2} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p3 (NOT p2) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={2} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=1 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p3 p2), acceptance={} source=1 dest: 6}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={1, 2} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p3 (NOT p2) p1), acceptance={2} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0, 2} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=2 dest: 5}, { cond=(AND p3 p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1, 2} source=3 dest: 3}, { cond=p1, acceptance={0, 1, 2} source=3 dest: 4}, { cond=p1, acceptance={0, 2} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=p0, acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1, 2} source=5 dest: 3}, { cond=p1, acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s24 1), p2:(AND (EQ s4 1) (EQ s10 1) (EQ s29 1) (EQ s102 1) (EQ s109 1)), p1:(OR (EQ s4 0) (EQ s10 0) (EQ s29 0) (EQ s102 0) (EQ s109 0)), p0:(EQ s...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 209 steps with 9 reset in 6 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-06 finished in 1883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 577 transition count 869
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 561 transition count 796
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 561 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 561 transition count 795
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 559 transition count 793
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 559 transition count 793
Applied a total of 38 rules in 38 ms. Remains 559 /578 variables (removed 19) and now considering 793/869 (removed 76) transitions.
// Phase 1: matrix 793 rows 559 cols
[2023-03-10 08:55:02] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-10 08:55:02] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-10 08:55:02] [INFO ] Invariant cache hit.
[2023-03-10 08:55:03] [INFO ] Implicit Places using invariants and state equation in 798 ms returned [9, 17, 183, 191, 356, 364]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1039 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 553/578 places, 793/869 transitions.
Applied a total of 0 rules in 14 ms. Remains 553 /553 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1093 ms. Remains : 553/578 places, 793/869 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s538 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]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-08 finished in 1220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 578 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Graph (trivial) has 595 edges and 578 vertex of which 202 / 578 are part of one of the 24 SCC in 1 ms
Free SCC test removed 178 places
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Graph (complete) has 1267 edges and 400 vertex of which 382 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions removed 65 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 381 transition count 441
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 322 place count 221 transition count 441
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 322 place count 221 transition count 411
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 382 place count 191 transition count 411
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 387 place count 186 transition count 406
Iterating global reduction 2 with 5 rules applied. Total rules applied 392 place count 186 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 393 place count 186 transition count 405
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 394 place count 185 transition count 404
Iterating global reduction 3 with 1 rules applied. Total rules applied 395 place count 185 transition count 404
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 515 place count 125 transition count 344
Performed 20 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 555 place count 105 transition count 421
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 577 place count 105 transition count 399
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 4 with 53 rules applied. Total rules applied 630 place count 105 transition count 346
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 631 place count 104 transition count 345
Applied a total of 631 rules in 103 ms. Remains 104 /578 variables (removed 474) and now considering 345/869 (removed 524) transitions.
[2023-03-10 08:55:03] [INFO ] Flow matrix only has 268 transitions (discarded 77 similar events)
// Phase 1: matrix 268 rows 104 cols
[2023-03-10 08:55:03] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-10 08:55:03] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-10 08:55:03] [INFO ] Flow matrix only has 268 transitions (discarded 77 similar events)
[2023-03-10 08:55:03] [INFO ] Invariant cache hit.
[2023-03-10 08:55:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 08:55:03] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-10 08:55:04] [INFO ] Redundant transitions in 384 ms returned []
[2023-03-10 08:55:04] [INFO ] Flow matrix only has 268 transitions (discarded 77 similar events)
[2023-03-10 08:55:04] [INFO ] Invariant cache hit.
[2023-03-10 08:55:04] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/578 places, 345/869 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1166 ms. Remains : 104/578 places, 345/869 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-09 finished in 1292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((F(G(p2))&&p1))))'
Support contains 4 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 577 transition count 869
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 563 transition count 798
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 563 transition count 798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 563 transition count 797
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 561 transition count 795
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 561 transition count 795
Applied a total of 34 rules in 38 ms. Remains 561 /578 variables (removed 17) and now considering 795/869 (removed 74) transitions.
// Phase 1: matrix 795 rows 561 cols
[2023-03-10 08:55:04] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-10 08:55:04] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-10 08:55:04] [INFO ] Invariant cache hit.
[2023-03-10 08:55:05] [INFO ] Implicit Places using invariants and state equation in 625 ms returned [9, 17, 183, 191, 359, 367]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 816 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 555/578 places, 795/869 transitions.
Applied a total of 0 rules in 10 ms. Remains 555 /555 variables (removed 0) and now considering 795/795 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 866 ms. Remains : 555/578 places, 795/869 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s206 0) (EQ s212 0)), p0:(EQ s260 1), p2:(EQ s308 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-10 finished in 1120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 578 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Graph (trivial) has 592 edges and 578 vertex of which 213 / 578 are part of one of the 24 SCC in 1 ms
Free SCC test removed 189 places
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Graph (complete) has 1251 edges and 389 vertex of which 371 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions removed 65 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 158 place count 370 transition count 431
Reduce places removed 156 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 157 rules applied. Total rules applied 315 place count 214 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 316 place count 213 transition count 430
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 316 place count 213 transition count 403
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 370 place count 186 transition count 403
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 375 place count 181 transition count 398
Iterating global reduction 3 with 5 rules applied. Total rules applied 380 place count 181 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 381 place count 181 transition count 397
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 382 place count 180 transition count 396
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 180 transition count 396
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 499 place count 122 transition count 338
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 533 place count 105 transition count 402
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 548 place count 105 transition count 387
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 5 with 43 rules applied. Total rules applied 591 place count 105 transition count 344
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 592 place count 104 transition count 343
Applied a total of 592 rules in 77 ms. Remains 104 /578 variables (removed 474) and now considering 343/869 (removed 526) transitions.
[2023-03-10 08:55:05] [INFO ] Flow matrix only has 266 transitions (discarded 77 similar events)
// Phase 1: matrix 266 rows 104 cols
[2023-03-10 08:55:05] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 08:55:05] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-10 08:55:05] [INFO ] Flow matrix only has 266 transitions (discarded 77 similar events)
[2023-03-10 08:55:05] [INFO ] Invariant cache hit.
[2023-03-10 08:55:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 08:55:06] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-10 08:55:06] [INFO ] Redundant transitions in 362 ms returned []
[2023-03-10 08:55:06] [INFO ] Flow matrix only has 266 transitions (discarded 77 similar events)
[2023-03-10 08:55:06] [INFO ] Invariant cache hit.
[2023-03-10 08:55:06] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/578 places, 343/869 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1054 ms. Remains : 104/578 places, 343/869 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s78 1), p1:(EQ s83 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 0 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-12 finished in 1231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(p2)||p1)&&p0))))'
Support contains 8 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 577 transition count 869
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 561 transition count 796
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 561 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 561 transition count 795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 560 transition count 794
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 560 transition count 794
Applied a total of 36 rules in 49 ms. Remains 560 /578 variables (removed 18) and now considering 794/869 (removed 75) transitions.
// Phase 1: matrix 794 rows 560 cols
[2023-03-10 08:55:06] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-10 08:55:07] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-10 08:55:07] [INFO ] Invariant cache hit.
[2023-03-10 08:55:08] [INFO ] Implicit Places using invariants and state equation in 942 ms returned [9, 17, 183, 191, 358, 366]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1227 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 554/578 places, 794/869 transitions.
Applied a total of 0 rules in 17 ms. Remains 554 /554 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1295 ms. Remains : 554/578 places, 794/869 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s84 1) (EQ s373 1) (EQ s463 1)), p1:(OR (EQ s318 1) (AND (EQ s357 1) (EQ s432 1) (EQ s539 1) (EQ s550 1))), p2:(EQ s318 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 173 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-13 finished in 1523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((G(F(!p0))||(!p1&&F(!p0)))))||(F(G(p2))&&F((G(F(!p0))||(!p1&&F(!p0))))))))'
Support contains 4 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 577 transition count 869
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 561 transition count 796
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 561 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 561 transition count 795
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 559 transition count 793
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 559 transition count 793
Applied a total of 38 rules in 58 ms. Remains 559 /578 variables (removed 19) and now considering 793/869 (removed 76) transitions.
// Phase 1: matrix 793 rows 559 cols
[2023-03-10 08:55:08] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-10 08:55:08] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-10 08:55:08] [INFO ] Invariant cache hit.
[2023-03-10 08:55:09] [INFO ] Implicit Places using invariants and state equation in 888 ms returned [9, 17, 183, 191, 356, 364]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1167 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 553/578 places, 793/869 transitions.
Applied a total of 0 rules in 15 ms. Remains 553 /553 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1244 ms. Remains : 553/578 places, 793/869 transitions.
Stuttering acceptance computed with spot in 363 ms :[p0, p0, (AND p0 (NOT p2)), p0, p0, (AND p0 (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s382 1) (AND (EQ s10 1) (EQ s106 1))), p0:(AND (EQ s10 1) (EQ s106 1)), p2:(NEQ s18 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 335 ms.
Product exploration explored 100000 steps with 1036 reset in 290 ms.
Computed a total of 81 stabilizing places and 201 stable transitions
Graph (complete) has 1400 edges and 553 vertex of which 548 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 81 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 424 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 105 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 793 rows 553 cols
[2023-03-10 08:55:11] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 08:55:11] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-10 08:55:12] [INFO ] After 725ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 08:55:12] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-10 08:55:12] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 08:55:12] [INFO ] After 558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-10 08:55:13] [INFO ] After 783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 127 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (AND p2 p0))]
Knowledge based reduction with 7 factoid took 488 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 3 out of 553 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 : 553/553 places, 793/793 transitions.
Graph (trivial) has 573 edges and 553 vertex of which 209 / 553 are part of one of the 23 SCC in 1 ms
Free SCC test removed 186 places
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Graph (complete) has 1148 edges and 367 vertex of which 362 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 361 transition count 429
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 1 with 148 rules applied. Total rules applied 298 place count 213 transition count 429
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 298 place count 213 transition count 397
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 362 place count 181 transition count 397
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 474 place count 125 transition count 341
Performed 18 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 510 place count 107 transition count 410
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 528 place count 107 transition count 392
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 3 with 45 rules applied. Total rules applied 573 place count 107 transition count 347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 574 place count 106 transition count 346
Applied a total of 574 rules in 48 ms. Remains 106 /553 variables (removed 447) and now considering 346/793 (removed 447) transitions.
[2023-03-10 08:55:13] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
// Phase 1: matrix 273 rows 106 cols
[2023-03-10 08:55:13] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-10 08:55:13] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-10 08:55:13] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2023-03-10 08:55:13] [INFO ] Invariant cache hit.
[2023-03-10 08:55:13] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 08:55:14] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-10 08:55:14] [INFO ] Redundant transitions in 432 ms returned []
[2023-03-10 08:55:14] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2023-03-10 08:55:14] [INFO ] Invariant cache hit.
[2023-03-10 08:55:14] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/553 places, 346/793 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1155 ms. Remains : 106/553 places, 346/793 transitions.
Computed a total of 30 stabilizing places and 201 stable transitions
Computed a total of 30 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 613 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 08:55:15] [INFO ] Flow matrix only has 273 transitions (discarded 73 similar events)
[2023-03-10 08:55:15] [INFO ] Invariant cache hit.
[2023-03-10 08:55:15] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:55:15] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 08:55:15] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-10 08:55:15] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 08:55:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 08:55:15] [INFO ] After 14ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 08:55:15] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-10 08:55:15] [INFO ] After 170ms 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 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 346/346 transitions.
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 106 transition count 311
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 1 with 2 rules applied. Total rules applied 37 place count 105 transition count 310
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 51 place count 98 transition count 358
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 98 transition count 352
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 99 place count 98 transition count 310
Free-agglomeration rule applied 28 times with reduction of 4 identical transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 127 place count 98 transition count 278
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 31 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 204 place count 70 transition count 229
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 207 place count 67 transition count 216
Iterating global reduction 3 with 3 rules applied. Total rules applied 210 place count 67 transition count 216
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 237 place count 67 transition count 189
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 67 transition count 189
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 67 transition count 187
Applied a total of 241 rules in 34 ms. Remains 67 /106 variables (removed 39) and now considering 187/346 (removed 159) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 67/106 places, 187/346 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished probabilistic random walk after 19198 steps, run visited all 1 properties in 42 ms. (steps per millisecond=457 )
Probabilistic random walk after 19198 steps, saw 3856 distinct states, run finished after 42 ms. (steps per millisecond=457 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p0)), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 106 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 5821 reset in 281 ms.
Stuttering criterion allowed to conclude after 94552 steps with 5489 reset in 541 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-14 finished in 8854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 869/869 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 577 transition count 869
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 561 transition count 796
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 561 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 561 transition count 795
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 559 transition count 793
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 559 transition count 793
Applied a total of 38 rules in 37 ms. Remains 559 /578 variables (removed 19) and now considering 793/869 (removed 76) transitions.
// Phase 1: matrix 793 rows 559 cols
[2023-03-10 08:55:17] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-10 08:55:17] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-10 08:55:17] [INFO ] Invariant cache hit.
[2023-03-10 08:55:18] [INFO ] Implicit Places using invariants and state equation in 583 ms returned [9, 17, 183, 191, 357, 365]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 748 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 553/578 places, 793/869 transitions.
Applied a total of 0 rules in 12 ms. Remains 553 /553 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 797 ms. Remains : 553/578 places, 793/869 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-3b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s205 0), p0:(EQ s133 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1437 steps with 14 reset in 2 ms.
FORMULA CloudDeployment-PT-3b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-3b-LTLFireability-15 finished in 948 ms.
All properties solved by simple procedures.
Total runtime 45598 ms.

BK_STOP 1678438519260

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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