Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 8.1K Feb 25 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679460127666

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 04:42:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 04:42:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:42:09] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-03-22 04:42:09] [INFO ] Transformed 5622 places.
[2023-03-22 04:42:09] [INFO ] Transformed 5449 transitions.
[2023-03-22 04:42:09] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 5622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Reduce places removed 1093 places and 0 transitions.
Iterating post reduction 0 with 1093 rules applied. Total rules applied 1093 place count 4529 transition count 5449
Discarding 1050 places :
Symmetric choice reduction at 1 with 1050 rule applications. Total rules 2143 place count 3479 transition count 4399
Iterating global reduction 1 with 1050 rules applied. Total rules applied 3193 place count 3479 transition count 4399
Discarding 977 places :
Symmetric choice reduction at 1 with 977 rule applications. Total rules 4170 place count 2502 transition count 3422
Iterating global reduction 1 with 977 rules applied. Total rules applied 5147 place count 2502 transition count 3422
Discarding 972 places :
Symmetric choice reduction at 1 with 972 rule applications. Total rules 6119 place count 1530 transition count 2450
Iterating global reduction 1 with 972 rules applied. Total rules applied 7091 place count 1530 transition count 2450
Discarding 52 places :
Implicit places reduction removed 52 places
Iterating post reduction 1 with 52 rules applied. Total rules applied 7143 place count 1478 transition count 2450
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 7193 place count 1428 transition count 2400
Iterating global reduction 2 with 50 rules applied. Total rules applied 7243 place count 1428 transition count 2400
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 7292 place count 1379 transition count 2351
Iterating global reduction 2 with 49 rules applied. Total rules applied 7341 place count 1379 transition count 2351
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 7390 place count 1330 transition count 2302
Iterating global reduction 2 with 49 rules applied. Total rules applied 7439 place count 1330 transition count 2302
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 7488 place count 1281 transition count 2253
Iterating global reduction 2 with 49 rules applied. Total rules applied 7537 place count 1281 transition count 2253
Discarding 750 places :
Symmetric choice reduction at 2 with 750 rule applications. Total rules 8287 place count 531 transition count 1503
Iterating global reduction 2 with 750 rules applied. Total rules applied 9037 place count 531 transition count 1503
Applied a total of 9037 rules in 1917 ms. Remains 531 /5622 variables (removed 5091) and now considering 1503/5449 (removed 3946) transitions.
[2023-03-22 04:42:11] [INFO ] Flow matrix only has 754 transitions (discarded 749 similar events)
// Phase 1: matrix 754 rows 531 cols
[2023-03-22 04:42:11] [INFO ] Computed 50 place invariants in 35 ms
[2023-03-22 04:42:12] [INFO ] Implicit Places using invariants in 538 ms returned [69, 74, 100, 104, 108, 112, 116, 120, 124, 128, 132, 152, 179, 187, 207, 212, 214, 241, 272, 277, 303, 328, 334, 338, 342, 401, 422, 444, 469, 474, 478, 486, 508]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 564 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 498/5622 places, 1503/5449 transitions.
Discarding 232 places :
Symmetric choice reduction at 0 with 232 rule applications. Total rules 232 place count 266 transition count 1271
Iterating global reduction 0 with 232 rules applied. Total rules applied 464 place count 266 transition count 1271
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 468 place count 262 transition count 1267
Iterating global reduction 0 with 4 rules applied. Total rules applied 472 place count 262 transition count 1267
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 476 place count 258 transition count 1263
Iterating global reduction 0 with 4 rules applied. Total rules applied 480 place count 258 transition count 1263
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 484 place count 254 transition count 1259
Iterating global reduction 0 with 4 rules applied. Total rules applied 488 place count 254 transition count 1259
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 499 place count 243 transition count 1248
Iterating global reduction 0 with 11 rules applied. Total rules applied 510 place count 243 transition count 1248
Applied a total of 510 rules in 36 ms. Remains 243 /498 variables (removed 255) and now considering 1248/1503 (removed 255) transitions.
[2023-03-22 04:42:12] [INFO ] Flow matrix only has 413 transitions (discarded 835 similar events)
// Phase 1: matrix 413 rows 243 cols
[2023-03-22 04:42:12] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-22 04:42:12] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-22 04:42:12] [INFO ] Flow matrix only has 413 transitions (discarded 835 similar events)
[2023-03-22 04:42:12] [INFO ] Invariant cache hit.
[2023-03-22 04:42:12] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 243/5622 places, 1248/5449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2956 ms. Remains : 243/5622 places, 1248/5449 transitions.
Support contains 53 out of 243 places after structural reductions.
[2023-03-22 04:42:12] [INFO ] Flatten gal took : 98 ms
[2023-03-22 04:42:12] [INFO ] Flatten gal took : 57 ms
[2023-03-22 04:42:13] [INFO ] Input system was already deterministic with 1248 transitions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 33) seen :32
Finished Best-First random walk after 552 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=184 )
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 243 stabilizing places and 1248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 1248
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(F((F(p2)&&p1)))) U G(p3)))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Graph (complete) has 1913 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 242 transition count 1225
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 220 transition count 1225
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 45 place count 220 transition count 1212
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 71 place count 207 transition count 1212
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 86 place count 192 transition count 1197
Iterating global reduction 2 with 15 rules applied. Total rules applied 101 place count 192 transition count 1197
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 108 place count 185 transition count 1190
Iterating global reduction 2 with 7 rules applied. Total rules applied 115 place count 185 transition count 1190
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 181 transition count 1190
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 119 place count 181 transition count 1186
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 127 place count 177 transition count 1186
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 172 transition count 1181
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 172 transition count 1181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 141 place count 168 transition count 1177
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 168 transition count 1177
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 160 place count 153 transition count 1162
Iterating global reduction 3 with 15 rules applied. Total rules applied 175 place count 153 transition count 1162
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 221 place count 130 transition count 1139
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 227 place count 124 transition count 1133
Iterating global reduction 3 with 6 rules applied. Total rules applied 233 place count 124 transition count 1133
Applied a total of 233 rules in 127 ms. Remains 124 /243 variables (removed 119) and now considering 1133/1248 (removed 115) transitions.
[2023-03-22 04:42:13] [INFO ] Flow matrix only has 212 transitions (discarded 921 similar events)
// Phase 1: matrix 212 rows 124 cols
[2023-03-22 04:42:14] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-22 04:42:14] [INFO ] Implicit Places using invariants in 115 ms returned [9, 12, 42, 57, 66, 84, 88, 91, 110]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 117 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/243 places, 1133/1248 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 101 transition count 1119
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 101 transition count 1119
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 98 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 98 transition count 1116
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 94 transition count 1112
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 94 transition count 1112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 87 transition count 1105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 85 transition count 1103
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 85 transition count 1103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 84 transition count 1102
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 84 transition count 1102
Applied a total of 62 rules in 47 ms. Remains 84 /115 variables (removed 31) and now considering 1102/1133 (removed 31) transitions.
[2023-03-22 04:42:14] [INFO ] Flow matrix only has 99 transitions (discarded 1003 similar events)
// Phase 1: matrix 99 rows 84 cols
[2023-03-22 04:42:14] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 04:42:14] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-22 04:42:14] [INFO ] Flow matrix only has 99 transitions (discarded 1003 similar events)
[2023-03-22 04:42:14] [INFO ] Invariant cache hit.
[2023-03-22 04:42:14] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/243 places, 1102/1248 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 514 ms. Remains : 84/243 places, 1102/1248 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p3), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (NOT (OR (AND (GEQ s13 1) (GEQ s20 1)) (GEQ s40 1))) (NOT (AND (GEQ s13 1) (GEQ s20 1)))), p0:(AND (GEQ s29 1) (GEQ s63 1)), p1:(AND (GEQ s29 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 445 steps with 142 reset in 20 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-00 finished in 948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&X((p1||F(p2)))))||G(F(!p0)))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Graph (complete) has 1913 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 242 transition count 1226
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 221 transition count 1225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 220 transition count 1225
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 45 place count 220 transition count 1212
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 71 place count 207 transition count 1212
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 85 place count 193 transition count 1198
Iterating global reduction 3 with 14 rules applied. Total rules applied 99 place count 193 transition count 1198
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 187 transition count 1192
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 187 transition count 1192
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 116 place count 182 transition count 1192
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 116 place count 182 transition count 1187
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 126 place count 177 transition count 1187
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 132 place count 171 transition count 1181
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 171 transition count 1181
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 143 place count 166 transition count 1176
Iterating global reduction 4 with 5 rules applied. Total rules applied 148 place count 166 transition count 1176
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 168 place count 146 transition count 1156
Iterating global reduction 4 with 20 rules applied. Total rules applied 188 place count 146 transition count 1156
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 230 place count 125 transition count 1135
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 237 place count 118 transition count 1128
Iterating global reduction 4 with 7 rules applied. Total rules applied 244 place count 118 transition count 1128
Applied a total of 244 rules in 99 ms. Remains 118 /243 variables (removed 125) and now considering 1128/1248 (removed 120) transitions.
[2023-03-22 04:42:14] [INFO ] Flow matrix only has 190 transitions (discarded 938 similar events)
// Phase 1: matrix 190 rows 118 cols
[2023-03-22 04:42:14] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-22 04:42:14] [INFO ] Implicit Places using invariants in 112 ms returned [9, 12, 41, 49, 83, 86, 91, 105]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 114 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/243 places, 1128/1248 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 95 transition count 1113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 95 transition count 1113
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 93 transition count 1111
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 93 transition count 1111
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 91 transition count 1109
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 91 transition count 1109
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 85 transition count 1103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 84 transition count 1102
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 84 transition count 1102
Applied a total of 52 rules in 35 ms. Remains 84 /110 variables (removed 26) and now considering 1102/1128 (removed 26) transitions.
[2023-03-22 04:42:15] [INFO ] Flow matrix only has 112 transitions (discarded 990 similar events)
// Phase 1: matrix 112 rows 84 cols
[2023-03-22 04:42:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:42:15] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-22 04:42:15] [INFO ] Flow matrix only has 112 transitions (discarded 990 similar events)
[2023-03-22 04:42:15] [INFO ] Invariant cache hit.
[2023-03-22 04:42:15] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/243 places, 1102/1248 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 498 ms. Remains : 84/243 places, 1102/1248 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s47 1)), p1:(LT s40 1), p2:(OR (LT s58 1) (LT s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7699 reset in 386 ms.
Product exploration explored 100000 steps with 7706 reset in 343 ms.
Computed a total of 84 stabilizing places and 1102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 1102
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 (NOT p0) p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 8 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-03 finished in 1676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(!p0))) U (p1 U X(!p0)))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Graph (complete) has 1913 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 242 transition count 1224
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 219 transition count 1224
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 47 place count 219 transition count 1211
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 73 place count 206 transition count 1211
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 88 place count 191 transition count 1196
Iterating global reduction 2 with 15 rules applied. Total rules applied 103 place count 191 transition count 1196
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 109 place count 185 transition count 1190
Iterating global reduction 2 with 6 rules applied. Total rules applied 115 place count 185 transition count 1190
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 181 transition count 1190
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 119 place count 181 transition count 1186
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 127 place count 177 transition count 1186
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 172 transition count 1181
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 172 transition count 1181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 141 place count 168 transition count 1177
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 168 transition count 1177
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 161 place count 152 transition count 1161
Iterating global reduction 3 with 16 rules applied. Total rules applied 177 place count 152 transition count 1161
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 223 place count 129 transition count 1138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 122 transition count 1131
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 122 transition count 1131
Applied a total of 237 rules in 69 ms. Remains 122 /243 variables (removed 121) and now considering 1131/1248 (removed 117) transitions.
[2023-03-22 04:42:16] [INFO ] Flow matrix only has 209 transitions (discarded 922 similar events)
// Phase 1: matrix 209 rows 122 cols
[2023-03-22 04:42:16] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-22 04:42:16] [INFO ] Implicit Places using invariants in 114 ms returned [9, 12, 41, 49, 54, 82, 86, 89, 94]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 119 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/243 places, 1131/1248 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 99 transition count 1117
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 99 transition count 1117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 96 transition count 1114
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 96 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 93 transition count 1111
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 93 transition count 1111
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 54 place count 86 transition count 1104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 84 transition count 1102
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 84 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 83 transition count 1101
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 83 transition count 1101
Applied a total of 60 rules in 34 ms. Remains 83 /113 variables (removed 30) and now considering 1101/1131 (removed 30) transitions.
[2023-03-22 04:42:16] [INFO ] Flow matrix only has 96 transitions (discarded 1005 similar events)
// Phase 1: matrix 96 rows 83 cols
[2023-03-22 04:42:16] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:42:16] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-22 04:42:16] [INFO ] Flow matrix only has 96 transitions (discarded 1005 similar events)
[2023-03-22 04:42:16] [INFO ] Invariant cache hit.
[2023-03-22 04:42:16] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/243 places, 1101/1248 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 459 ms. Remains : 83/243 places, 1101/1248 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s46 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33293 reset in 339 ms.
Product exploration explored 100000 steps with 33202 reset in 307 ms.
Computed a total of 83 stabilizing places and 1101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 83 transition count 1101
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 : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-04 finished in 1437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(X(G((!p1&&F(!p2)))))))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 224 transition count 1229
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 224 transition count 1229
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 207 transition count 1212
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 207 transition count 1212
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 202 transition count 1212
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 93 place count 186 transition count 1196
Iterating global reduction 1 with 16 rules applied. Total rules applied 109 place count 186 transition count 1196
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 113 place count 182 transition count 1196
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 129 place count 166 transition count 1180
Iterating global reduction 2 with 16 rules applied. Total rules applied 145 place count 166 transition count 1180
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 154 place count 157 transition count 1171
Iterating global reduction 2 with 9 rules applied. Total rules applied 163 place count 157 transition count 1171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 172 place count 148 transition count 1162
Iterating global reduction 2 with 9 rules applied. Total rules applied 181 place count 148 transition count 1162
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 204 place count 125 transition count 1139
Iterating global reduction 2 with 23 rules applied. Total rules applied 227 place count 125 transition count 1139
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 240 place count 112 transition count 1126
Iterating global reduction 2 with 13 rules applied. Total rules applied 253 place count 112 transition count 1126
Applied a total of 253 rules in 35 ms. Remains 112 /243 variables (removed 131) and now considering 1126/1248 (removed 122) transitions.
[2023-03-22 04:42:17] [INFO ] Flow matrix only has 127 transitions (discarded 999 similar events)
// Phase 1: matrix 127 rows 112 cols
[2023-03-22 04:42:17] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-22 04:42:18] [INFO ] Implicit Places using invariants in 111 ms returned [17, 45, 69, 73, 100]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 112 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/243 places, 1126/1248 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 95 transition count 1114
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 95 transition count 1114
Applied a total of 24 rules in 5 ms. Remains 95 /107 variables (removed 12) and now considering 1114/1126 (removed 12) transitions.
[2023-03-22 04:42:18] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
// Phase 1: matrix 111 rows 95 cols
[2023-03-22 04:42:18] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:42:18] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-22 04:42:18] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
[2023-03-22 04:42:18] [INFO ] Invariant cache hit.
[2023-03-22 04:42:18] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/243 places, 1114/1248 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 95/243 places, 1114/1248 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2 p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-05 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=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s65 1), p1:(AND (GEQ s72 1) (GEQ s77 1)), p2:(AND (GEQ s38 1) (GEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4228 reset in 230 ms.
Product exploration explored 100000 steps with 4218 reset in 242 ms.
Computed a total of 95 stabilizing places and 1114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 95 transition count 1114
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 (NOT p1) (NOT p2)), (X p0), (X (X p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 9 factoid took 271 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-05 finished in 1573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((X(p1) U G((p2 U p3)))))))'
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 224 transition count 1229
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 224 transition count 1229
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 56 place count 206 transition count 1211
Iterating global reduction 0 with 18 rules applied. Total rules applied 74 place count 206 transition count 1211
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 79 place count 201 transition count 1211
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 95 place count 185 transition count 1195
Iterating global reduction 1 with 16 rules applied. Total rules applied 111 place count 185 transition count 1195
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 115 place count 181 transition count 1195
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 131 place count 165 transition count 1179
Iterating global reduction 2 with 16 rules applied. Total rules applied 147 place count 165 transition count 1179
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 156 place count 156 transition count 1170
Iterating global reduction 2 with 9 rules applied. Total rules applied 165 place count 156 transition count 1170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 174 place count 147 transition count 1161
Iterating global reduction 2 with 9 rules applied. Total rules applied 183 place count 147 transition count 1161
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 206 place count 124 transition count 1138
Iterating global reduction 2 with 23 rules applied. Total rules applied 229 place count 124 transition count 1138
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 242 place count 111 transition count 1125
Iterating global reduction 2 with 13 rules applied. Total rules applied 255 place count 111 transition count 1125
Applied a total of 255 rules in 37 ms. Remains 111 /243 variables (removed 132) and now considering 1125/1248 (removed 123) transitions.
[2023-03-22 04:42:19] [INFO ] Flow matrix only has 126 transitions (discarded 999 similar events)
// Phase 1: matrix 126 rows 111 cols
[2023-03-22 04:42:19] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-22 04:42:19] [INFO ] Implicit Places using invariants in 111 ms returned [17, 81, 85, 99]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 112 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/243 places, 1125/1248 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 97 transition count 1115
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 97 transition count 1115
Applied a total of 20 rules in 8 ms. Remains 97 /107 variables (removed 10) and now considering 1115/1125 (removed 10) transitions.
[2023-03-22 04:42:19] [INFO ] Flow matrix only has 113 transitions (discarded 1002 similar events)
// Phase 1: matrix 113 rows 97 cols
[2023-03-22 04:42:19] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-22 04:42:19] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-22 04:42:19] [INFO ] Flow matrix only has 113 transitions (discarded 1002 similar events)
[2023-03-22 04:42:19] [INFO ] Invariant cache hit.
[2023-03-22 04:42:19] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 97/243 places, 1115/1248 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 401 ms. Remains : 97/243 places, 1115/1248 transitions.
Stuttering acceptance computed with spot in 427 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3), (NOT p3), (AND p1 (NOT p3))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(OR p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 4}, { cond=(OR p3 p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=10 dest: 9}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p3:(AND (GEQ s30 1) (GEQ s55 1)), p2:(AND (GEQ s48 1) (GEQ s57 1)), p0:(AND (GEQ s58 1) (GEQ s87 1)), p1:(AND (GEQ s42 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-06 finished in 856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Graph (complete) has 1913 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 242 transition count 1224
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 219 transition count 1223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 218 transition count 1223
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 49 place count 218 transition count 1210
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 75 place count 205 transition count 1210
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 91 place count 189 transition count 1194
Iterating global reduction 3 with 16 rules applied. Total rules applied 107 place count 189 transition count 1194
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 182 transition count 1187
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 182 transition count 1187
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 126 place count 177 transition count 1187
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 126 place count 177 transition count 1182
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 136 place count 172 transition count 1182
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 142 place count 166 transition count 1176
Iterating global reduction 4 with 6 rules applied. Total rules applied 148 place count 166 transition count 1176
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 153 place count 161 transition count 1171
Iterating global reduction 4 with 5 rules applied. Total rules applied 158 place count 161 transition count 1171
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 178 place count 141 transition count 1151
Iterating global reduction 4 with 20 rules applied. Total rules applied 198 place count 141 transition count 1151
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 240 place count 120 transition count 1130
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 247 place count 113 transition count 1123
Iterating global reduction 4 with 7 rules applied. Total rules applied 254 place count 113 transition count 1123
Applied a total of 254 rules in 58 ms. Remains 113 /243 variables (removed 130) and now considering 1123/1248 (removed 125) transitions.
[2023-03-22 04:42:20] [INFO ] Flow matrix only has 185 transitions (discarded 938 similar events)
// Phase 1: matrix 185 rows 113 cols
[2023-03-22 04:42:20] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-22 04:42:20] [INFO ] Implicit Places using invariants in 111 ms returned [12, 41, 49, 54, 74, 78, 81, 86, 100]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 114 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/243 places, 1123/1248 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 93 transition count 1112
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 93 transition count 1112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 90 transition count 1109
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 90 transition count 1109
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 85 transition count 1104
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 85 transition count 1104
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 50 place count 79 transition count 1098
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 77 transition count 1096
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 77 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 76 transition count 1095
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 76 transition count 1095
Applied a total of 56 rules in 33 ms. Remains 76 /104 variables (removed 28) and now considering 1095/1123 (removed 28) transitions.
[2023-03-22 04:42:20] [INFO ] Flow matrix only has 74 transitions (discarded 1021 similar events)
// Phase 1: matrix 74 rows 76 cols
[2023-03-22 04:42:20] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:42:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-22 04:42:20] [INFO ] Flow matrix only has 74 transitions (discarded 1021 similar events)
[2023-03-22 04:42:20] [INFO ] Invariant cache hit.
[2023-03-22 04:42:20] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/243 places, 1095/1248 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 420 ms. Remains : 76/243 places, 1095/1248 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9026 reset in 287 ms.
Product exploration explored 100000 steps with 9047 reset in 288 ms.
Computed a total of 76 stabilizing places and 1095 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 1095
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), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-07 finished in 1342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0&&F(G(p1)))||(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 226 transition count 1231
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 226 transition count 1231
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 49 place count 211 transition count 1216
Iterating global reduction 0 with 15 rules applied. Total rules applied 64 place count 211 transition count 1216
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 68 place count 207 transition count 1216
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 81 place count 194 transition count 1203
Iterating global reduction 1 with 13 rules applied. Total rules applied 94 place count 194 transition count 1203
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 192 transition count 1203
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 180 transition count 1191
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 180 transition count 1191
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 126 place count 174 transition count 1185
Iterating global reduction 2 with 6 rules applied. Total rules applied 132 place count 174 transition count 1185
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 168 transition count 1179
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 168 transition count 1179
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 161 place count 151 transition count 1162
Iterating global reduction 2 with 17 rules applied. Total rules applied 178 place count 151 transition count 1162
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 185 place count 144 transition count 1155
Iterating global reduction 2 with 7 rules applied. Total rules applied 192 place count 144 transition count 1155
Applied a total of 192 rules in 36 ms. Remains 144 /243 variables (removed 99) and now considering 1155/1248 (removed 93) transitions.
[2023-03-22 04:42:21] [INFO ] Flow matrix only has 203 transitions (discarded 952 similar events)
// Phase 1: matrix 203 rows 144 cols
[2023-03-22 04:42:21] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-22 04:42:21] [INFO ] Implicit Places using invariants in 121 ms returned [17, 56, 111, 115, 129]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 123 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/243 places, 1155/1248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 121 transition count 1137
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 121 transition count 1137
Applied a total of 36 rules in 6 ms. Remains 121 /139 variables (removed 18) and now considering 1137/1155 (removed 18) transitions.
[2023-03-22 04:42:21] [INFO ] Flow matrix only has 181 transitions (discarded 956 similar events)
// Phase 1: matrix 181 rows 121 cols
[2023-03-22 04:42:21] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 04:42:21] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-22 04:42:21] [INFO ] Flow matrix only has 181 transitions (discarded 956 similar events)
[2023-03-22 04:42:21] [INFO ] Invariant cache hit.
[2023-03-22 04:42:22] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/243 places, 1137/1248 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 121/243 places, 1137/1248 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND p2 (NOT p1)), p2, (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 p0), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p3 p2), acceptance={0, 1} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p3 p1 p2), acceptance={1} source=4 dest: 4}, { cond=(AND p3 (NOT p1) p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=p1, acceptance={1} source=6 dest: 6}, { cond=(NOT p1), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s23 1) (LT s25 1)), p3:(AND (GEQ s57 1) (GEQ s59 1)), p2:(AND (GEQ s73 1) (GEQ s75 1)), p1:(LT s90 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33410 reset in 350 ms.
Product exploration explored 100000 steps with 33234 reset in 360 ms.
Computed a total of 121 stabilizing places and 1137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 121 transition count 1137
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 (NOT p3) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 p1 p2))), (X (NOT (AND p3 (NOT p1) p2))), (X (NOT (AND p3 (NOT p1) (NOT p2)))), (X (NOT (AND p3 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p3 p1 p2)))), (X (X (NOT (AND p3 (NOT p1) p2)))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p3 p2)))), (F (G p0)), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1165 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) p2), p2, p2, true]
Incomplete random walk after 10000 steps, including 354 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 04:42:24] [INFO ] Flow matrix only has 181 transitions (discarded 956 similar events)
[2023-03-22 04:42:24] [INFO ] Invariant cache hit.
[2023-03-22 04:42:24] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-22 04:42:24] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-22 04:42:24] [INFO ] After 102ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 04:42:24] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1137/1137 transitions.
Graph (complete) has 329 edges and 121 vertex of which 96 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.3 ms
Discarding 25 places :
Also discarding 19 output transitions
Drop transitions removed 19 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 96 transition count 1110
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 91 transition count 1110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 91 transition count 1104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 85 transition count 1104
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 2 with 6 rules applied. Total rules applied 32 place count 82 transition count 1101
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 2 with 33 rules applied. Total rules applied 65 place count 82 transition count 1068
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 98 place count 49 transition count 1068
Applied a total of 98 rules in 68 ms. Remains 49 /121 variables (removed 72) and now considering 1068/1137 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 49/121 places, 1068/1137 transitions.
Incomplete random walk after 10000 steps, including 1226 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:42:25] [INFO ] Flow matrix only has 93 transitions (discarded 975 similar events)
// Phase 1: matrix 93 rows 49 cols
[2023-03-22 04:42:25] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 04:42:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-22 04:42:25] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 04:42:25] [INFO ] After 31ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 04:42:25] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 1068/1068 transitions.
Graph (complete) has 120 edges and 49 vertex of which 44 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 18 ms. Remains 44 /49 variables (removed 5) and now considering 1064/1068 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 44/49 places, 1064/1068 transitions.
Incomplete random walk after 10000 steps, including 1329 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5544 steps, run visited all 1 properties in 63 ms. (steps per millisecond=88 )
Probabilistic random walk after 5544 steps, saw 1819 distinct states, run finished after 64 ms. (steps per millisecond=86 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 p1 p2))), (X (NOT (AND p3 (NOT p1) p2))), (X (NOT (AND p3 (NOT p1) (NOT p2)))), (X (NOT (AND p3 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p3 p1 p2)))), (X (X (NOT (AND p3 (NOT p1) p2)))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p3 p2)))), (F (G p0)), (F (G (NOT p3))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(F (AND p3 p2)), (F (AND p3 (NOT p2))), (F (NOT p0)), (F p2), (F (AND (NOT p0) p3))]
Knowledge based reduction with 21 factoid took 850 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p2), p2, p2, true]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p2), p2, p2, true]
Support contains 6 out of 121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1137/1137 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 1137/1137 (removed 0) transitions.
[2023-03-22 04:42:26] [INFO ] Flow matrix only has 181 transitions (discarded 956 similar events)
// Phase 1: matrix 181 rows 121 cols
[2023-03-22 04:42:26] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 04:42:26] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-22 04:42:26] [INFO ] Flow matrix only has 181 transitions (discarded 956 similar events)
[2023-03-22 04:42:26] [INFO ] Invariant cache hit.
[2023-03-22 04:42:26] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-22 04:42:26] [INFO ] Flow matrix only has 181 transitions (discarded 956 similar events)
[2023-03-22 04:42:26] [INFO ] Invariant cache hit.
[2023-03-22 04:42:27] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 121/121 places, 1137/1137 transitions.
Computed a total of 121 stabilizing places and 1137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 121 transition count 1137
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 (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 p2)))), (F (G p0)), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 445 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) p2), p2, p2, true]
Incomplete random walk after 10000 steps, including 350 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 04:42:27] [INFO ] Flow matrix only has 181 transitions (discarded 956 similar events)
[2023-03-22 04:42:27] [INFO ] Invariant cache hit.
[2023-03-22 04:42:27] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-22 04:42:28] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-22 04:42:28] [INFO ] After 82ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-22 04:42:28] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1137/1137 transitions.
Graph (complete) has 329 edges and 121 vertex of which 96 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 19 output transitions
Drop transitions removed 19 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 96 transition count 1110
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 91 transition count 1110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 91 transition count 1104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 85 transition count 1104
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 2 with 6 rules applied. Total rules applied 32 place count 82 transition count 1101
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 2 with 33 rules applied. Total rules applied 65 place count 82 transition count 1068
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 98 place count 49 transition count 1068
Applied a total of 98 rules in 35 ms. Remains 49 /121 variables (removed 72) and now considering 1068/1137 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 49/121 places, 1068/1137 transitions.
Incomplete random walk after 10000 steps, including 1219 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:42:28] [INFO ] Flow matrix only has 93 transitions (discarded 975 similar events)
// Phase 1: matrix 93 rows 49 cols
[2023-03-22 04:42:28] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 04:42:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 04:42:28] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 04:42:28] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 04:42:28] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 1068/1068 transitions.
Graph (complete) has 120 edges and 49 vertex of which 44 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 14 ms. Remains 44 /49 variables (removed 5) and now considering 1064/1068 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 44/49 places, 1064/1068 transitions.
Finished random walk after 204 steps, including 30 resets, run visited all 1 properties in 2 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 p2)))), (F (G p0)), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p2 p3)), (F (AND (NOT p2) p3)), (F (NOT p0)), (F p2), (F (AND (NOT p0) p3))]
Knowledge based reduction with 11 factoid took 506 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p2), p2, p2, true]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p2), p2, p2, true]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p2), p2, p2, true]
Product exploration explored 100000 steps with 3907 reset in 227 ms.
Entered a terminal (fully accepting) state of product in 23824 steps with 926 reset in 59 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-08 finished in 7833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0) U X(!p1))) U p2))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 223 transition count 1228
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 223 transition count 1228
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 205 transition count 1210
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 205 transition count 1210
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 199 transition count 1210
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 99 place count 182 transition count 1193
Iterating global reduction 1 with 17 rules applied. Total rules applied 116 place count 182 transition count 1193
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 120 place count 178 transition count 1193
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 134 place count 164 transition count 1179
Iterating global reduction 2 with 14 rules applied. Total rules applied 148 place count 164 transition count 1179
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 158 place count 154 transition count 1169
Iterating global reduction 2 with 10 rules applied. Total rules applied 168 place count 154 transition count 1169
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 178 place count 144 transition count 1159
Iterating global reduction 2 with 10 rules applied. Total rules applied 188 place count 144 transition count 1159
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 215 place count 117 transition count 1132
Iterating global reduction 2 with 27 rules applied. Total rules applied 242 place count 117 transition count 1132
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 255 place count 104 transition count 1119
Iterating global reduction 2 with 13 rules applied. Total rules applied 268 place count 104 transition count 1119
Applied a total of 268 rules in 33 ms. Remains 104 /243 variables (removed 139) and now considering 1119/1248 (removed 129) transitions.
[2023-03-22 04:42:29] [INFO ] Flow matrix only has 119 transitions (discarded 1000 similar events)
// Phase 1: matrix 119 rows 104 cols
[2023-03-22 04:42:29] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 04:42:29] [INFO ] Implicit Places using invariants in 113 ms returned [17, 45, 69, 73, 92]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 124 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/243 places, 1119/1248 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 88 transition count 1108
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 88 transition count 1108
Applied a total of 22 rules in 5 ms. Remains 88 /99 variables (removed 11) and now considering 1108/1119 (removed 11) transitions.
[2023-03-22 04:42:29] [INFO ] Flow matrix only has 104 transitions (discarded 1004 similar events)
// Phase 1: matrix 104 rows 88 cols
[2023-03-22 04:42:29] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 04:42:29] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-22 04:42:29] [INFO ] Flow matrix only has 104 transitions (discarded 1004 similar events)
[2023-03-22 04:42:29] [INFO ] Invariant cache hit.
[2023-03-22 04:42:30] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/243 places, 1108/1248 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 529 ms. Remains : 88/243 places, 1108/1248 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p2), p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s30 1) (GEQ s65 1) (LT s83 1)), p0:(LT s83 1), p1:(AND (GEQ s62 1) (GEQ s74 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6330 steps with 1834 reset in 24 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-09 finished in 838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 223 transition count 1228
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 223 transition count 1228
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 205 transition count 1210
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 205 transition count 1210
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 199 transition count 1210
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 99 place count 182 transition count 1193
Iterating global reduction 1 with 17 rules applied. Total rules applied 116 place count 182 transition count 1193
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 179 transition count 1193
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 135 place count 163 transition count 1177
Iterating global reduction 2 with 16 rules applied. Total rules applied 151 place count 163 transition count 1177
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 160 place count 154 transition count 1168
Iterating global reduction 2 with 9 rules applied. Total rules applied 169 place count 154 transition count 1168
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 178 place count 145 transition count 1159
Iterating global reduction 2 with 9 rules applied. Total rules applied 187 place count 145 transition count 1159
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 213 place count 119 transition count 1133
Iterating global reduction 2 with 26 rules applied. Total rules applied 239 place count 119 transition count 1133
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 248 place count 110 transition count 1124
Iterating global reduction 2 with 9 rules applied. Total rules applied 257 place count 110 transition count 1124
Applied a total of 257 rules in 29 ms. Remains 110 /243 variables (removed 133) and now considering 1124/1248 (removed 124) transitions.
[2023-03-22 04:42:30] [INFO ] Flow matrix only has 123 transitions (discarded 1001 similar events)
// Phase 1: matrix 123 rows 110 cols
[2023-03-22 04:42:30] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-22 04:42:30] [INFO ] Implicit Places using invariants in 180 ms returned [17, 45, 80, 84, 98]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 182 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/243 places, 1124/1248 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 94 transition count 1113
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 94 transition count 1113
Applied a total of 22 rules in 5 ms. Remains 94 /105 variables (removed 11) and now considering 1113/1124 (removed 11) transitions.
[2023-03-22 04:42:30] [INFO ] Flow matrix only has 108 transitions (discarded 1005 similar events)
// Phase 1: matrix 108 rows 94 cols
[2023-03-22 04:42:30] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 04:42:30] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-22 04:42:30] [INFO ] Flow matrix only has 108 transitions (discarded 1005 similar events)
[2023-03-22 04:42:30] [INFO ] Invariant cache hit.
[2023-03-22 04:42:30] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 94/243 places, 1113/1248 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 525 ms. Remains : 94/243 places, 1113/1248 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 478 steps with 18 reset in 2 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-12 finished in 633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Graph (complete) has 1913 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 242 transition count 1224
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 219 transition count 1223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 218 transition count 1223
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 49 place count 218 transition count 1210
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 75 place count 205 transition count 1210
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 90 place count 190 transition count 1195
Iterating global reduction 3 with 15 rules applied. Total rules applied 105 place count 190 transition count 1195
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 112 place count 183 transition count 1188
Iterating global reduction 3 with 7 rules applied. Total rules applied 119 place count 183 transition count 1188
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 124 place count 178 transition count 1188
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 124 place count 178 transition count 1183
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 134 place count 173 transition count 1183
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 140 place count 167 transition count 1177
Iterating global reduction 4 with 6 rules applied. Total rules applied 146 place count 167 transition count 1177
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 162 transition count 1172
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 162 transition count 1172
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 176 place count 142 transition count 1152
Iterating global reduction 4 with 20 rules applied. Total rules applied 196 place count 142 transition count 1152
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 238 place count 121 transition count 1131
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 245 place count 114 transition count 1124
Iterating global reduction 4 with 7 rules applied. Total rules applied 252 place count 114 transition count 1124
Applied a total of 252 rules in 56 ms. Remains 114 /243 variables (removed 129) and now considering 1124/1248 (removed 124) transitions.
[2023-03-22 04:42:31] [INFO ] Flow matrix only has 187 transitions (discarded 937 similar events)
// Phase 1: matrix 187 rows 114 cols
[2023-03-22 04:42:31] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-22 04:42:31] [INFO ] Implicit Places using invariants in 123 ms returned [9, 12, 41, 49, 54, 74, 81, 86, 100]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 125 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/243 places, 1124/1248 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 92 transition count 1111
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 92 transition count 1111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 89 transition count 1108
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 89 transition count 1108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 86 transition count 1105
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 86 transition count 1105
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 50 place count 80 transition count 1099
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 78 transition count 1097
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 78 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 77 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 77 transition count 1096
Applied a total of 56 rules in 32 ms. Remains 77 /105 variables (removed 28) and now considering 1096/1124 (removed 28) transitions.
[2023-03-22 04:42:31] [INFO ] Flow matrix only has 76 transitions (discarded 1020 similar events)
// Phase 1: matrix 76 rows 77 cols
[2023-03-22 04:42:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:42:31] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-22 04:42:31] [INFO ] Flow matrix only has 76 transitions (discarded 1020 similar events)
[2023-03-22 04:42:31] [INFO ] Invariant cache hit.
[2023-03-22 04:42:31] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/243 places, 1096/1248 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 502 ms. Remains : 77/243 places, 1096/1248 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s54 1) (GEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 1 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-13 finished in 624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U !p0))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Graph (complete) has 1913 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 242 transition count 1225
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 220 transition count 1225
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 45 place count 220 transition count 1212
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 71 place count 207 transition count 1212
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 86 place count 192 transition count 1197
Iterating global reduction 2 with 15 rules applied. Total rules applied 101 place count 192 transition count 1197
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 108 place count 185 transition count 1190
Iterating global reduction 2 with 7 rules applied. Total rules applied 115 place count 185 transition count 1190
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 180 transition count 1190
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 120 place count 180 transition count 1185
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 130 place count 175 transition count 1185
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 136 place count 169 transition count 1179
Iterating global reduction 3 with 6 rules applied. Total rules applied 142 place count 169 transition count 1179
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 147 place count 164 transition count 1174
Iterating global reduction 3 with 5 rules applied. Total rules applied 152 place count 164 transition count 1174
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 172 place count 144 transition count 1154
Iterating global reduction 3 with 20 rules applied. Total rules applied 192 place count 144 transition count 1154
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 234 place count 123 transition count 1133
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 240 place count 117 transition count 1127
Iterating global reduction 3 with 6 rules applied. Total rules applied 246 place count 117 transition count 1127
Applied a total of 246 rules in 55 ms. Remains 117 /243 variables (removed 126) and now considering 1127/1248 (removed 121) transitions.
[2023-03-22 04:42:31] [INFO ] Flow matrix only has 191 transitions (discarded 936 similar events)
// Phase 1: matrix 191 rows 117 cols
[2023-03-22 04:42:31] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-22 04:42:31] [INFO ] Implicit Places using invariants in 126 ms returned [9, 12, 43, 51, 56, 76, 80, 83, 88, 102]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 140 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/243 places, 1127/1248 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 91 transition count 1111
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 91 transition count 1111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 88 transition count 1108
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 88 transition count 1108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 85 transition count 1105
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 85 transition count 1105
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 56 place count 79 transition count 1099
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 77 transition count 1097
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 77 transition count 1097
Applied a total of 60 rules in 25 ms. Remains 77 /107 variables (removed 30) and now considering 1097/1127 (removed 30) transitions.
[2023-03-22 04:42:31] [INFO ] Flow matrix only has 77 transitions (discarded 1020 similar events)
// Phase 1: matrix 77 rows 77 cols
[2023-03-22 04:42:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 04:42:31] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-22 04:42:31] [INFO ] Flow matrix only has 77 transitions (discarded 1020 similar events)
[2023-03-22 04:42:31] [INFO ] Invariant cache hit.
[2023-03-22 04:42:32] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/243 places, 1097/1248 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 435 ms. Remains : 77/243 places, 1097/1248 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, p0]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s27 1), p1:(GEQ s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-14 finished in 513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G((p1||X(p2))))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 1248/1248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 224 transition count 1229
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 224 transition count 1229
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 55 place count 207 transition count 1212
Iterating global reduction 0 with 17 rules applied. Total rules applied 72 place count 207 transition count 1212
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 202 transition count 1212
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 93 place count 186 transition count 1196
Iterating global reduction 1 with 16 rules applied. Total rules applied 109 place count 186 transition count 1196
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 112 place count 183 transition count 1196
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 169 transition count 1182
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 169 transition count 1182
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 148 place count 161 transition count 1174
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 161 transition count 1174
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 164 place count 153 transition count 1166
Iterating global reduction 2 with 8 rules applied. Total rules applied 172 place count 153 transition count 1166
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 195 place count 130 transition count 1143
Iterating global reduction 2 with 23 rules applied. Total rules applied 218 place count 130 transition count 1143
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 228 place count 120 transition count 1133
Iterating global reduction 2 with 10 rules applied. Total rules applied 238 place count 120 transition count 1133
Applied a total of 238 rules in 34 ms. Remains 120 /243 variables (removed 123) and now considering 1133/1248 (removed 115) transitions.
[2023-03-22 04:42:32] [INFO ] Flow matrix only has 149 transitions (discarded 984 similar events)
// Phase 1: matrix 149 rows 120 cols
[2023-03-22 04:42:32] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-22 04:42:32] [INFO ] Implicit Places using invariants in 121 ms returned [17, 56, 80, 93, 107]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 128 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/243 places, 1133/1248 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 103 transition count 1121
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 103 transition count 1121
Applied a total of 24 rules in 6 ms. Remains 103 /115 variables (removed 12) and now considering 1121/1133 (removed 12) transitions.
[2023-03-22 04:42:32] [INFO ] Flow matrix only has 133 transitions (discarded 988 similar events)
// Phase 1: matrix 133 rows 103 cols
[2023-03-22 04:42:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:42:32] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-22 04:42:32] [INFO ] Flow matrix only has 133 transitions (discarded 988 similar events)
[2023-03-22 04:42:32] [INFO ] Invariant cache hit.
[2023-03-22 04:42:32] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/243 places, 1121/1248 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 401 ms. Remains : 103/243 places, 1121/1248 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=3, aps=[p2:(AND (GEQ s73 1) (GEQ s78 1) (OR (LT s32 1) (LT s39 1))), p1:(AND (GEQ s73 1) (GEQ s78 1)), p0:(LT s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1018 steps with 39 reset in 4 ms.
FORMULA LeafsetExtension-PT-S32C3-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C3-LTLFireability-15 finished in 536 ms.
All properties solved by simple procedures.
Total runtime 23406 ms.
ITS solved all properties within timeout

BK_STOP 1679460153873

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S32C3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is LeafsetExtension-PT-S32C3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r231-tall-167856416200508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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