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.r073-smll-167814399500411.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 ltsminxred
Input is CloudDeployment-PT-5a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399500411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.0K Feb 25 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 14:57 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.6K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 15:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 15:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 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 230K 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-5a-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-5a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678474877361

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 19:01:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 19:01:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 19:01:20] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-10 19:01:20] [INFO ] Transformed 180 places.
[2023-03-10 19:01:20] [INFO ] Transformed 675 transitions.
[2023-03-10 19:01:20] [INFO ] Found NUPN structural information;
[2023-03-10 19:01:20] [INFO ] Parsed PT model containing 180 places and 675 transitions and 3959 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA CloudDeployment-PT-5a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 595/595 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 172 transition count 595
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 169 transition count 592
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 169 transition count 592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 168 transition count 591
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 168 transition count 591
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 1 with 55 rules applied. Total rules applied 71 place count 168 transition count 536
Applied a total of 71 rules in 80 ms. Remains 168 /180 variables (removed 12) and now considering 536/595 (removed 59) transitions.
[2023-03-10 19:01:20] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
// Phase 1: matrix 297 rows 168 cols
[2023-03-10 19:01:20] [INFO ] Computed 22 place invariants in 13 ms
[2023-03-10 19:01:20] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-10 19:01:20] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
[2023-03-10 19:01:20] [INFO ] Invariant cache hit.
[2023-03-10 19:01:21] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-03-10 19:01:21] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
[2023-03-10 19:01:21] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
[2023-03-10 19:01:21] [INFO ] Invariant cache hit.
[2023-03-10 19:01:21] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/180 places, 536/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1374 ms. Remains : 168/180 places, 536/595 transitions.
Support contains 24 out of 168 places after structural reductions.
[2023-03-10 19:01:22] [INFO ] Flatten gal took : 122 ms
[2023-03-10 19:01:22] [INFO ] Flatten gal took : 60 ms
[2023-03-10 19:01:22] [INFO ] Input system was already deterministic with 536 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 19:01:23] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
[2023-03-10 19:01:23] [INFO ] Invariant cache hit.
[2023-03-10 19:01:23] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 19:01:23] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 12 ms returned sat
[2023-03-10 19:01:23] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-10 19:01:23] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-03-10 19:01:23] [INFO ] After 55ms SMT Verify possible using 128 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-10 19:01:23] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-10 19:01:23] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 536/536 transitions.
Graph (trivial) has 201 edges and 168 vertex of which 50 / 168 are part of one of the 15 SCC in 6 ms
Free SCC test removed 35 places
Drop transitions removed 110 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 140 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 131 transition count 396
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 125 transition count 365
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 125 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 124 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 124 transition count 364
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 47 place count 109 transition count 409
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 1 with 80 rules applied. Total rules applied 127 place count 109 transition count 329
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 132 place count 109 transition count 355
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 137 place count 104 transition count 355
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 104 transition count 355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 103 transition count 354
Applied a total of 139 rules in 171 ms. Remains 103 /168 variables (removed 65) and now considering 354/536 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 103/168 places, 354/536 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 845150 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 845150 steps, saw 148451 distinct states, run finished after 3003 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 19:01:26] [INFO ] Flow matrix only has 179 transitions (discarded 175 similar events)
// Phase 1: matrix 179 rows 103 cols
[2023-03-10 19:01:26] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-10 19:01:26] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-10 19:01:27] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:01:27] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 13 ms returned sat
[2023-03-10 19:01:27] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:01:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-10 19:01:27] [INFO ] After 35ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 19:01:27] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-10 19:01:27] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 354/354 transitions.
Applied a total of 0 rules in 15 ms. Remains 103 /103 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 103/103 places, 354/354 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 354/354 transitions.
Applied a total of 0 rules in 11 ms. Remains 103 /103 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-10 19:01:27] [INFO ] Flow matrix only has 179 transitions (discarded 175 similar events)
[2023-03-10 19:01:27] [INFO ] Invariant cache hit.
[2023-03-10 19:01:27] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-10 19:01:27] [INFO ] Flow matrix only has 179 transitions (discarded 175 similar events)
[2023-03-10 19:01:27] [INFO ] Invariant cache hit.
[2023-03-10 19:01:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-10 19:01:27] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-10 19:01:27] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-10 19:01:27] [INFO ] Flow matrix only has 179 transitions (discarded 175 similar events)
[2023-03-10 19:01:27] [INFO ] Invariant cache hit.
[2023-03-10 19:01:28] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 722 ms. Remains : 103/103 places, 354/354 transitions.
Graph (trivial) has 84 edges and 103 vertex of which 35 / 103 are part of one of the 5 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 40 transitions
Ensure Unique test removed 175 transitions
Reduce isomorphic transitions removed 215 transitions.
Ensure Unique test removed 9 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 64 transition count 123
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 42 place count 48 transition count 123
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 42 place count 48 transition count 115
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 58 place count 40 transition count 115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 36 transition count 111
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 36 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 32 transition count 91
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 32 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 78 place count 32 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 31 transition count 86
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 90 place count 31 transition count 76
Free-agglomeration rule applied 5 times with reduction of 26 identical transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 31 transition count 45
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 105 place count 26 transition count 40
Applied a total of 105 rules in 16 ms. Remains 26 /103 variables (removed 77) and now considering 40/354 (removed 314) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 26 cols
[2023-03-10 19:01:28] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-10 19:01:28] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-10 19:01:28] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:01:28] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 2 ms returned sat
[2023-03-10 19:01:28] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:01:28] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-10 19:01:28] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 83 stabilizing places and 366 stable transitions
Graph (complete) has 1541 edges and 168 vertex of which 165 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 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 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 536/536 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 164 transition count 534
Applied a total of 6 rules in 12 ms. Remains 164 /168 variables (removed 4) and now considering 534/536 (removed 2) transitions.
[2023-03-10 19:01:28] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2023-03-10 19:01:28] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-10 19:01:28] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-10 19:01:28] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:28] [INFO ] Invariant cache hit.
[2023-03-10 19:01:28] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 19:01:28] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-10 19:01:28] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:28] [INFO ] Invariant cache hit.
[2023-03-10 19:01:29] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/168 places, 534/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 807 ms. Remains : 164/168 places, 534/536 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-00 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:(OR (EQ s34 0) (EQ s38 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1988 ms.
Product exploration explored 100000 steps with 33333 reset in 1695 ms.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 79 stabilizing places and 364 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 63 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-5a-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5a-LTLCardinality-00 finished in 4902 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(p1)||p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 536/536 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 536
Applied a total of 2 rules in 5 ms. Remains 166 /168 variables (removed 2) and now considering 536/536 (removed 0) transitions.
[2023-03-10 19:01:33] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
// Phase 1: matrix 297 rows 166 cols
[2023-03-10 19:01:33] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-10 19:01:33] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-10 19:01:33] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
[2023-03-10 19:01:33] [INFO ] Invariant cache hit.
[2023-03-10 19:01:33] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-03-10 19:01:33] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-10 19:01:33] [INFO ] Flow matrix only has 297 transitions (discarded 239 similar events)
[2023-03-10 19:01:33] [INFO ] Invariant cache hit.
[2023-03-10 19:01:34] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/168 places, 536/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 836 ms. Remains : 166/168 places, 536/536 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s60 0) (EQ s149 1)), p0:(OR (EQ s60 0) (EQ s149 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, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2179 ms.
Product exploration explored 100000 steps with 50000 reset in 2217 ms.
Computed a total of 81 stabilizing places and 366 stable transitions
Graph (complete) has 1507 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 81 stabilizing places and 366 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5a-LTLCardinality-02 finished in 5470 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 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 536/536 transitions.
Graph (trivial) has 198 edges and 168 vertex of which 48 / 168 are part of one of the 15 SCC in 0 ms
Free SCC test removed 33 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 127 transition count 420
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 127 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 126 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 126 transition count 419
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 43 place count 111 transition count 464
Drop transitions removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 0 with 81 rules applied. Total rules applied 124 place count 111 transition count 383
Applied a total of 124 rules in 67 ms. Remains 111 /168 variables (removed 57) and now considering 383/536 (removed 153) transitions.
[2023-03-10 19:01:38] [INFO ] Flow matrix only has 163 transitions (discarded 220 similar events)
// Phase 1: matrix 163 rows 111 cols
[2023-03-10 19:01:38] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-10 19:01:38] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-10 19:01:38] [INFO ] Flow matrix only has 163 transitions (discarded 220 similar events)
[2023-03-10 19:01:38] [INFO ] Invariant cache hit.
[2023-03-10 19:01:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 19:01:39] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-10 19:01:39] [INFO ] Redundant transitions in 381 ms returned []
[2023-03-10 19:01:39] [INFO ] Flow matrix only has 163 transitions (discarded 220 similar events)
[2023-03-10 19:01:39] [INFO ] Invariant cache hit.
[2023-03-10 19:01:39] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/168 places, 383/536 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1042 ms. Remains : 111/168 places, 383/536 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-03 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 s41 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-5a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-03 finished in 1143 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(G(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 536/536 transitions.
Graph (trivial) has 195 edges and 168 vertex of which 50 / 168 are part of one of the 15 SCC in 0 ms
Free SCC test removed 35 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 124 transition count 404
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 124 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 123 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 123 transition count 403
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 43 place count 109 transition count 440
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 0 with 70 rules applied. Total rules applied 113 place count 109 transition count 370
Applied a total of 113 rules in 50 ms. Remains 109 /168 variables (removed 59) and now considering 370/536 (removed 166) transitions.
[2023-03-10 19:01:39] [INFO ] Flow matrix only has 156 transitions (discarded 214 similar events)
// Phase 1: matrix 156 rows 109 cols
[2023-03-10 19:01:39] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-10 19:01:40] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-10 19:01:40] [INFO ] Flow matrix only has 156 transitions (discarded 214 similar events)
[2023-03-10 19:01:40] [INFO ] Invariant cache hit.
[2023-03-10 19:01:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 19:01:40] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-10 19:01:40] [INFO ] Redundant transitions in 356 ms returned []
[2023-03-10 19:01:40] [INFO ] Flow matrix only has 156 transitions (discarded 214 similar events)
[2023-03-10 19:01:40] [INFO ] Invariant cache hit.
[2023-03-10 19:01:40] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/168 places, 370/536 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 968 ms. Remains : 109/168 places, 370/536 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s43 0) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-05 finished in 1134 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(F(p1))&&p0))||X(X(G(p2)))))'
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 536/536 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 164 transition count 534
Applied a total of 6 rules in 9 ms. Remains 164 /168 variables (removed 4) and now considering 534/536 (removed 2) transitions.
[2023-03-10 19:01:41] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2023-03-10 19:01:41] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-10 19:01:41] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-10 19:01:41] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:41] [INFO ] Invariant cache hit.
[2023-03-10 19:01:41] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 19:01:41] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-10 19:01:41] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:41] [INFO ] Invariant cache hit.
[2023-03-10 19:01:41] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/168 places, 534/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 851 ms. Remains : 164/168 places, 534/536 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(AND (EQ s21 0) (EQ s144 1)), p1:(AND (EQ s21 0) (EQ s144 1)), p2:(EQ s161 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, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-06 finished in 1224 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(p1)&&p0)))'
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 536/536 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 164 transition count 534
Applied a total of 6 rules in 16 ms. Remains 164 /168 variables (removed 4) and now considering 534/536 (removed 2) transitions.
[2023-03-10 19:01:42] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2023-03-10 19:01:42] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-10 19:01:42] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 19:01:42] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:42] [INFO ] Invariant cache hit.
[2023-03-10 19:01:42] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 19:01:42] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-10 19:01:42] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:42] [INFO ] Invariant cache hit.
[2023-03-10 19:01:43] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/168 places, 534/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 862 ms. Remains : 164/168 places, 534/536 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-08 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=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (EQ s53 0) (EQ s161 1)) (EQ s52 1)), p0:(AND (EQ s161 0) (EQ s53 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-08 finished in 1011 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(p1)&&p0)))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 536/536 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 164 transition count 534
Applied a total of 6 rules in 6 ms. Remains 164 /168 variables (removed 4) and now considering 534/536 (removed 2) transitions.
[2023-03-10 19:01:43] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2023-03-10 19:01:43] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-10 19:01:43] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-10 19:01:43] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:43] [INFO ] Invariant cache hit.
[2023-03-10 19:01:43] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 19:01:43] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-10 19:01:43] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:43] [INFO ] Invariant cache hit.
[2023-03-10 19:01:44] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/168 places, 534/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 831 ms. Remains : 164/168 places, 534/536 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-13 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=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s88 0) (EQ s110 1)), p0:(AND (EQ s5 0) (EQ s24 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLCardinality-13 finished in 977 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(p0)) U G(X((G(X(X(p1))) U p2)))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 536/536 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 166 transition count 536
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 165 transition count 535
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 165 transition count 535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 164 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 164 transition count 534
Applied a total of 6 rules in 7 ms. Remains 164 /168 variables (removed 4) and now considering 534/536 (removed 2) transitions.
[2023-03-10 19:01:44] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:44] [INFO ] Invariant cache hit.
[2023-03-10 19:01:44] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-10 19:01:44] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:44] [INFO ] Invariant cache hit.
[2023-03-10 19:01:44] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 19:01:44] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-10 19:01:44] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:44] [INFO ] Invariant cache hit.
[2023-03-10 19:01:45] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/168 places, 534/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 899 ms. Remains : 164/168 places, 534/536 transitions.
Stuttering acceptance computed with spot in 520 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=true, acceptance={1} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 9}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 10}, { cond=(AND p0 p1), acceptance={} source=4 dest: 11}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=6 dest: 6}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(NOT p0), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=9 dest: 2}, { cond=p1, acceptance={} source=9 dest: 4}, { cond=(NOT p1), acceptance={1} source=9 dest: 4}, { cond=p0, acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={} source=10 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (EQ s62 0) (EQ s61 1)), p0:(OR (EQ s113 0) (EQ s140 1)), p1:(OR (EQ s54 0) (EQ s40 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20041 reset in 1215 ms.
Product exploration explored 100000 steps with 19977 reset in 1222 ms.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 559 ms. Reduced automaton from 12 states, 36 edges and 3 AP (stutter sensitive) to 12 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 529 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 135 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-10 19:01:49] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:49] [INFO ] Invariant cache hit.
[2023-03-10 19:01:49] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:01:49] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 16 ms returned sat
[2023-03-10 19:01:49] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:01:49] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 19:01:49] [INFO ] After 50ms SMT Verify possible using 126 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 19:01:49] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-10 19:01:49] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 190 edges and 164 vertex of which 48 / 164 are part of one of the 15 SCC in 1 ms
Free SCC test removed 33 places
Drop transitions removed 107 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (complete) has 793 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 125 transition count 368
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 125 transition count 368
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 120 transition count 363
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 52 place count 105 transition count 408
Drop transitions removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 0 with 81 rules applied. Total rules applied 133 place count 105 transition count 327
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 134 place count 105 transition count 327
Applied a total of 134 rules in 37 ms. Remains 105 /164 variables (removed 59) and now considering 327/534 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 105/164 places, 327/534 transitions.
Incomplete random walk after 10000 steps, including 174 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 508905 steps, run visited all 1 properties in 1680 ms. (steps per millisecond=302 )
Probabilistic random walk after 508905 steps, saw 93157 distinct states, run finished after 1681 ms. (steps per millisecond=302 ) properties seen :1
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) p1)), (F (NOT (AND p1 p0))), (F (AND (NOT p2) (NOT p1))), (F (AND p1 (NOT p0))), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) p0)), (F (NOT p2)), (F (AND (NOT p2) p0)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 6 factoid took 1006 ms. Reduced automaton from 12 states, 36 edges and 3 AP (stutter sensitive) to 12 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 497 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 496 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2023-03-10 19:01:53] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:53] [INFO ] Invariant cache hit.
[2023-03-10 19:01:53] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-10 19:01:53] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:53] [INFO ] Invariant cache hit.
[2023-03-10 19:01:53] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 19:01:54] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-10 19:01:54] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:54] [INFO ] Invariant cache hit.
[2023-03-10 19:01:54] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 164/164 places, 534/534 transitions.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 563 ms. Reduced automaton from 12 states, 36 edges and 3 AP (stutter sensitive) to 12 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 498 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 133 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-10 19:01:55] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:01:55] [INFO ] Invariant cache hit.
[2023-03-10 19:01:55] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:01:55] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 9 ms returned sat
[2023-03-10 19:01:56] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:01:56] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 19:01:56] [INFO ] After 59ms SMT Verify possible using 126 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 19:01:56] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-10 19:01:56] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 190 edges and 164 vertex of which 48 / 164 are part of one of the 15 SCC in 0 ms
Free SCC test removed 33 places
Drop transitions removed 107 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 136 transitions.
Graph (complete) has 793 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 125 transition count 368
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 125 transition count 368
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 120 transition count 363
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 52 place count 105 transition count 408
Drop transitions removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 0 with 81 rules applied. Total rules applied 133 place count 105 transition count 327
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 134 place count 105 transition count 327
Applied a total of 134 rules in 41 ms. Remains 105 /164 variables (removed 59) and now considering 327/534 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 105/164 places, 327/534 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 508905 steps, run visited all 1 properties in 1698 ms. (steps per millisecond=299 )
Probabilistic random walk after 508905 steps, saw 93157 distinct states, run finished after 1700 ms. (steps per millisecond=299 ) properties seen :1
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) p1)), (F (NOT (AND p1 p0))), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0)), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) p0)), (F (NOT p2)), (F (AND (NOT p2) p0)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 6 factoid took 983 ms. Reduced automaton from 12 states, 36 edges and 3 AP (stutter sensitive) to 12 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 503 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 503 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 493 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 20005 reset in 1090 ms.
Product exploration explored 100000 steps with 19979 reset in 1112 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 492 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 190 edges and 164 vertex of which 48 / 164 are part of one of the 15 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 126 transition count 409
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 126 transition count 409
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 0 with 15 rules applied. Total rules applied 26 place count 126 transition count 489
Deduced a syphon composed of 15 places in 1 ms
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 121 place count 126 transition count 394
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 121 rules in 37 ms. Remains 126 /164 variables (removed 38) and now considering 394/534 (removed 140) transitions.
[2023-03-10 19:02:03] [INFO ] Redundant transitions in 325 ms returned []
[2023-03-10 19:02:03] [INFO ] Flow matrix only has 180 transitions (discarded 214 similar events)
// Phase 1: matrix 180 rows 126 cols
[2023-03-10 19:02:03] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-10 19:02:04] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/164 places, 394/534 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 609 ms. Remains : 126/164 places, 394/534 transitions.
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2023-03-10 19:02:04] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2023-03-10 19:02:04] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-10 19:02:04] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-10 19:02:04] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:02:04] [INFO ] Invariant cache hit.
[2023-03-10 19:02:04] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 19:02:04] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-10 19:02:04] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2023-03-10 19:02:04] [INFO ] Invariant cache hit.
[2023-03-10 19:02:04] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 832 ms. Remains : 164/164 places, 534/534 transitions.
Treatment of property CloudDeployment-PT-5a-LTLCardinality-15 finished in 20809 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(p0)) U G(X((G(X(X(p1))) U p2)))))'
Found a Lengthening insensitive property : CloudDeployment-PT-5a-LTLCardinality-15
Stuttering acceptance computed with spot in 526 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 536/536 transitions.
Graph (trivial) has 190 edges and 168 vertex of which 48 / 168 are part of one of the 15 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Ensure Unique test removed 2 places
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 127 transition count 410
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 127 transition count 410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 126 transition count 409
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 126 transition count 409
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 45 place count 111 transition count 454
Applied a total of 45 rules in 26 ms. Remains 111 /168 variables (removed 57) and now considering 454/536 (removed 82) transitions.
[2023-03-10 19:02:05] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
// Phase 1: matrix 240 rows 111 cols
[2023-03-10 19:02:05] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-10 19:02:05] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-10 19:02:05] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
[2023-03-10 19:02:05] [INFO ] Invariant cache hit.
[2023-03-10 19:02:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-10 19:02:06] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-10 19:02:06] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
[2023-03-10 19:02:06] [INFO ] Invariant cache hit.
[2023-03-10 19:02:06] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 111/168 places, 454/536 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 688 ms. Remains : 111/168 places, 454/536 transitions.
Running random walk in product with property : CloudDeployment-PT-5a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=true, acceptance={1} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 9}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 10}, { cond=(AND p0 p1), acceptance={} source=4 dest: 11}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=6 dest: 6}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(NOT p0), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=9 dest: 2}, { cond=p1, acceptance={} source=9 dest: 4}, { cond=(NOT p1), acceptance={1} source=9 dest: 4}, { cond=p0, acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={} source=10 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (EQ s39 0) (EQ s38 1)), p0:(OR (EQ s70 0) (EQ s87 1)), p1:(OR (EQ s32 0) (EQ s25 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20016 reset in 1235 ms.
Product exploration explored 100000 steps with 20010 reset in 1235 ms.
Computed a total of 64 stabilizing places and 355 stable transitions
Graph (complete) has 1305 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 355 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 549 ms. Reduced automaton from 12 states, 36 edges and 3 AP (stutter sensitive) to 12 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 529 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 243 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-10 19:02:10] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
[2023-03-10 19:02:10] [INFO ] Invariant cache hit.
[2023-03-10 19:02:10] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:02:10] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-10 19:02:10] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:02:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-10 19:02:10] [INFO ] After 48ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 19:02:10] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-10 19:02:10] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 454/454 transitions.
Graph (complete) has 818 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 110 transition count 413
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 105 transition count 408
Drop transitions removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 1 with 81 rules applied. Total rules applied 133 place count 105 transition count 327
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 105 transition count 327
Applied a total of 134 rules in 30 ms. Remains 105 /111 variables (removed 6) and now considering 327/454 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 105/111 places, 327/454 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 508905 steps, run visited all 1 properties in 1689 ms. (steps per millisecond=301 )
Probabilistic random walk after 508905 steps, saw 93157 distinct states, run finished after 1690 ms. (steps per millisecond=301 ) properties seen :1
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) p1)), (F (NOT (AND p1 p0))), (F (AND (NOT p2) (NOT p1))), (F (AND p1 (NOT p0))), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) p0)), (F (NOT p2)), (F (AND (NOT p2) p0)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 6 factoid took 1093 ms. Reduced automaton from 12 states, 36 edges and 3 AP (stutter sensitive) to 12 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 509 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 490 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 454/454 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2023-03-10 19:02:14] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
[2023-03-10 19:02:14] [INFO ] Invariant cache hit.
[2023-03-10 19:02:14] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 19:02:14] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
[2023-03-10 19:02:14] [INFO ] Invariant cache hit.
[2023-03-10 19:02:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-10 19:02:14] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-10 19:02:14] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
[2023-03-10 19:02:14] [INFO ] Invariant cache hit.
[2023-03-10 19:02:15] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 111/111 places, 454/454 transitions.
Computed a total of 64 stabilizing places and 355 stable transitions
Graph (complete) has 1305 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 355 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 531 ms. Reduced automaton from 12 states, 36 edges and 3 AP (stutter sensitive) to 12 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 498 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 234 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-10 19:02:16] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
[2023-03-10 19:02:16] [INFO ] Invariant cache hit.
[2023-03-10 19:02:16] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:02:16] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 7 ms returned sat
[2023-03-10 19:02:16] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:02:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-10 19:02:16] [INFO ] After 48ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 19:02:16] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-10 19:02:16] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 454/454 transitions.
Graph (complete) has 818 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 110 transition count 413
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 105 transition count 408
Drop transitions removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 1 with 81 rules applied. Total rules applied 133 place count 105 transition count 327
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 105 transition count 327
Applied a total of 134 rules in 25 ms. Remains 105 /111 variables (removed 6) and now considering 327/454 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 105/111 places, 327/454 transitions.
Incomplete random walk after 10000 steps, including 168 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 508905 steps, run visited all 1 properties in 1693 ms. (steps per millisecond=300 )
Probabilistic random walk after 508905 steps, saw 93157 distinct states, run finished after 1693 ms. (steps per millisecond=300 ) properties seen :1
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) p1)), (F (NOT (AND p1 p0))), (F (AND (NOT p2) (NOT p1))), (F (AND p1 (NOT p0))), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p1) p0)), (F (NOT p2)), (F (AND (NOT p2) p0)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 6 factoid took 983 ms. Reduced automaton from 12 states, 36 edges and 3 AP (stutter sensitive) to 12 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 486 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 490 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 482 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 19940 reset in 1210 ms.
Product exploration explored 100000 steps with 20025 reset in 1230 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 504 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), false, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 454/454 transitions.
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 111 transition count 374
Applied a total of 80 rules in 22 ms. Remains 111 /111 variables (removed 0) and now considering 374/454 (removed 80) transitions.
[2023-03-10 19:02:24] [INFO ] Redundant transitions in 372 ms returned []
[2023-03-10 19:02:24] [INFO ] Flow matrix only has 160 transitions (discarded 214 similar events)
// Phase 1: matrix 160 rows 111 cols
[2023-03-10 19:02:24] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-10 19:02:24] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 374/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 712 ms. Remains : 111/111 places, 374/454 transitions.
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 454/454 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2023-03-10 19:02:24] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
// Phase 1: matrix 240 rows 111 cols
[2023-03-10 19:02:24] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-10 19:02:24] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-10 19:02:24] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
[2023-03-10 19:02:24] [INFO ] Invariant cache hit.
[2023-03-10 19:02:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-10 19:02:25] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-10 19:02:25] [INFO ] Flow matrix only has 240 transitions (discarded 214 similar events)
[2023-03-10 19:02:25] [INFO ] Invariant cache hit.
[2023-03-10 19:02:25] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 111/111 places, 454/454 transitions.
Treatment of property CloudDeployment-PT-5a-LTLCardinality-15 finished in 20379 ms.
[2023-03-10 19:02:25] [INFO ] Flatten gal took : 41 ms
[2023-03-10 19:02:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 19:02:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 168 places, 536 transitions and 3427 arcs took 7 ms.
Total runtime 65613 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1923/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CloudDeployment-PT-5a-LTLCardinality-15

BK_STOP 1678474946977

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CloudDeployment-PT-5a-LTLCardinality-15
ltl formula formula --ltl=/tmp/1923/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 536 transitions and 3427 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1923/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1923/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1923/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1923/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 14 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-5a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CloudDeployment-PT-5a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r073-smll-167814399500411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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