Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 11 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 591K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-4b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716261917891

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 03:25:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:25:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:25:19] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-21 03:25:19] [INFO ] Transformed 1182 places.
[2024-05-21 03:25:19] [INFO ] Transformed 1824 transitions.
[2024-05-21 03:25:19] [INFO ] Found NUPN structural information;
[2024-05-21 03:25:19] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudDeployment-PT-4b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1177 transition count 1824
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 304 place count 878 transition count 1278
Iterating global reduction 1 with 299 rules applied. Total rules applied 603 place count 878 transition count 1278
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 709 place count 772 transition count 1172
Iterating global reduction 1 with 106 rules applied. Total rules applied 815 place count 772 transition count 1172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 824 place count 772 transition count 1163
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 836 place count 760 transition count 1151
Iterating global reduction 2 with 12 rules applied. Total rules applied 848 place count 760 transition count 1151
Applied a total of 848 rules in 444 ms. Remains 760 /1182 variables (removed 422) and now considering 1151/1824 (removed 673) transitions.
// Phase 1: matrix 1151 rows 760 cols
[2024-05-21 03:25:20] [INFO ] Computed 12 invariants in 29 ms
[2024-05-21 03:25:20] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-21 03:25:20] [INFO ] Invariant cache hit.
[2024-05-21 03:25:21] [INFO ] Implicit Places using invariants and state equation in 643 ms returned [10, 19, 188, 202, 369, 377, 546, 555]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 991 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 752/1182 places, 1151/1824 transitions.
Applied a total of 0 rules in 19 ms. Remains 752 /752 variables (removed 0) and now considering 1151/1151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1455 ms. Remains : 752/1182 places, 1151/1824 transitions.
Support contains 33 out of 752 places after structural reductions.
[2024-05-21 03:25:21] [INFO ] Flatten gal took : 117 ms
[2024-05-21 03:25:21] [INFO ] Flatten gal took : 64 ms
[2024-05-21 03:25:21] [INFO ] Input system was already deterministic with 1151 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1151 rows 752 cols
[2024-05-21 03:25:22] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 03:25:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 03:25:22] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 03:25:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 03:25:23] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 03:25:23] [INFO ] After 989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 243 ms.
[2024-05-21 03:25:24] [INFO ] After 1455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 3 properties in 56 ms.
Support contains 6 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1151/1151 transitions.
Graph (trivial) has 778 edges and 752 vertex of which 276 / 752 are part of one of the 31 SCC in 4 ms
Free SCC test removed 245 places
Drop transitions removed 321 transitions
Reduce isomorphic transitions removed 321 transitions.
Graph (complete) has 1613 edges and 507 vertex of which 501 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 220 rules applied. Total rules applied 222 place count 501 transition count 610
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 434 place count 289 transition count 610
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 434 place count 289 transition count 566
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 522 place count 245 transition count 566
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 530 place count 237 transition count 558
Iterating global reduction 2 with 8 rules applied. Total rules applied 538 place count 237 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 539 place count 237 transition count 557
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 539 place count 237 transition count 553
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 547 place count 233 transition count 553
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 679 place count 167 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 680 place count 167 transition count 485
Performed 29 Post agglomeration using F-continuation condition with reduction of 36 identical transitions.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 738 place count 138 transition count 619
Drop transitions removed 11 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 762 place count 138 transition count 595
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 862 place count 138 transition count 495
Free-agglomeration rule applied 40 times with reduction of 12 identical transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 902 place count 138 transition count 443
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 665 edges and 98 vertex of which 97 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 5 with 129 rules applied. Total rules applied 1031 place count 97 transition count 355
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1032 place count 97 transition count 354
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1034 place count 95 transition count 344
Iterating global reduction 7 with 2 rules applied. Total rules applied 1036 place count 95 transition count 344
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 7 with 48 rules applied. Total rules applied 1084 place count 95 transition count 296
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1085 place count 95 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1086 place count 94 transition count 295
Applied a total of 1086 rules in 170 ms. Remains 94 /752 variables (removed 658) and now considering 295/1151 (removed 856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 94/752 places, 295/1151 transitions.
Finished random walk after 8078 steps, including 127 resets, run visited all 3 properties in 31 ms. (steps per millisecond=260 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 110 stabilizing places and 326 stable transitions
Graph (complete) has 2043 edges and 752 vertex of which 746 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1151/1151 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 740 transition count 1139
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 740 transition count 1139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 740 transition count 1138
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 736 transition count 1134
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 736 transition count 1134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 736 transition count 1132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 735 transition count 1131
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 735 transition count 1131
Applied a total of 37 rules in 57 ms. Remains 735 /752 variables (removed 17) and now considering 1131/1151 (removed 20) transitions.
// Phase 1: matrix 1131 rows 735 cols
[2024-05-21 03:25:24] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 03:25:24] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 03:25:24] [INFO ] Invariant cache hit.
[2024-05-21 03:25:25] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2024-05-21 03:25:25] [INFO ] Invariant cache hit.
[2024-05-21 03:25:25] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 735/752 places, 1131/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1187 ms. Remains : 735/752 places, 1131/1151 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s545 0) (EQ s464 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 739 ms.
Product exploration explored 100000 steps with 50000 reset in 625 ms.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2013 edges and 735 vertex of which 729 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-4b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4b-LTLCardinality-00 finished in 2829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1151/1151 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 741 transition count 1140
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 741 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 741 transition count 1139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 737 transition count 1135
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 737 transition count 1135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 737 transition count 1133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 736 transition count 1132
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 736 transition count 1132
Applied a total of 35 rules in 51 ms. Remains 736 /752 variables (removed 16) and now considering 1132/1151 (removed 19) transitions.
// Phase 1: matrix 1132 rows 736 cols
[2024-05-21 03:25:27] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 03:25:27] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 03:25:27] [INFO ] Invariant cache hit.
[2024-05-21 03:25:28] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-05-21 03:25:28] [INFO ] Invariant cache hit.
[2024-05-21 03:25:28] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 736/752 places, 1132/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1155 ms. Remains : 736/752 places, 1132/1151 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-4b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLCardinality-01 finished in 1267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1 U p2)))))'
Support contains 6 out of 752 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1151/1151 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 741 transition count 1140
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 741 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 741 transition count 1139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 738 transition count 1136
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 738 transition count 1136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 738 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 737 transition count 1134
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 737 transition count 1134
Applied a total of 32 rules in 60 ms. Remains 737 /752 variables (removed 15) and now considering 1134/1151 (removed 17) transitions.
// Phase 1: matrix 1134 rows 737 cols
[2024-05-21 03:25:28] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 03:25:28] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 03:25:28] [INFO ] Invariant cache hit.
[2024-05-21 03:25:29] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-05-21 03:25:29] [INFO ] Invariant cache hit.
[2024-05-21 03:25:29] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 737/752 places, 1134/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1143 ms. Remains : 737/752 places, 1134/1151 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s491 0) (EQ s9 1)) (OR (EQ s46 0) (EQ s183 1))), p2:(OR (EQ s726 0) (EQ s496 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 573 ms.
Product exploration explored 100000 steps with 50000 reset in 671 ms.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2017 edges and 737 vertex of which 731 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-4b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4b-LTLCardinality-03 finished in 2522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 752/752 places, 1151/1151 transitions.
Graph (trivial) has 782 edges and 752 vertex of which 277 / 752 are part of one of the 32 SCC in 3 ms
Free SCC test removed 245 places
Ensure Unique test removed 278 transitions
Reduce isomorphic transitions removed 278 transitions.
Graph (complete) has 1715 edges and 507 vertex of which 501 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 211 place count 500 transition count 661
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 420 place count 291 transition count 661
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 420 place count 291 transition count 621
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 500 place count 251 transition count 621
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 504 place count 247 transition count 617
Iterating global reduction 2 with 4 rules applied. Total rules applied 508 place count 247 transition count 617
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 508 place count 247 transition count 616
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 510 place count 246 transition count 616
Performed 78 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 666 place count 168 transition count 537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 667 place count 168 transition count 536
Performed 26 Post agglomeration using F-continuation condition with reduction of 38 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 719 place count 142 transition count 657
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 742 place count 142 transition count 634
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 4 with 82 rules applied. Total rules applied 824 place count 142 transition count 552
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 825 place count 141 transition count 551
Applied a total of 825 rules in 105 ms. Remains 141 /752 variables (removed 611) and now considering 551/1151 (removed 600) transitions.
[2024-05-21 03:25:31] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
// Phase 1: matrix 424 rows 141 cols
[2024-05-21 03:25:31] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 03:25:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 03:25:31] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
[2024-05-21 03:25:31] [INFO ] Invariant cache hit.
[2024-05-21 03:25:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 03:25:31] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-21 03:25:31] [INFO ] Redundant transitions in 308 ms returned []
[2024-05-21 03:25:31] [INFO ] Flow matrix only has 424 transitions (discarded 127 similar events)
[2024-05-21 03:25:31] [INFO ] Invariant cache hit.
[2024-05-21 03:25:32] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/752 places, 551/1151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 849 ms. Remains : 141/752 places, 551/1151 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s93 0) (NEQ s91 1)), p1:(AND (NEQ s54 0) (NEQ s3 1))], nbAcceptance=2, 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-4b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLCardinality-05 finished in 956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 752 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 752/752 places, 1151/1151 transitions.
Graph (trivial) has 781 edges and 752 vertex of which 283 / 752 are part of one of the 31 SCC in 2 ms
Free SCC test removed 252 places
Ensure Unique test removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Graph (complete) has 1704 edges and 500 vertex of which 494 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 206 rules applied. Total rules applied 208 place count 493 transition count 655
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 1 with 206 rules applied. Total rules applied 414 place count 287 transition count 655
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 414 place count 287 transition count 616
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 492 place count 248 transition count 616
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 498 place count 242 transition count 610
Iterating global reduction 2 with 6 rules applied. Total rules applied 504 place count 242 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 505 place count 242 transition count 609
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 505 place count 242 transition count 608
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 507 place count 241 transition count 608
Performed 76 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 659 place count 165 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 660 place count 165 transition count 530
Performed 24 Post agglomeration using F-continuation condition with reduction of 38 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 708 place count 141 transition count 640
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 726 place count 141 transition count 622
Drop transitions removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 5 with 68 rules applied. Total rules applied 794 place count 141 transition count 554
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 795 place count 140 transition count 553
Applied a total of 795 rules in 83 ms. Remains 140 /752 variables (removed 612) and now considering 553/1151 (removed 598) transitions.
[2024-05-21 03:25:32] [INFO ] Flow matrix only has 431 transitions (discarded 122 similar events)
// Phase 1: matrix 431 rows 140 cols
[2024-05-21 03:25:32] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 03:25:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 03:25:32] [INFO ] Flow matrix only has 431 transitions (discarded 122 similar events)
[2024-05-21 03:25:32] [INFO ] Invariant cache hit.
[2024-05-21 03:25:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 03:25:32] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2024-05-21 03:25:32] [INFO ] Redundant transitions in 264 ms returned []
[2024-05-21 03:25:32] [INFO ] Flow matrix only has 431 transitions (discarded 122 similar events)
[2024-05-21 03:25:32] [INFO ] Invariant cache hit.
[2024-05-21 03:25:32] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/752 places, 553/1151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 785 ms. Remains : 140/752 places, 553/1151 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s24 1) (AND (NEQ s28 0) (NEQ s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6746 steps with 271 reset in 37 ms.
FORMULA CloudDeployment-PT-4b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLCardinality-06 finished in 920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&F(p1)))))'
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1151/1151 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 742 transition count 1141
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 742 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 742 transition count 1140
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 738 transition count 1136
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 738 transition count 1136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 738 transition count 1134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 737 transition count 1133
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 737 transition count 1133
Applied a total of 33 rules in 52 ms. Remains 737 /752 variables (removed 15) and now considering 1133/1151 (removed 18) transitions.
// Phase 1: matrix 1133 rows 737 cols
[2024-05-21 03:25:33] [INFO ] Computed 4 invariants in 12 ms
[2024-05-21 03:25:33] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 03:25:33] [INFO ] Invariant cache hit.
[2024-05-21 03:25:33] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2024-05-21 03:25:33] [INFO ] Invariant cache hit.
[2024-05-21 03:25:34] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 737/752 places, 1133/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1124 ms. Remains : 737/752 places, 1133/1151 transitions.
Stuttering acceptance computed with spot in 224 ms :[p0, p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s55 0) (EQ s189 1)), p1:(OR (EQ s215 0) (EQ s61 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]]
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-4b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-4b-LTLCardinality-07 finished in 1381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1&&X(G(p2)))))'
Support contains 6 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1151/1151 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 741 transition count 1140
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 741 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 741 transition count 1139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 738 transition count 1136
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 738 transition count 1136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 738 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 737 transition count 1134
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 737 transition count 1134
Applied a total of 32 rules in 66 ms. Remains 737 /752 variables (removed 15) and now considering 1134/1151 (removed 17) transitions.
// Phase 1: matrix 1134 rows 737 cols
[2024-05-21 03:25:34] [INFO ] Computed 4 invariants in 8 ms
[2024-05-21 03:25:34] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 03:25:34] [INFO ] Invariant cache hit.
[2024-05-21 03:25:35] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-21 03:25:35] [INFO ] Invariant cache hit.
[2024-05-21 03:25:35] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 737/752 places, 1134/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1127 ms. Remains : 737/752 places, 1134/1151 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s590 0) (EQ s66 1)), p0:(OR (EQ s636 0) (EQ s215 1)), p2:(OR (EQ s183 0) (EQ s486 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 784 reset in 220 ms.
Product exploration explored 100000 steps with 773 reset in 265 ms.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2017 edges and 737 vertex of which 731 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 p0)), (X (NOT (AND p1 p0 (NOT p2)))), (X p2), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 219 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 78 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-21 03:25:37] [INFO ] Invariant cache hit.
[2024-05-21 03:25:37] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-21 03:25:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 03:25:37] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-21 03:25:38] [INFO ] After 811ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 193 ms.
[2024-05-21 03:25:38] [INFO ] After 1213ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 29 ms.
Support contains 6 out of 737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 737/737 places, 1134/1134 transitions.
Graph (trivial) has 763 edges and 737 vertex of which 284 / 737 are part of one of the 32 SCC in 1 ms
Free SCC test removed 252 places
Drop transitions removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Graph (complete) has 1577 edges and 485 vertex of which 479 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 206 rules applied. Total rules applied 208 place count 479 transition count 598
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 407 place count 281 transition count 597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 408 place count 280 transition count 597
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 408 place count 280 transition count 554
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 494 place count 237 transition count 554
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 498 place count 233 transition count 550
Iterating global reduction 3 with 4 rules applied. Total rules applied 502 place count 233 transition count 550
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 502 place count 233 transition count 546
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 510 place count 229 transition count 546
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 638 place count 165 transition count 482
Performed 28 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 694 place count 137 transition count 618
Drop transitions removed 11 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 721 place count 137 transition count 591
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 4 with 96 rules applied. Total rules applied 817 place count 137 transition count 495
Free-agglomeration rule applied 39 times with reduction of 11 identical transitions.
Iterating global reduction 4 with 39 rules applied. Total rules applied 856 place count 137 transition count 445
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 59 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 4 with 122 rules applied. Total rules applied 978 place count 98 transition count 362
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 981 place count 95 transition count 347
Iterating global reduction 5 with 3 rules applied. Total rules applied 984 place count 95 transition count 347
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 5 with 52 rules applied. Total rules applied 1036 place count 95 transition count 295
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1038 place count 95 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1039 place count 94 transition count 294
Applied a total of 1039 rules in 74 ms. Remains 94 /737 variables (removed 643) and now considering 294/1134 (removed 840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 94/737 places, 294/1134 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:25:38] [INFO ] Flow matrix only has 173 transitions (discarded 121 similar events)
// Phase 1: matrix 173 rows 94 cols
[2024-05-21 03:25:38] [INFO ] Computed 16 invariants in 3 ms
[2024-05-21 03:25:38] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:25:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-21 03:25:38] [INFO ] [Nat]Absence check using 4 positive and 12 generalized place invariants in 1 ms returned sat
[2024-05-21 03:25:38] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:25:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 03:25:38] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 03:25:38] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 03:25:38] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 294/294 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 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 93 transition count 293
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 93 transition count 292
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 92 transition count 292
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 90 transition count 290
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 90 transition count 287
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 19 place count 90 transition count 279
Applied a total of 19 rules in 21 ms. Remains 90 /94 variables (removed 4) and now considering 279/294 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 90/94 places, 279/294 transitions.
Finished random walk after 9268 steps, including 163 resets, run visited all 1 properties in 18 ms. (steps per millisecond=514 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 p0)), (X (NOT (AND p1 p0 (NOT p2)))), (X p2), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 23 factoid took 933 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Support contains 6 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 1134/1134 transitions.
Applied a total of 0 rules in 12 ms. Remains 737 /737 variables (removed 0) and now considering 1134/1134 (removed 0) transitions.
// Phase 1: matrix 1134 rows 737 cols
[2024-05-21 03:25:40] [INFO ] Computed 4 invariants in 7 ms
[2024-05-21 03:25:40] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 03:25:40] [INFO ] Invariant cache hit.
[2024-05-21 03:25:40] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2024-05-21 03:25:40] [INFO ] Invariant cache hit.
[2024-05-21 03:25:41] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1100 ms. Remains : 737/737 places, 1134/1134 transitions.
Computed a total of 106 stabilizing places and 322 stable transitions
Graph (complete) has 2017 edges and 737 vertex of which 731 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.10 ms
Computed a total of 106 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 173 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 03:25:41] [INFO ] Invariant cache hit.
[2024-05-21 03:25:41] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 03:25:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 03:25:42] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-21 03:25:42] [INFO ] After 483ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-21 03:25:42] [INFO ] After 690ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 737/737 places, 1134/1134 transitions.
Graph (trivial) has 763 edges and 737 vertex of which 284 / 737 are part of one of the 32 SCC in 1 ms
Free SCC test removed 252 places
Drop transitions removed 330 transitions
Reduce isomorphic transitions removed 330 transitions.
Graph (complete) has 1577 edges and 485 vertex of which 479 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 206 rules applied. Total rules applied 208 place count 479 transition count 598
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 407 place count 281 transition count 597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 408 place count 280 transition count 597
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 408 place count 280 transition count 554
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 494 place count 237 transition count 554
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 498 place count 233 transition count 550
Iterating global reduction 3 with 4 rules applied. Total rules applied 502 place count 233 transition count 550
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 502 place count 233 transition count 546
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 510 place count 229 transition count 546
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 638 place count 165 transition count 482
Performed 28 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 694 place count 137 transition count 618
Drop transitions removed 11 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 721 place count 137 transition count 591
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 4 with 96 rules applied. Total rules applied 817 place count 137 transition count 495
Free-agglomeration rule applied 39 times with reduction of 11 identical transitions.
Iterating global reduction 4 with 39 rules applied. Total rules applied 856 place count 137 transition count 445
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 59 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 4 with 122 rules applied. Total rules applied 978 place count 98 transition count 362
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 981 place count 95 transition count 347
Iterating global reduction 5 with 3 rules applied. Total rules applied 984 place count 95 transition count 347
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 5 with 52 rules applied. Total rules applied 1036 place count 95 transition count 295
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1038 place count 95 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1039 place count 94 transition count 294
Applied a total of 1039 rules in 69 ms. Remains 94 /737 variables (removed 643) and now considering 294/1134 (removed 840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 94/737 places, 294/1134 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Finished probabilistic random walk after 10308 steps, run visited all 2 properties in 59 ms. (steps per millisecond=174 )
Probabilistic random walk after 10308 steps, saw 2393 distinct states, run finished after 60 ms. (steps per millisecond=171 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 21 factoid took 744 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 768 reset in 189 ms.
Product exploration explored 100000 steps with 780 reset in 249 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Support contains 6 out of 737 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 737/737 places, 1134/1134 transitions.
Graph (trivial) has 763 edges and 737 vertex of which 284 / 737 are part of one of the 32 SCC in 1 ms
Free SCC test removed 252 places
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Graph (complete) has 1677 edges and 485 vertex of which 479 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 195 rules applied. Total rules applied 197 place count 479 transition count 844
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 197 place count 479 transition count 867
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 223 place count 479 transition count 867
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 324 place count 378 transition count 766
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 425 place count 378 transition count 766
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 201 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 506 place count 378 transition count 766
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 567 place count 317 transition count 705
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 628 place count 317 transition count 705
Performed 28 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 656 place count 317 transition count 897
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 660 place count 317 transition count 893
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 692 place count 285 transition count 793
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 724 place count 285 transition count 793
Deduced a syphon composed of 136 places in 0 ms
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 2 with 60 rules applied. Total rules applied 784 place count 285 transition count 733
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 792 place count 277 transition count 725
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 800 place count 277 transition count 725
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 804 place count 277 transition count 809
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 812 place count 269 transition count 777
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 820 place count 269 transition count 777
Deduced a syphon composed of 124 places in 0 ms
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 2 with 51 rules applied. Total rules applied 871 place count 269 transition count 726
Deduced a syphon composed of 124 places in 0 ms
Applied a total of 871 rules in 110 ms. Remains 269 /737 variables (removed 468) and now considering 726/1134 (removed 408) transitions.
[2024-05-21 03:25:45] [INFO ] Redundant transitions in 307 ms returned []
[2024-05-21 03:25:45] [INFO ] Flow matrix only has 607 transitions (discarded 119 similar events)
// Phase 1: matrix 607 rows 269 cols
[2024-05-21 03:25:45] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 03:25:45] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 269/737 places, 726/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 639 ms. Remains : 269/737 places, 726/1134 transitions.
Built C files in :
/tmp/ltsmin13496931385189964982
[2024-05-21 03:25:45] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13496931385189964982
Running compilation step : cd /tmp/ltsmin13496931385189964982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1986 ms.
Running link step : cd /tmp/ltsmin13496931385189964982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13496931385189964982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6309811665924044286.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 1134/1134 transitions.
Applied a total of 0 rules in 17 ms. Remains 737 /737 variables (removed 0) and now considering 1134/1134 (removed 0) transitions.
// Phase 1: matrix 1134 rows 737 cols
[2024-05-21 03:26:00] [INFO ] Computed 4 invariants in 8 ms
[2024-05-21 03:26:00] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 03:26:00] [INFO ] Invariant cache hit.
[2024-05-21 03:26:01] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-21 03:26:01] [INFO ] Invariant cache hit.
[2024-05-21 03:26:01] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1045 ms. Remains : 737/737 places, 1134/1134 transitions.
Built C files in :
/tmp/ltsmin27880461493324038
[2024-05-21 03:26:01] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin27880461493324038
Running compilation step : cd /tmp/ltsmin27880461493324038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1841 ms.
Running link step : cd /tmp/ltsmin27880461493324038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin27880461493324038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18355803174262910748.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 03:26:16] [INFO ] Flatten gal took : 50 ms
[2024-05-21 03:26:16] [INFO ] Flatten gal took : 47 ms
[2024-05-21 03:26:16] [INFO ] Time to serialize gal into /tmp/LTL14749792766650317135.gal : 13 ms
[2024-05-21 03:26:16] [INFO ] Time to serialize properties into /tmp/LTL17272349347076943309.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14749792766650317135.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9254839751985447866.hoa' '-atoms' '/tmp/LTL17272349347076943309.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17272349347076943309.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9254839751985447866.hoa
Detected timeout of ITS tools.
[2024-05-21 03:26:32] [INFO ] Flatten gal took : 44 ms
[2024-05-21 03:26:32] [INFO ] Flatten gal took : 42 ms
[2024-05-21 03:26:32] [INFO ] Time to serialize gal into /tmp/LTL6501159888464744620.gal : 6 ms
[2024-05-21 03:26:32] [INFO ] Time to serialize properties into /tmp/LTL5567281662816021424.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6501159888464744620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5567281662816021424.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((("((p1050==0)||(p372==1))")U((X(G("((p295==0)||(p799==1))")))&&("((p983==0)||(p129==1))"))))
Formula 0 simplified : !"((p1050==0)||(p372==1))" R (!"((p983==0)||(p129==1))" | XF!"((p295==0)||(p799==1))")
Detected timeout of ITS tools.
[2024-05-21 03:26:47] [INFO ] Flatten gal took : 40 ms
[2024-05-21 03:26:47] [INFO ] Applying decomposition
[2024-05-21 03:26:47] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14693245730093833422.txt' '-o' '/tmp/graph14693245730093833422.bin' '-w' '/tmp/graph14693245730093833422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14693245730093833422.bin' '-l' '-1' '-v' '-w' '/tmp/graph14693245730093833422.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:26:47] [INFO ] Decomposing Gal with order
[2024-05-21 03:26:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:26:47] [INFO ] Removed a total of 1118 redundant transitions.
[2024-05-21 03:26:47] [INFO ] Flatten gal took : 111 ms
[2024-05-21 03:26:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 26 ms.
[2024-05-21 03:26:47] [INFO ] Time to serialize gal into /tmp/LTL13221805443386008964.gal : 11 ms
[2024-05-21 03:26:47] [INFO ] Time to serialize properties into /tmp/LTL10171960601929922960.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13221805443386008964.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10171960601929922960.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((("((i21.u233.p1050==0)||(i9.i0.i1.u102.p372==1))")U((X(G("((i23.u69.p295==0)||(i15.u181.p799==1))")))&&("((i19.i0.i2.u214.p983==0)|...178
Formula 0 simplified : !"((i21.u233.p1050==0)||(i9.i0.i1.u102.p372==1))" R (!"((i19.i0.i2.u214.p983==0)||(i0.u20.p129==1))" | XF!"((i23.u69.p295==0)||(i15....171
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5935449456066510793
[2024-05-21 03:27:02] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5935449456066510793
Running compilation step : cd /tmp/ltsmin5935449456066510793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1870 ms.
Running link step : cd /tmp/ltsmin5935449456066510793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5935449456066510793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U (X([]((LTLAPp1==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CloudDeployment-PT-4b-LTLCardinality-08 finished in 103358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X((G(p0)||G(p1))) U p2)&&G(p1))))'
Support contains 4 out of 752 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1151/1151 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 743 transition count 1142
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 743 transition count 1142
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 743 transition count 1141
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 741 transition count 1139
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 741 transition count 1139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 741 transition count 1137
Applied a total of 25 rules in 43 ms. Remains 741 /752 variables (removed 11) and now considering 1137/1151 (removed 14) transitions.
// Phase 1: matrix 1137 rows 741 cols
[2024-05-21 03:27:17] [INFO ] Computed 4 invariants in 9 ms
[2024-05-21 03:27:18] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-21 03:27:18] [INFO ] Invariant cache hit.
[2024-05-21 03:27:18] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2024-05-21 03:27:18] [INFO ] Invariant cache hit.
[2024-05-21 03:27:18] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 741/752 places, 1137/1151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1140 ms. Remains : 741/752 places, 1137/1151 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s183 0) (EQ s439 1)), p2:(OR (EQ s12 0) (EQ s380 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 791 reset in 170 ms.
Product exploration explored 100000 steps with 780 reset in 204 ms.
Computed a total of 108 stabilizing places and 324 stable transitions
Graph (complete) has 2021 edges and 741 vertex of which 735 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 108 stabilizing places and 324 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 654319 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 654319 steps, saw 147260 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 03:27:22] [INFO ] Invariant cache hit.
[2024-05-21 03:27:22] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 03:27:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 03:27:23] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 03:27:23] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-21 03:27:23] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 741 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 741/741 places, 1137/1137 transitions.
Graph (trivial) has 772 edges and 741 vertex of which 282 / 741 are part of one of the 32 SCC in 6 ms
Free SCC test removed 250 places
Drop transitions removed 327 transitions
Reduce isomorphic transitions removed 327 transitions.
Graph (complete) has 1584 edges and 491 vertex of which 485 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 213 rules applied. Total rules applied 215 place count 485 transition count 597
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 1 with 205 rules applied. Total rules applied 420 place count 280 transition count 597
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 420 place count 280 transition count 552
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 510 place count 235 transition count 552
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 514 place count 231 transition count 548
Iterating global reduction 2 with 4 rules applied. Total rules applied 518 place count 231 transition count 548
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 518 place count 231 transition count 544
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 526 place count 227 transition count 544
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 656 place count 162 transition count 479
Performed 29 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 714 place count 133 transition count 615
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 743 place count 133 transition count 586
Drop transitions removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 3 with 104 rules applied. Total rules applied 847 place count 133 transition count 482
Free-agglomeration rule applied 40 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 887 place count 133 transition count 430
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 60 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 640 edges and 93 vertex of which 92 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 133 rules applied. Total rules applied 1020 place count 92 transition count 338
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1021 place count 92 transition count 337
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1024 place count 89 transition count 322
Iterating global reduction 5 with 3 rules applied. Total rules applied 1027 place count 89 transition count 322
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 5 with 44 rules applied. Total rules applied 1071 place count 89 transition count 278
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1072 place count 89 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1073 place count 88 transition count 277
Applied a total of 1073 rules in 70 ms. Remains 88 /741 variables (removed 653) and now considering 277/1137 (removed 860) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 88/741 places, 277/1137 transitions.
Finished random walk after 47 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p1), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 8 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-4b-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-4b-LTLCardinality-12 finished in 5658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1&&X(G(p2)))))'
Found a Lengthening insensitive property : CloudDeployment-PT-4b-LTLCardinality-08
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Support contains 6 out of 752 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 752/752 places, 1151/1151 transitions.
Graph (trivial) has 778 edges and 752 vertex of which 288 / 752 are part of one of the 32 SCC in 1 ms
Free SCC test removed 256 places
Ensure Unique test removed 292 transitions
Reduce isomorphic transitions removed 292 transitions.
Graph (complete) has 1699 edges and 496 vertex of which 490 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 203 place count 489 transition count 655
Reduce places removed 201 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 202 rules applied. Total rules applied 405 place count 288 transition count 654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 406 place count 287 transition count 654
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 406 place count 287 transition count 617
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 480 place count 250 transition count 617
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 485 place count 245 transition count 612
Iterating global reduction 3 with 5 rules applied. Total rules applied 490 place count 245 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 491 place count 245 transition count 611
Performed 76 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 643 place count 169 transition count 534
Performed 24 Post agglomeration using F-continuation condition with reduction of 38 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 691 place count 145 transition count 644
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 709 place count 145 transition count 626
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 712 place count 145 transition count 623
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 713 place count 144 transition count 622
Applied a total of 713 rules in 48 ms. Remains 144 /752 variables (removed 608) and now considering 622/1151 (removed 529) transitions.
[2024-05-21 03:27:23] [INFO ] Flow matrix only has 503 transitions (discarded 119 similar events)
// Phase 1: matrix 503 rows 144 cols
[2024-05-21 03:27:23] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 03:27:23] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 03:27:23] [INFO ] Flow matrix only has 503 transitions (discarded 119 similar events)
[2024-05-21 03:27:23] [INFO ] Invariant cache hit.
[2024-05-21 03:27:23] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 03:27:24] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-21 03:27:24] [INFO ] Flow matrix only has 503 transitions (discarded 119 similar events)
[2024-05-21 03:27:24] [INFO ] Invariant cache hit.
[2024-05-21 03:27:24] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 144/752 places, 622/1151 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 524 ms. Remains : 144/752 places, 622/1151 transitions.
Running random walk in product with property : CloudDeployment-PT-4b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s109 0) (EQ s16 1)), p0:(OR (EQ s114 0) (EQ s42 1)), p2:(OR (EQ s30 0) (EQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 700 steps with 29 reset in 3 ms.
Treatment of property CloudDeployment-PT-4b-LTLCardinality-08 finished in 740 ms.
FORMULA CloudDeployment-PT-4b-LTLCardinality-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 03:27:24] [INFO ] Flatten gal took : 36 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 124859 ms.

BK_STOP 1716262045215

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CloudDeployment-PT-4b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620522100362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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