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.r241-tall-171649628400202.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 LeafsetExtension-PT-S08C3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 254K 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 LeafsetExtension-PT-S08C3-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716562737945

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=LeafsetExtension-PT-S08C3
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 14:58:59] [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-24 14:58:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 14:58:59] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-24 14:58:59] [INFO ] Transformed 462 places.
[2024-05-24 14:58:59] [INFO ] Transformed 409 transitions.
[2024-05-24 14:58:59] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 127 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 4 formulas.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 383 transition count 409
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 141 place count 321 transition count 347
Iterating global reduction 1 with 62 rules applied. Total rules applied 203 place count 321 transition count 347
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 243 place count 281 transition count 307
Iterating global reduction 1 with 40 rules applied. Total rules applied 283 place count 281 transition count 307
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 317 place count 247 transition count 273
Iterating global reduction 1 with 34 rules applied. Total rules applied 351 place count 247 transition count 273
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 355 place count 243 transition count 273
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 357 place count 241 transition count 271
Iterating global reduction 2 with 2 rules applied. Total rules applied 359 place count 241 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 361 place count 239 transition count 269
Iterating global reduction 2 with 2 rules applied. Total rules applied 363 place count 239 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 364 place count 238 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 365 place count 238 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 366 place count 237 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 367 place count 237 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 369 place count 235 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 371 place count 235 transition count 265
Applied a total of 371 rules in 93 ms. Remains 235 /462 variables (removed 227) and now considering 265/409 (removed 144) transitions.
[2024-05-24 14:58:59] [INFO ] Flow matrix only has 263 transitions (discarded 2 similar events)
// Phase 1: matrix 263 rows 235 cols
[2024-05-24 14:58:59] [INFO ] Computed 28 invariants in 23 ms
[2024-05-24 14:59:00] [INFO ] Implicit Places using invariants in 294 ms returned [34, 54, 86, 96, 98, 117, 144, 148, 168, 190, 202, 212]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 318 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/462 places, 265/409 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 202 transition count 244
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 202 transition count 244
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 200 transition count 242
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 200 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 199 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 199 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 198 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 198 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 197 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 197 transition count 239
Applied a total of 52 rules in 19 ms. Remains 197 /223 variables (removed 26) and now considering 239/265 (removed 26) transitions.
[2024-05-24 14:59:00] [INFO ] Flow matrix only has 234 transitions (discarded 5 similar events)
// Phase 1: matrix 234 rows 197 cols
[2024-05-24 14:59:00] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 14:59:00] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 14:59:00] [INFO ] Flow matrix only has 234 transitions (discarded 5 similar events)
[2024-05-24 14:59:00] [INFO ] Invariant cache hit.
[2024-05-24 14:59:00] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 197/462 places, 239/409 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 712 ms. Remains : 197/462 places, 239/409 transitions.
Support contains 42 out of 197 places after structural reductions.
[2024-05-24 14:59:01] [INFO ] Flatten gal took : 41 ms
[2024-05-24 14:59:01] [INFO ] Flatten gal took : 17 ms
[2024-05-24 14:59:01] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 40 out of 197 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 372 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 24) seen :20
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-24 14:59:02] [INFO ] Flow matrix only has 234 transitions (discarded 5 similar events)
[2024-05-24 14:59:02] [INFO ] Invariant cache hit.
[2024-05-24 14:59:02] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 14:59:02] [INFO ] [Real]Absence check using 2 positive and 14 generalized place invariants in 7 ms returned sat
[2024-05-24 14:59:02] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 197 stabilizing places and 239 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 197 transition count 239
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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||(p1 U (G(p1)||(p1&&G(p2))))))))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Graph (complete) has 479 edges and 197 vertex of which 190 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 190 transition count 208
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 160 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 159 transition count 207
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 63 place count 159 transition count 185
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 107 place count 137 transition count 185
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 127 place count 117 transition count 165
Iterating global reduction 3 with 20 rules applied. Total rules applied 147 place count 117 transition count 165
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 151 place count 113 transition count 161
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 113 transition count 161
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 158 place count 110 transition count 161
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 158 place count 110 transition count 158
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 164 place count 107 transition count 158
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 169 place count 102 transition count 153
Iterating global reduction 4 with 5 rules applied. Total rules applied 174 place count 102 transition count 153
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 177 place count 99 transition count 150
Iterating global reduction 4 with 3 rules applied. Total rules applied 180 place count 99 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 184 place count 95 transition count 146
Iterating global reduction 4 with 4 rules applied. Total rules applied 188 place count 95 transition count 146
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 240 place count 69 transition count 120
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 247 place count 62 transition count 113
Iterating global reduction 4 with 7 rules applied. Total rules applied 254 place count 62 transition count 113
Applied a total of 254 rules in 41 ms. Remains 62 /197 variables (removed 135) and now considering 113/239 (removed 126) transitions.
[2024-05-24 14:59:02] [INFO ] Flow matrix only has 83 transitions (discarded 30 similar events)
// Phase 1: matrix 83 rows 62 cols
[2024-05-24 14:59:02] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 14:59:02] [INFO ] Implicit Places using invariants in 50 ms returned [2, 22, 34, 36, 41, 45]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 51 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/197 places, 113/239 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 53 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 53 transition count 110
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 50 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 50 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 49 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 49 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 26 place count 43 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 41 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 41 transition count 98
Applied a total of 30 rules in 8 ms. Remains 41 /56 variables (removed 15) and now considering 98/113 (removed 15) transitions.
[2024-05-24 14:59:02] [INFO ] Flow matrix only has 48 transitions (discarded 50 similar events)
// Phase 1: matrix 48 rows 41 cols
[2024-05-24 14:59:02] [INFO ] Computed 5 invariants in 3 ms
[2024-05-24 14:59:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 14:59:02] [INFO ] Flow matrix only has 48 transitions (discarded 50 similar events)
[2024-05-24 14:59:02] [INFO ] Invariant cache hit.
[2024-05-24 14:59:02] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/197 places, 98/239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 41/197 places, 98/239 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 264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(GT 1 s23), p1:(GT 1 s12), p0:(GT s3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 753 steps with 59 reset in 16 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-03 finished in 537 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((p0 U p1)) U X(p2)) U X(G(p0))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 191 transition count 239
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 32 place count 165 transition count 213
Iterating global reduction 1 with 26 rules applied. Total rules applied 58 place count 165 transition count 213
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 76 place count 147 transition count 195
Iterating global reduction 1 with 18 rules applied. Total rules applied 94 place count 147 transition count 195
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 98 place count 143 transition count 195
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 116 place count 125 transition count 177
Iterating global reduction 2 with 18 rules applied. Total rules applied 134 place count 125 transition count 177
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 138 place count 121 transition count 177
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 155 place count 104 transition count 160
Iterating global reduction 3 with 17 rules applied. Total rules applied 172 place count 104 transition count 160
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 180 place count 96 transition count 152
Iterating global reduction 3 with 8 rules applied. Total rules applied 188 place count 96 transition count 152
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 196 place count 88 transition count 144
Iterating global reduction 3 with 8 rules applied. Total rules applied 204 place count 88 transition count 144
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 214 place count 78 transition count 134
Iterating global reduction 3 with 10 rules applied. Total rules applied 224 place count 78 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 229 place count 73 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 234 place count 73 transition count 129
Applied a total of 234 rules in 24 ms. Remains 73 /197 variables (removed 124) and now considering 129/239 (removed 110) transitions.
[2024-05-24 14:59:03] [INFO ] Flow matrix only has 85 transitions (discarded 44 similar events)
// Phase 1: matrix 85 rows 73 cols
[2024-05-24 14:59:03] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 14:59:03] [INFO ] Implicit Places using invariants in 45 ms returned [32, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/197 places, 129/239 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 124
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 65 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 65 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 62 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 62 transition count 120
Applied a total of 18 rules in 3 ms. Remains 62 /71 variables (removed 9) and now considering 120/129 (removed 9) transitions.
[2024-05-24 14:59:03] [INFO ] Flow matrix only has 73 transitions (discarded 47 similar events)
// Phase 1: matrix 73 rows 62 cols
[2024-05-24 14:59:03] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 14:59:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-24 14:59:03] [INFO ] Flow matrix only has 73 transitions (discarded 47 similar events)
[2024-05-24 14:59:03] [INFO ] Invariant cache hit.
[2024-05-24 14:59:03] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 62/197 places, 120/239 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 62/197 places, 120/239 transitions.
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(OR p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(OR p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=8 dest: 8}]], initial=1, aps=[p0:(LEQ s41 s39), p2:(LEQ s45 s10), p1:(LEQ s7 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33291 reset in 337 ms.
Product exploration explored 100000 steps with 33131 reset in 211 ms.
Computed a total of 62 stabilizing places and 120 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 62 transition count 120
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 1798 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) p1 (NOT p2)), (NOT p0), true, (AND (NOT p0) p1), (NOT p1), (AND (NOT p0) (NOT p1) p2), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 344 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 14:59:06] [INFO ] Flow matrix only has 73 transitions (discarded 47 similar events)
[2024-05-24 14:59:06] [INFO ] Invariant cache hit.
[2024-05-24 14:59:06] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 14:59:06] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-24 14:59:06] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 14:59:06] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-24 14:59:06] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 120/120 transitions.
Graph (complete) has 118 edges and 62 vertex of which 46 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 46 transition count 101
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 41 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 40 transition count 100
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16 place count 40 transition count 96
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 24 place count 36 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 33 transition count 93
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 39 place count 33 transition count 84
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 48 place count 24 transition count 84
Applied a total of 48 rules in 11 ms. Remains 24 /62 variables (removed 38) and now considering 84/120 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 24/62 places, 84/120 transitions.
Finished random walk after 7452 steps, including 1033 resets, run visited all 1 properties in 14 ms. (steps per millisecond=532 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT p0)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p1 p2))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1) (NOT p2)))
Knowledge based reduction with 26 factoid took 6335 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-04 finished in 10037 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(p0)||X((p0&&G(p1)))))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 192 transition count 239
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 31 place count 166 transition count 213
Iterating global reduction 1 with 26 rules applied. Total rules applied 57 place count 166 transition count 213
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 148 transition count 195
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 148 transition count 195
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 96 place count 145 transition count 195
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 112 place count 129 transition count 179
Iterating global reduction 2 with 16 rules applied. Total rules applied 128 place count 129 transition count 179
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 133 place count 124 transition count 179
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 148 place count 109 transition count 164
Iterating global reduction 3 with 15 rules applied. Total rules applied 163 place count 109 transition count 164
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 171 place count 101 transition count 156
Iterating global reduction 3 with 8 rules applied. Total rules applied 179 place count 101 transition count 156
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 187 place count 93 transition count 148
Iterating global reduction 3 with 8 rules applied. Total rules applied 195 place count 93 transition count 148
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 204 place count 84 transition count 139
Iterating global reduction 3 with 9 rules applied. Total rules applied 213 place count 84 transition count 139
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 221 place count 76 transition count 131
Iterating global reduction 3 with 8 rules applied. Total rules applied 229 place count 76 transition count 131
Applied a total of 229 rules in 24 ms. Remains 76 /197 variables (removed 121) and now considering 131/239 (removed 108) transitions.
[2024-05-24 14:59:13] [INFO ] Flow matrix only has 87 transitions (discarded 44 similar events)
// Phase 1: matrix 87 rows 76 cols
[2024-05-24 14:59:13] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 14:59:13] [INFO ] Implicit Places using invariants in 131 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/197 places, 131/239 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 71 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 71 transition count 127
Applied a total of 8 rules in 2 ms. Remains 71 /75 variables (removed 4) and now considering 127/131 (removed 4) transitions.
[2024-05-24 14:59:13] [INFO ] Flow matrix only has 82 transitions (discarded 45 similar events)
// Phase 1: matrix 82 rows 71 cols
[2024-05-24 14:59:13] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 14:59:13] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-24 14:59:13] [INFO ] Flow matrix only has 82 transitions (discarded 45 similar events)
[2024-05-24 14:59:13] [INFO ] Invariant cache hit.
[2024-05-24 14:59:13] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 71/197 places, 127/239 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 472 ms. Remains : 71/197 places, 127/239 transitions.
Stuttering acceptance computed with spot in 359 ms :[true, (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(LEQ s33 s9), p1:(AND (LEQ s64 s45) (GT 2 s58))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 276 steps with 10 reset in 3 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-05 finished in 856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Graph (complete) has 479 edges and 197 vertex of which 190 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 190 transition count 206
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 158 transition count 206
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 65 place count 158 transition count 184
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 109 place count 136 transition count 184
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 131 place count 114 transition count 162
Iterating global reduction 2 with 22 rules applied. Total rules applied 153 place count 114 transition count 162
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 160 place count 107 transition count 155
Iterating global reduction 2 with 7 rules applied. Total rules applied 167 place count 107 transition count 155
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 171 place count 103 transition count 155
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 171 place count 103 transition count 151
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 179 place count 99 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 185 place count 93 transition count 145
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 93 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 195 place count 89 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 199 place count 89 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 204 place count 84 transition count 136
Iterating global reduction 3 with 5 rules applied. Total rules applied 209 place count 84 transition count 136
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 253 place count 62 transition count 114
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 259 place count 56 transition count 108
Iterating global reduction 3 with 6 rules applied. Total rules applied 265 place count 56 transition count 108
Applied a total of 265 rules in 40 ms. Remains 56 /197 variables (removed 141) and now considering 108/239 (removed 131) transitions.
[2024-05-24 14:59:14] [INFO ] Flow matrix only has 75 transitions (discarded 33 similar events)
// Phase 1: matrix 75 rows 56 cols
[2024-05-24 14:59:14] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 14:59:14] [INFO ] Implicit Places using invariants in 48 ms returned [19, 24, 29, 31, 36, 40]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 49 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/197 places, 108/239 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 46 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 46 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 43 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 43 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 42 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 42 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 37 transition count 95
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 35 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 35 transition count 93
Applied a total of 30 rules in 6 ms. Remains 35 /50 variables (removed 15) and now considering 93/108 (removed 15) transitions.
[2024-05-24 14:59:14] [INFO ] Flow matrix only has 39 transitions (discarded 54 similar events)
// Phase 1: matrix 39 rows 35 cols
[2024-05-24 14:59:14] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 14:59:14] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 14:59:14] [INFO ] Flow matrix only has 39 transitions (discarded 54 similar events)
[2024-05-24 14:59:14] [INFO ] Invariant cache hit.
[2024-05-24 14:59:14] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/197 places, 93/239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 35/197 places, 93/239 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s7), p1:(GT 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-10 finished in 326 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 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Graph (complete) has 479 edges and 197 vertex of which 190 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 190 transition count 210
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 162 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 160 transition count 208
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 61 place count 160 transition count 186
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 105 place count 138 transition count 186
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 125 place count 118 transition count 166
Iterating global reduction 3 with 20 rules applied. Total rules applied 145 place count 118 transition count 166
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 152 place count 111 transition count 159
Iterating global reduction 3 with 7 rules applied. Total rules applied 159 place count 111 transition count 159
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 163 place count 107 transition count 159
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 163 place count 107 transition count 155
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 171 place count 103 transition count 155
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 176 place count 98 transition count 150
Iterating global reduction 4 with 5 rules applied. Total rules applied 181 place count 98 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 185 place count 94 transition count 146
Iterating global reduction 4 with 4 rules applied. Total rules applied 189 place count 94 transition count 146
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 194 place count 89 transition count 141
Iterating global reduction 4 with 5 rules applied. Total rules applied 199 place count 89 transition count 141
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 243 place count 67 transition count 119
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 250 place count 60 transition count 112
Iterating global reduction 4 with 7 rules applied. Total rules applied 257 place count 60 transition count 112
Applied a total of 257 rules in 30 ms. Remains 60 /197 variables (removed 137) and now considering 112/239 (removed 127) transitions.
[2024-05-24 14:59:14] [INFO ] Flow matrix only has 80 transitions (discarded 32 similar events)
// Phase 1: matrix 80 rows 60 cols
[2024-05-24 14:59:14] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 14:59:14] [INFO ] Implicit Places using invariants in 44 ms returned [2, 4, 15, 27, 29, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 44 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/197 places, 112/239 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 108
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 47 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 47 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 104
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 41 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 39 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 39 transition count 97
Applied a total of 30 rules in 8 ms. Remains 39 /54 variables (removed 15) and now considering 97/112 (removed 15) transitions.
[2024-05-24 14:59:14] [INFO ] Flow matrix only has 45 transitions (discarded 52 similar events)
// Phase 1: matrix 45 rows 39 cols
[2024-05-24 14:59:14] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 14:59:14] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 14:59:14] [INFO ] Flow matrix only has 45 transitions (discarded 52 similar events)
[2024-05-24 14:59:14] [INFO ] Invariant cache hit.
[2024-05-24 14:59:14] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/197 places, 97/239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 39/197 places, 97/239 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-11 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:(LEQ s19 s23), p1:(LEQ s28 s14)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7942 reset in 178 ms.
Product exploration explored 100000 steps with 7960 reset in 288 ms.
Computed a total of 39 stabilizing places and 97 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 39 transition count 97
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 25 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-11 finished in 762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Graph (complete) has 479 edges and 197 vertex of which 191 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 191 transition count 208
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 161 transition count 208
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 61 place count 161 transition count 186
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 105 place count 139 transition count 186
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 126 place count 118 transition count 165
Iterating global reduction 2 with 21 rules applied. Total rules applied 147 place count 118 transition count 165
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 154 place count 111 transition count 158
Iterating global reduction 2 with 7 rules applied. Total rules applied 161 place count 111 transition count 158
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 163 place count 109 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 163 place count 109 transition count 156
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 107 transition count 156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 171 place count 103 transition count 152
Iterating global reduction 3 with 4 rules applied. Total rules applied 175 place count 103 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 101 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 101 transition count 150
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 98 transition count 147
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 98 transition count 147
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 233 place count 74 transition count 123
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 239 place count 68 transition count 117
Iterating global reduction 3 with 6 rules applied. Total rules applied 245 place count 68 transition count 117
Applied a total of 245 rules in 25 ms. Remains 68 /197 variables (removed 129) and now considering 117/239 (removed 122) transitions.
[2024-05-24 14:59:15] [INFO ] Flow matrix only has 92 transitions (discarded 25 similar events)
// Phase 1: matrix 92 rows 68 cols
[2024-05-24 14:59:15] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 14:59:15] [INFO ] Implicit Places using invariants in 49 ms returned [2, 4, 14, 19, 24, 36, 41, 45]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 49 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/197 places, 117/239 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 54 transition count 111
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 54 transition count 111
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 49 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 49 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 48 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 48 transition count 105
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 42 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 40 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 40 transition count 97
Applied a total of 40 rules in 4 ms. Remains 40 /60 variables (removed 20) and now considering 97/117 (removed 20) transitions.
[2024-05-24 14:59:15] [INFO ] Flow matrix only has 44 transitions (discarded 53 similar events)
// Phase 1: matrix 44 rows 40 cols
[2024-05-24 14:59:15] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 14:59:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 14:59:15] [INFO ] Flow matrix only has 44 transitions (discarded 53 similar events)
[2024-05-24 14:59:15] [INFO ] Invariant cache hit.
[2024-05-24 14:59:15] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/197 places, 97/239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 40/197 places, 97/239 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s20 s9), p1:(GT s30 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-12 finished in 299 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 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Graph (complete) has 479 edges and 197 vertex of which 190 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 190 transition count 205
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 157 transition count 205
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 67 place count 157 transition count 184
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 109 place count 136 transition count 184
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 130 place count 115 transition count 163
Iterating global reduction 2 with 21 rules applied. Total rules applied 151 place count 115 transition count 163
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 158 place count 108 transition count 156
Iterating global reduction 2 with 7 rules applied. Total rules applied 165 place count 108 transition count 156
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 168 place count 105 transition count 156
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 168 place count 105 transition count 153
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 174 place count 102 transition count 153
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 179 place count 97 transition count 148
Iterating global reduction 3 with 5 rules applied. Total rules applied 184 place count 97 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 94 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 94 transition count 145
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 195 place count 89 transition count 140
Iterating global reduction 3 with 5 rules applied. Total rules applied 200 place count 89 transition count 140
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 248 place count 65 transition count 116
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 255 place count 58 transition count 109
Iterating global reduction 3 with 7 rules applied. Total rules applied 262 place count 58 transition count 109
Applied a total of 262 rules in 23 ms. Remains 58 /197 variables (removed 139) and now considering 109/239 (removed 130) transitions.
[2024-05-24 14:59:15] [INFO ] Flow matrix only has 81 transitions (discarded 28 similar events)
// Phase 1: matrix 81 rows 58 cols
[2024-05-24 14:59:15] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 14:59:15] [INFO ] Implicit Places using invariants in 53 ms returned [2, 4, 24, 29, 31, 36, 40]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 54 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/197 places, 109/239 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 46 transition count 104
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 46 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 41 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 41 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 40 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 40 transition count 98
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 0 with 4 rules applied. Total rules applied 26 place count 38 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 36 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 36 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 34 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 34 transition count 92
Applied a total of 34 rules in 6 ms. Remains 34 /51 variables (removed 17) and now considering 92/109 (removed 17) transitions.
[2024-05-24 14:59:15] [INFO ] Flow matrix only has 36 transitions (discarded 56 similar events)
// Phase 1: matrix 36 rows 34 cols
[2024-05-24 14:59:15] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 14:59:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 14:59:15] [INFO ] Flow matrix only has 36 transitions (discarded 56 similar events)
[2024-05-24 14:59:15] [INFO ] Invariant cache hit.
[2024-05-24 14:59:15] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/197 places, 92/239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 166 ms. Remains : 34/197 places, 92/239 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-13 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 (LEQ s14 s27) (LEQ 1 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9119 reset in 129 ms.
Product exploration explored 100000 steps with 9158 reset in 174 ms.
Computed a total of 34 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 482 ms :[(NOT p0), (NOT p0)]
Finished random walk after 32 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 92/92 transitions.
Applied a total of 0 rules in 8 ms. Remains 34 /34 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-24 14:59:16] [INFO ] Flow matrix only has 36 transitions (discarded 56 similar events)
[2024-05-24 14:59:16] [INFO ] Invariant cache hit.
[2024-05-24 14:59:17] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 14:59:17] [INFO ] Flow matrix only has 36 transitions (discarded 56 similar events)
[2024-05-24 14:59:17] [INFO ] Invariant cache hit.
[2024-05-24 14:59:17] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-24 14:59:17] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 14:59:17] [INFO ] Flow matrix only has 36 transitions (discarded 56 similar events)
[2024-05-24 14:59:17] [INFO ] Invariant cache hit.
[2024-05-24 14:59:17] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 34/34 places, 92/92 transitions.
Computed a total of 34 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9121 reset in 137 ms.
Product exploration explored 100000 steps with 9130 reset in 135 ms.
Built C files in :
/tmp/ltsmin4350998808024375578
[2024-05-24 14:59:18] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2024-05-24 14:59:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 14:59:18] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2024-05-24 14:59:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 14:59:18] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2024-05-24 14:59:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 14:59:18] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4350998808024375578
Running compilation step : cd /tmp/ltsmin4350998808024375578;'/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 274 ms.
Running link step : cd /tmp/ltsmin4350998808024375578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4350998808024375578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9771543476938826357.hoa' '--buchi-type=spotba'
LTSmin run took 183 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-13 finished in 3277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 191 transition count 239
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 33 place count 164 transition count 212
Iterating global reduction 1 with 27 rules applied. Total rules applied 60 place count 164 transition count 212
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 83 place count 141 transition count 189
Iterating global reduction 1 with 23 rules applied. Total rules applied 106 place count 141 transition count 189
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 110 place count 137 transition count 189
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 131 place count 116 transition count 168
Iterating global reduction 2 with 21 rules applied. Total rules applied 152 place count 116 transition count 168
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 159 place count 109 transition count 168
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 181 place count 87 transition count 146
Iterating global reduction 3 with 22 rules applied. Total rules applied 203 place count 87 transition count 146
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 214 place count 76 transition count 135
Iterating global reduction 3 with 11 rules applied. Total rules applied 225 place count 76 transition count 135
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 236 place count 65 transition count 124
Iterating global reduction 3 with 11 rules applied. Total rules applied 247 place count 65 transition count 124
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 260 place count 52 transition count 111
Iterating global reduction 3 with 13 rules applied. Total rules applied 273 place count 52 transition count 111
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 283 place count 42 transition count 101
Iterating global reduction 3 with 10 rules applied. Total rules applied 293 place count 42 transition count 101
Applied a total of 293 rules in 12 ms. Remains 42 /197 variables (removed 155) and now considering 101/239 (removed 138) transitions.
[2024-05-24 14:59:18] [INFO ] Flow matrix only has 45 transitions (discarded 56 similar events)
// Phase 1: matrix 45 rows 42 cols
[2024-05-24 14:59:18] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 14:59:18] [INFO ] Implicit Places using invariants in 40 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/197 places, 101/239 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 39 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 39 transition count 99
Applied a total of 4 rules in 1 ms. Remains 39 /41 variables (removed 2) and now considering 99/101 (removed 2) transitions.
[2024-05-24 14:59:18] [INFO ] Flow matrix only has 42 transitions (discarded 57 similar events)
// Phase 1: matrix 42 rows 39 cols
[2024-05-24 14:59:18] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 14:59:18] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 14:59:18] [INFO ] Flow matrix only has 42 transitions (discarded 57 similar events)
[2024-05-24 14:59:18] [INFO ] Invariant cache hit.
[2024-05-24 14:59:18] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/197 places, 99/239 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 39/197 places, 99/239 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s14 s30), p1:(GT 1 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 49 steps with 1 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-14 finished in 267 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 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 191 transition count 239
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 35 place count 162 transition count 210
Iterating global reduction 1 with 29 rules applied. Total rules applied 64 place count 162 transition count 210
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 86 place count 140 transition count 188
Iterating global reduction 1 with 22 rules applied. Total rules applied 108 place count 140 transition count 188
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 112 place count 136 transition count 188
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 133 place count 115 transition count 167
Iterating global reduction 2 with 21 rules applied. Total rules applied 154 place count 115 transition count 167
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 161 place count 108 transition count 167
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 183 place count 86 transition count 145
Iterating global reduction 3 with 22 rules applied. Total rules applied 205 place count 86 transition count 145
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 216 place count 75 transition count 134
Iterating global reduction 3 with 11 rules applied. Total rules applied 227 place count 75 transition count 134
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 238 place count 64 transition count 123
Iterating global reduction 3 with 11 rules applied. Total rules applied 249 place count 64 transition count 123
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 262 place count 51 transition count 110
Iterating global reduction 3 with 13 rules applied. Total rules applied 275 place count 51 transition count 110
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 285 place count 41 transition count 100
Iterating global reduction 3 with 10 rules applied. Total rules applied 295 place count 41 transition count 100
Applied a total of 295 rules in 13 ms. Remains 41 /197 variables (removed 156) and now considering 100/239 (removed 139) transitions.
[2024-05-24 14:59:18] [INFO ] Flow matrix only has 42 transitions (discarded 58 similar events)
// Phase 1: matrix 42 rows 41 cols
[2024-05-24 14:59:18] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 14:59:18] [INFO ] Implicit Places using invariants in 36 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/197 places, 100/239 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 38 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 38 transition count 98
Applied a total of 4 rules in 1 ms. Remains 38 /40 variables (removed 2) and now considering 98/100 (removed 2) transitions.
[2024-05-24 14:59:18] [INFO ] Flow matrix only has 39 transitions (discarded 59 similar events)
// Phase 1: matrix 39 rows 38 cols
[2024-05-24 14:59:18] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 14:59:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 14:59:19] [INFO ] Flow matrix only has 39 transitions (discarded 59 similar events)
[2024-05-24 14:59:19] [INFO ] Invariant cache hit.
[2024-05-24 14:59:19] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 38/197 places, 98/239 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 38/197 places, 98/239 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s19)], 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 93 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Computed a total of 38 stabilizing places and 98 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 38 transition count 98
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLCardinality-15 finished in 462 ms.
All properties solved by simple procedures.
Total runtime 20010 ms.

BK_STOP 1716562762603

--------------------
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="LeafsetExtension-PT-S08C3"
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 LeafsetExtension-PT-S08C3, 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 r241-tall-171649628400202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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