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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 5.9K Feb 25 14:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 14:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 14:48 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:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 14:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 14:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 166K 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-2b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-2b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678454994213

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-2b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 13:29:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 13:29:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 13:29:57] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-10 13:29:57] [INFO ] Transformed 556 places.
[2023-03-10 13:29:57] [INFO ] Transformed 684 transitions.
[2023-03-10 13:29:57] [INFO ] Found NUPN structural information;
[2023-03-10 13:29:57] [INFO ] Parsed PT model containing 556 places and 684 transitions and 1987 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CloudDeployment-PT-2b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-2b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 684/684 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 553 transition count 684
Discarding 124 places :
Symmetric choice reduction at 1 with 124 rule applications. Total rules 127 place count 429 transition count 549
Iterating global reduction 1 with 124 rules applied. Total rules applied 251 place count 429 transition count 549
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 294 place count 386 transition count 506
Iterating global reduction 1 with 43 rules applied. Total rules applied 337 place count 386 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 338 place count 386 transition count 505
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 341 place count 383 transition count 502
Iterating global reduction 2 with 3 rules applied. Total rules applied 344 place count 383 transition count 502
Applied a total of 344 rules in 149 ms. Remains 383 /556 variables (removed 173) and now considering 502/684 (removed 182) transitions.
// Phase 1: matrix 502 rows 383 cols
[2023-03-10 13:29:57] [INFO ] Computed 6 place invariants in 34 ms
[2023-03-10 13:29:58] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-10 13:29:58] [INFO ] Invariant cache hit.
[2023-03-10 13:29:58] [INFO ] Implicit Places using invariants and state equation in 538 ms returned [8, 18, 186, 194]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1063 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 379/556 places, 502/684 transitions.
Applied a total of 0 rules in 17 ms. Remains 379 /379 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1229 ms. Remains : 379/556 places, 502/684 transitions.
Support contains 27 out of 379 places after structural reductions.
[2023-03-10 13:29:59] [INFO ] Flatten gal took : 117 ms
[2023-03-10 13:29:59] [INFO ] Flatten gal took : 52 ms
[2023-03-10 13:29:59] [INFO ] Input system was already deterministic with 502 transitions.
Incomplete random walk after 10000 steps, including 156 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 25) seen :16
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 502 rows 379 cols
[2023-03-10 13:30:00] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-10 13:30:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 13:30:01] [INFO ] After 574ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-10 13:30:01] [INFO ] After 642ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-10 13:30:01] [INFO ] After 934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-10 13:30:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-10 13:30:02] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-10 13:30:02] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-10 13:30:02] [INFO ] After 1402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 7 properties in 41 ms.
Support contains 6 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 502/502 transitions.
Graph (trivial) has 386 edges and 379 vertex of which 121 / 379 are part of one of the 14 SCC in 7 ms
Free SCC test removed 107 places
Drop transitions removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Graph (complete) has 700 edges and 272 vertex of which 268 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 268 transition count 247
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 233 place count 156 transition count 244
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 236 place count 155 transition count 242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 238 place count 153 transition count 242
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 238 place count 153 transition count 220
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 282 place count 131 transition count 220
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 287 place count 126 transition count 215
Iterating global reduction 4 with 5 rules applied. Total rules applied 292 place count 126 transition count 215
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 292 place count 126 transition count 211
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 300 place count 122 transition count 211
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 372 place count 86 transition count 174
Performed 17 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 406 place count 69 transition count 222
Drop transitions removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 422 place count 69 transition count 206
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 446 place count 69 transition count 182
Free-agglomeration rule applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 460 place count 69 transition count 168
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 484 place count 55 transition count 158
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 487 place count 52 transition count 150
Iterating global reduction 6 with 3 rules applied. Total rules applied 490 place count 52 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 492 place count 52 transition count 148
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 499 place count 52 transition count 141
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 502 place count 52 transition count 141
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 505 place count 52 transition count 138
Applied a total of 505 rules in 138 ms. Remains 52 /379 variables (removed 327) and now considering 138/502 (removed 364) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 52/379 places, 138/502 transitions.
Incomplete random walk after 10000 steps, including 301 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 182160 steps, run visited all 1 properties in 325 ms. (steps per millisecond=560 )
Probabilistic random walk after 182160 steps, saw 29068 distinct states, run finished after 326 ms. (steps per millisecond=558 ) properties seen :1
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 869 edges and 379 vertex of which 375 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.10 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(G((X(X(G(p0)))&&(F(p2)||p1))))))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 372 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 372 transition count 495
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 371 transition count 494
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 371 transition count 494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 371 transition count 493
Applied a total of 17 rules in 23 ms. Remains 371 /379 variables (removed 8) and now considering 493/502 (removed 9) transitions.
// Phase 1: matrix 493 rows 371 cols
[2023-03-10 13:30:03] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-10 13:30:04] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-10 13:30:04] [INFO ] Invariant cache hit.
[2023-03-10 13:30:04] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-10 13:30:04] [INFO ] Invariant cache hit.
[2023-03-10 13:30:04] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 371/379 places, 493/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 906 ms. Remains : 371/379 places, 493/502 transitions.
Stuttering acceptance computed with spot in 472 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s122 1) (EQ s19 1)), p2:(EQ s122 1), p0:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 8 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-00 finished in 1477 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(G(p0)) U p1)) U (p2||F(p3))))'
Support contains 8 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 371 transition count 494
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 371 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 370 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 370 transition count 493
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 370 transition count 492
Applied a total of 19 rules in 31 ms. Remains 370 /379 variables (removed 9) and now considering 492/502 (removed 10) transitions.
// Phase 1: matrix 492 rows 370 cols
[2023-03-10 13:30:05] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-10 13:30:05] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-10 13:30:05] [INFO ] Invariant cache hit.
[2023-03-10 13:30:05] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-10 13:30:05] [INFO ] Invariant cache hit.
[2023-03-10 13:30:06] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 370/379 places, 492/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 850 ms. Remains : 370/379 places, 492/502 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s103 1), p3:(AND (EQ s183 1) (EQ s199 1) (EQ s319 1) (EQ s358 1) (EQ s366 1)), p1:(EQ s46 1), p0:(AND (EQ s86 1) (EQ s183 1) (EQ s199 1) (EQ s319 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-02 finished in 1029 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((p0||X((G(!p1) U (p0&&G(!p1)))))))'
Support contains 1 out of 379 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Graph (trivial) has 388 edges and 379 vertex of which 130 / 379 are part of one of the 14 SCC in 1 ms
Free SCC test removed 116 places
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (complete) has 717 edges and 263 vertex of which 259 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 259 transition count 259
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 111 rules applied. Total rules applied 221 place count 151 transition count 256
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 223 place count 149 transition count 256
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 223 place count 149 transition count 236
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 263 place count 129 transition count 236
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 265 place count 127 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 127 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 267 place count 127 transition count 233
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 269 place count 126 transition count 233
Performed 41 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 351 place count 85 transition count 191
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 375 place count 73 transition count 225
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 387 place count 73 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 389 place count 72 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 393 place count 72 transition count 220
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 406 place count 72 transition count 207
Applied a total of 406 rules in 60 ms. Remains 72 /379 variables (removed 307) and now considering 207/502 (removed 295) transitions.
[2023-03-10 13:30:06] [INFO ] Flow matrix only has 172 transitions (discarded 35 similar events)
// Phase 1: matrix 172 rows 72 cols
[2023-03-10 13:30:06] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 13:30:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-10 13:30:06] [INFO ] Flow matrix only has 172 transitions (discarded 35 similar events)
[2023-03-10 13:30:06] [INFO ] Invariant cache hit.
[2023-03-10 13:30:06] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-10 13:30:06] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-10 13:30:06] [INFO ] Redundant transitions in 228 ms returned []
[2023-03-10 13:30:06] [INFO ] Flow matrix only has 172 transitions (discarded 35 similar events)
[2023-03-10 13:30:06] [INFO ] Invariant cache hit.
[2023-03-10 13:30:07] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/379 places, 207/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 616 ms. Remains : 72/379 places, 207/502 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-03 finished in 674 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(p0) U (!p1&&X(p2))))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 371 transition count 494
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 371 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 370 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 370 transition count 493
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 370 transition count 492
Applied a total of 19 rules in 31 ms. Remains 370 /379 variables (removed 9) and now considering 492/502 (removed 10) transitions.
// Phase 1: matrix 492 rows 370 cols
[2023-03-10 13:30:07] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-10 13:30:07] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-10 13:30:07] [INFO ] Invariant cache hit.
[2023-03-10 13:30:07] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-10 13:30:07] [INFO ] Invariant cache hit.
[2023-03-10 13:30:07] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 370/379 places, 492/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 863 ms. Remains : 370/379 places, 492/502 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s159 1) (EQ s87 1)), p0:(AND (NEQ s159 1) (EQ s87 1)), p2:(NEQ s159 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 564 ms.
Product exploration explored 100000 steps with 50000 reset in 509 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 856 edges and 370 vertex of which 366 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0) p2)
Knowledge based reduction with 17 factoid took 634 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-2b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-2b-LTLFireability-04 finished in 2783 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 U (G(p0)||(G(p2)&&p1))))))'
Support contains 3 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Graph (trivial) has 390 edges and 379 vertex of which 126 / 379 are part of one of the 15 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Graph (complete) has 720 edges and 268 vertex of which 264 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 263 transition count 267
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 216 place count 156 transition count 267
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 216 place count 156 transition count 244
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 262 place count 133 transition count 244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 264 place count 131 transition count 242
Iterating global reduction 2 with 2 rules applied. Total rules applied 266 place count 131 transition count 242
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 266 place count 131 transition count 240
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 270 place count 129 transition count 240
Performed 41 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 352 place count 88 transition count 197
Performed 15 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 382 place count 73 transition count 245
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 400 place count 73 transition count 227
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 3 with 35 rules applied. Total rules applied 435 place count 73 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 72 transition count 191
Applied a total of 436 rules in 62 ms. Remains 72 /379 variables (removed 307) and now considering 191/502 (removed 311) transitions.
[2023-03-10 13:30:09] [INFO ] Flow matrix only has 153 transitions (discarded 38 similar events)
// Phase 1: matrix 153 rows 72 cols
[2023-03-10 13:30:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 13:30:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-10 13:30:09] [INFO ] Flow matrix only has 153 transitions (discarded 38 similar events)
[2023-03-10 13:30:09] [INFO ] Invariant cache hit.
[2023-03-10 13:30:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 13:30:10] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-10 13:30:10] [INFO ] Redundant transitions in 157 ms returned []
[2023-03-10 13:30:10] [INFO ] Flow matrix only has 153 transitions (discarded 38 similar events)
[2023-03-10 13:30:10] [INFO ] Invariant cache hit.
[2023-03-10 13:30:10] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/379 places, 191/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 72/379 places, 191/502 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NEQ s22 1) (NEQ s54 1)), p2:(EQ s24 1), p0:(NEQ s54 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8132 steps with 806 reset in 93 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-07 finished in 861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(p1 U p2)))))'
Support contains 4 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 372 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 372 transition count 495
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 371 transition count 494
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 371 transition count 494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 371 transition count 493
Applied a total of 17 rules in 26 ms. Remains 371 /379 variables (removed 8) and now considering 493/502 (removed 9) transitions.
// Phase 1: matrix 493 rows 371 cols
[2023-03-10 13:30:10] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-10 13:30:10] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-10 13:30:10] [INFO ] Invariant cache hit.
[2023-03-10 13:30:11] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-10 13:30:11] [INFO ] Invariant cache hit.
[2023-03-10 13:30:11] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 371/379 places, 493/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 909 ms. Remains : 371/379 places, 493/502 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s307 1), p1:(AND (EQ s16 1) (EQ s189 1)), p0:(EQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-08 finished in 1130 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 1 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Graph (trivial) has 395 edges and 379 vertex of which 132 / 379 are part of one of the 16 SCC in 1 ms
Free SCC test removed 116 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Graph (complete) has 715 edges and 263 vertex of which 259 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 258 transition count 262
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 109 rules applied. Total rules applied 218 place count 151 transition count 260
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 220 place count 150 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 221 place count 149 transition count 259
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 221 place count 149 transition count 238
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 263 place count 128 transition count 238
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 265 place count 126 transition count 236
Iterating global reduction 4 with 2 rules applied. Total rules applied 267 place count 126 transition count 236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 267 place count 126 transition count 234
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 271 place count 124 transition count 234
Performed 40 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 351 place count 84 transition count 193
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 379 place count 70 transition count 232
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 394 place count 70 transition count 217
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 424 place count 70 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 425 place count 69 transition count 186
Applied a total of 425 rules in 53 ms. Remains 69 /379 variables (removed 310) and now considering 186/502 (removed 316) transitions.
[2023-03-10 13:30:11] [INFO ] Flow matrix only has 147 transitions (discarded 39 similar events)
// Phase 1: matrix 147 rows 69 cols
[2023-03-10 13:30:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 13:30:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-10 13:30:11] [INFO ] Flow matrix only has 147 transitions (discarded 39 similar events)
[2023-03-10 13:30:11] [INFO ] Invariant cache hit.
[2023-03-10 13:30:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 13:30:12] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-10 13:30:12] [INFO ] Redundant transitions in 151 ms returned []
[2023-03-10 13:30:12] [INFO ] Flow matrix only has 147 transitions (discarded 39 similar events)
[2023-03-10 13:30:12] [INFO ] Invariant cache hit.
[2023-03-10 13:30:12] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/379 places, 186/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 545 ms. Remains : 69/379 places, 186/502 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-09 finished in 600 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(p0)&&(p1||F(G(p2))))))'
Support contains 3 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 372 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 372 transition count 495
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 371 transition count 494
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 371 transition count 494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 371 transition count 493
Applied a total of 17 rules in 21 ms. Remains 371 /379 variables (removed 8) and now considering 493/502 (removed 9) transitions.
// Phase 1: matrix 493 rows 371 cols
[2023-03-10 13:30:12] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-10 13:30:12] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-10 13:30:12] [INFO ] Invariant cache hit.
[2023-03-10 13:30:13] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2023-03-10 13:30:13] [INFO ] Invariant cache hit.
[2023-03-10 13:30:13] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 371/379 places, 493/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1075 ms. Remains : 371/379 places, 493/502 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s183 0)), p1:(EQ s264 1), p2:(AND (EQ s11 1) (EQ s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-11 finished in 1282 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((p0||X(p1))))'
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 372 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 372 transition count 495
Applied a total of 14 rules in 13 ms. Remains 372 /379 variables (removed 7) and now considering 495/502 (removed 7) transitions.
// Phase 1: matrix 495 rows 372 cols
[2023-03-10 13:30:13] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-10 13:30:13] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-10 13:30:13] [INFO ] Invariant cache hit.
[2023-03-10 13:30:14] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2023-03-10 13:30:14] [INFO ] Invariant cache hit.
[2023-03-10 13:30:14] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 372/379 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 894 ms. Remains : 372/379 places, 495/502 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s265 1), p1:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1538 reset in 176 ms.
Product exploration explored 100000 steps with 1544 reset in 296 ms.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 860 edges and 372 vertex of which 368 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 432 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 157 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 13:30:16] [INFO ] Invariant cache hit.
[2023-03-10 13:30:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-10 13:30:16] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 13:30:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-10 13:30:16] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 13:30:16] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-10 13:30:16] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 495/495 transitions.
Graph (trivial) has 385 edges and 372 vertex of which 140 / 372 are part of one of the 16 SCC in 1 ms
Free SCC test removed 124 places
Drop transitions removed 163 transitions
Reduce isomorphic transitions removed 163 transitions.
Graph (complete) has 643 edges and 248 vertex of which 244 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 244 transition count 225
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 212 place count 141 transition count 225
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 212 place count 141 transition count 203
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 256 place count 119 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 258 place count 117 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 117 transition count 201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 260 place count 117 transition count 199
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 115 transition count 199
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 330 place count 82 transition count 166
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 358 place count 68 transition count 202
Drop transitions removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 372 place count 68 transition count 188
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 404 place count 68 transition count 156
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 424 place count 68 transition count 134
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 227 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 42 rules applied. Total rules applied 466 place count 47 transition count 113
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 467 place count 47 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 468 place count 46 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 469 place count 46 transition count 109
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 481 place count 46 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 46 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 483 place count 45 transition count 96
Applied a total of 483 rules in 49 ms. Remains 45 /372 variables (removed 327) and now considering 96/495 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 45/372 places, 96/495 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND p1 p0)), (F p1)]
Knowledge based reduction with 10 factoid took 551 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 372/372 places, 495/495 transitions.
Applied a total of 0 rules in 6 ms. Remains 372 /372 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2023-03-10 13:30:17] [INFO ] Invariant cache hit.
[2023-03-10 13:30:17] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-10 13:30:17] [INFO ] Invariant cache hit.
[2023-03-10 13:30:18] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-10 13:30:18] [INFO ] Invariant cache hit.
[2023-03-10 13:30:18] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 872 ms. Remains : 372/372 places, 495/495 transitions.
Computed a total of 55 stabilizing places and 107 stable transitions
Graph (complete) has 860 edges and 372 vertex of which 368 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Computed a total of 55 stabilizing places and 107 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 425 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 159 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-10 13:30:19] [INFO ] Invariant cache hit.
[2023-03-10 13:30:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-10 13:30:19] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 13:30:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 13:30:20] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 13:30:20] [INFO ] After 268ms 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 13:30:20] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 495/495 transitions.
Graph (trivial) has 385 edges and 372 vertex of which 140 / 372 are part of one of the 16 SCC in 1 ms
Free SCC test removed 124 places
Drop transitions removed 163 transitions
Reduce isomorphic transitions removed 163 transitions.
Graph (complete) has 643 edges and 248 vertex of which 244 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 244 transition count 225
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 212 place count 141 transition count 225
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 212 place count 141 transition count 203
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 256 place count 119 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 258 place count 117 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 117 transition count 201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 260 place count 117 transition count 199
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 115 transition count 199
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 330 place count 82 transition count 166
Performed 14 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 358 place count 68 transition count 202
Drop transitions removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 372 place count 68 transition count 188
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 404 place count 68 transition count 156
Free-agglomeration rule applied 20 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 424 place count 68 transition count 134
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 227 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 42 rules applied. Total rules applied 466 place count 47 transition count 113
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 467 place count 47 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 468 place count 46 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 469 place count 46 transition count 109
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 481 place count 46 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 46 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 483 place count 45 transition count 96
Applied a total of 483 rules in 45 ms. Remains 45 /372 variables (removed 327) and now considering 96/495 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 45/372 places, 96/495 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished Best-First random walk after 6740 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=748 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND p1 p0)), (F p1)]
Knowledge based reduction with 10 factoid took 532 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Entered a terminal (fully accepting) state of product in 15165 steps with 230 reset in 33 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-12 finished in 7491 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 1 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Graph (trivial) has 395 edges and 379 vertex of which 143 / 379 are part of one of the 16 SCC in 0 ms
Free SCC test removed 127 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (complete) has 699 edges and 252 vertex of which 248 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 247 transition count 250
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 212 place count 142 transition count 250
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 212 place count 142 transition count 231
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 250 place count 123 transition count 231
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 252 place count 121 transition count 229
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 121 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 254 place count 121 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 258 place count 119 transition count 227
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 334 place count 81 transition count 188
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 358 place count 69 transition count 222
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 370 place count 69 transition count 210
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 394 place count 69 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 395 place count 68 transition count 185
Applied a total of 395 rules in 36 ms. Remains 68 /379 variables (removed 311) and now considering 185/502 (removed 317) transitions.
[2023-03-10 13:30:21] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
// Phase 1: matrix 146 rows 68 cols
[2023-03-10 13:30:21] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 13:30:21] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-10 13:30:21] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2023-03-10 13:30:21] [INFO ] Invariant cache hit.
[2023-03-10 13:30:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 13:30:21] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-10 13:30:21] [INFO ] Redundant transitions in 151 ms returned []
[2023-03-10 13:30:21] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2023-03-10 13:30:21] [INFO ] Invariant cache hit.
[2023-03-10 13:30:21] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/379 places, 185/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 509 ms. Remains : 68/379 places, 185/502 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s51 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7946 steps with 768 reset in 14 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-14 finished in 578 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 1 out of 379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 379/379 places, 502/502 transitions.
Graph (trivial) has 397 edges and 379 vertex of which 144 / 379 are part of one of the 16 SCC in 1 ms
Free SCC test removed 128 places
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Graph (complete) has 697 edges and 251 vertex of which 247 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 246 transition count 249
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 210 place count 142 transition count 249
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 210 place count 142 transition count 229
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 250 place count 122 transition count 229
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 252 place count 120 transition count 227
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 120 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 254 place count 120 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 258 place count 118 transition count 225
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 330 place count 82 transition count 188
Performed 12 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 354 place count 70 transition count 222
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 366 place count 70 transition count 210
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 390 place count 70 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 69 transition count 185
Applied a total of 391 rules in 38 ms. Remains 69 /379 variables (removed 310) and now considering 185/502 (removed 317) transitions.
[2023-03-10 13:30:21] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
// Phase 1: matrix 146 rows 69 cols
[2023-03-10 13:30:21] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 13:30:21] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-10 13:30:21] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2023-03-10 13:30:21] [INFO ] Invariant cache hit.
[2023-03-10 13:30:21] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-10 13:30:22] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-10 13:30:22] [INFO ] Redundant transitions in 150 ms returned []
[2023-03-10 13:30:22] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
[2023-03-10 13:30:22] [INFO ] Invariant cache hit.
[2023-03-10 13:30:22] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/379 places, 185/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 69/379 places, 185/502 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-2b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-2b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-2b-LTLFireability-15 finished in 552 ms.
All properties solved by simple procedures.
Total runtime 25308 ms.
ITS solved all properties within timeout

BK_STOP 1678455023670

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-2b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="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-2b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r073-smll-167814399500372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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