fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r231-tall-167856416100460
Last Updated
May 14, 2023

About the Execution of LoLa+red for LeafsetExtension-PT-S08C3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
543.420 12044.00 22793.00 408.80 TFTTTFFTTFFFTFFT normal

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-167856416100460.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-S08C3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416100460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:20 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 254K 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-S08C3-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S08C3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679458173908

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-S08C3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 04:09:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 04:09:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:09:35] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-22 04:09:35] [INFO ] Transformed 462 places.
[2023-03-22 04:09:35] [INFO ] Transformed 409 transitions.
[2023-03-22 04:09:35] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 377 transition count 409
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 151 place count 311 transition count 343
Iterating global reduction 1 with 66 rules applied. Total rules applied 217 place count 311 transition count 343
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 260 place count 268 transition count 300
Iterating global reduction 1 with 43 rules applied. Total rules applied 303 place count 268 transition count 300
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 343 place count 228 transition count 260
Iterating global reduction 1 with 40 rules applied. Total rules applied 383 place count 228 transition count 260
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 392 place count 219 transition count 260
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 399 place count 212 transition count 253
Iterating global reduction 2 with 7 rules applied. Total rules applied 406 place count 212 transition count 253
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 412 place count 206 transition count 247
Iterating global reduction 2 with 6 rules applied. Total rules applied 418 place count 206 transition count 247
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 422 place count 202 transition count 243
Iterating global reduction 2 with 4 rules applied. Total rules applied 426 place count 202 transition count 243
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 430 place count 198 transition count 239
Iterating global reduction 2 with 4 rules applied. Total rules applied 434 place count 198 transition count 239
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 443 place count 189 transition count 230
Iterating global reduction 2 with 9 rules applied. Total rules applied 452 place count 189 transition count 230
Applied a total of 452 rules in 88 ms. Remains 189 /462 variables (removed 273) and now considering 230/409 (removed 179) transitions.
[2023-03-22 04:09:35] [INFO ] Flow matrix only has 221 transitions (discarded 9 similar events)
// Phase 1: matrix 221 rows 189 cols
[2023-03-22 04:09:35] [INFO ] Computed 21 place invariants in 28 ms
[2023-03-22 04:09:36] [INFO ] Implicit Places using invariants in 418 ms returned [65, 145]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 445 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/462 places, 230/409 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 228
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 228
Applied a total of 4 rules in 9 ms. Remains 185 /187 variables (removed 2) and now considering 228/230 (removed 2) transitions.
[2023-03-22 04:09:36] [INFO ] Flow matrix only has 217 transitions (discarded 11 similar events)
// Phase 1: matrix 217 rows 185 cols
[2023-03-22 04:09:36] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-22 04:09:36] [INFO ] Implicit Places using invariants in 111 ms returned [26, 40, 87, 102, 112, 167]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 112 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 179/462 places, 228/409 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 162 transition count 211
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 162 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 161 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 161 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 160 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 160 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 159 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 159 transition count 208
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 156 transition count 205
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 156 transition count 205
Applied a total of 46 rules in 18 ms. Remains 156 /179 variables (removed 23) and now considering 205/228 (removed 23) transitions.
[2023-03-22 04:09:36] [INFO ] Flow matrix only has 190 transitions (discarded 15 similar events)
// Phase 1: matrix 190 rows 156 cols
[2023-03-22 04:09:36] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-22 04:09:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-22 04:09:36] [INFO ] Flow matrix only has 190 transitions (discarded 15 similar events)
[2023-03-22 04:09:36] [INFO ] Invariant cache hit.
[2023-03-22 04:09:36] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 156/462 places, 205/409 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 849 ms. Remains : 156/462 places, 205/409 transitions.
Support contains 40 out of 156 places after structural reductions.
[2023-03-22 04:09:36] [INFO ] Flatten gal took : 35 ms
[2023-03-22 04:09:36] [INFO ] Flatten gal took : 19 ms
[2023-03-22 04:09:36] [INFO ] Input system was already deterministic with 205 transitions.
Incomplete random walk after 10000 steps, including 365 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:09:36] [INFO ] Flow matrix only has 190 transitions (discarded 15 similar events)
[2023-03-22 04:09:36] [INFO ] Invariant cache hit.
[2023-03-22 04:09:36] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-22 04:09:36] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 156 stabilizing places and 205 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 205
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' '!(F(G((X(p0)||F((F(!p0)&&p1))))))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Graph (complete) has 419 edges and 156 vertex of which 155 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 155 transition count 184
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 135 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 133 transition count 182
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 45 place count 133 transition count 168
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 73 place count 119 transition count 168
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 83 place count 109 transition count 158
Iterating global reduction 3 with 10 rules applied. Total rules applied 93 place count 109 transition count 158
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 104 place count 98 transition count 147
Iterating global reduction 3 with 11 rules applied. Total rules applied 115 place count 98 transition count 147
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 118 place count 95 transition count 147
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 118 place count 95 transition count 144
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 124 place count 92 transition count 144
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 129 place count 87 transition count 139
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 87 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 137 place count 84 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 140 place count 84 transition count 136
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 146 place count 78 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 152 place count 78 transition count 130
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 182 place count 63 transition count 115
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 187 place count 58 transition count 110
Iterating global reduction 4 with 5 rules applied. Total rules applied 192 place count 58 transition count 110
Applied a total of 192 rules in 36 ms. Remains 58 /156 variables (removed 98) and now considering 110/205 (removed 95) transitions.
[2023-03-22 04:09:37] [INFO ] Flow matrix only has 71 transitions (discarded 39 similar events)
// Phase 1: matrix 71 rows 58 cols
[2023-03-22 04:09:37] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-22 04:09:37] [INFO ] Implicit Places using invariants in 50 ms returned [21, 26, 33, 35, 42, 44]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 50 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/156 places, 110/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 46 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 46 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 44 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 44 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 43 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 43 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 28 place count 38 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 36 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 36 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 35 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 35 transition count 93
Applied a total of 34 rules in 9 ms. Remains 35 /52 variables (removed 17) and now considering 93/110 (removed 17) transitions.
[2023-03-22 04:09:37] [INFO ] Flow matrix only has 37 transitions (discarded 56 similar events)
// Phase 1: matrix 37 rows 35 cols
[2023-03-22 04:09:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:09:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 04:09:37] [INFO ] Flow matrix only has 37 transitions (discarded 56 similar events)
[2023-03-22 04:09:37] [INFO ] Invariant cache hit.
[2023-03-22 04:09:37] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/156 places, 93/205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 35/156 places, 93/205 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s14 1) (LT s18 1)), p1:(AND (GEQ s6 1) (GEQ s8 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 8049 reset in 290 ms.
Product exploration explored 100000 steps with 8032 reset in 174 ms.
Computed a total of 35 stabilizing places and 93 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 transition count 93
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)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-00 finished in 1233 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||G(F(p0)))))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Graph (complete) has 419 edges and 156 vertex of which 155 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 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 155 transition count 182
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 133 transition count 182
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 45 place count 133 transition count 168
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 73 place count 119 transition count 168
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 84 place count 108 transition count 157
Iterating global reduction 2 with 11 rules applied. Total rules applied 95 place count 108 transition count 157
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 106 place count 97 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 117 place count 97 transition count 146
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 94 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 120 place count 94 transition count 143
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 126 place count 91 transition count 143
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 131 place count 86 transition count 138
Iterating global reduction 3 with 5 rules applied. Total rules applied 136 place count 86 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 139 place count 83 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 83 transition count 135
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 149 place count 76 transition count 128
Iterating global reduction 3 with 7 rules applied. Total rules applied 156 place count 76 transition count 128
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 188 place count 60 transition count 112
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 192 place count 56 transition count 108
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 56 transition count 108
Applied a total of 196 rules in 27 ms. Remains 56 /156 variables (removed 100) and now considering 108/205 (removed 97) transitions.
[2023-03-22 04:09:38] [INFO ] Flow matrix only has 68 transitions (discarded 40 similar events)
// Phase 1: matrix 68 rows 56 cols
[2023-03-22 04:09:38] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-22 04:09:38] [INFO ] Implicit Places using invariants in 45 ms returned [5, 17, 20, 22, 29, 31, 38]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 46 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/156 places, 108/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 43 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 43 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 41 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 41 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 40 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 40 transition count 99
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 34 place count 32 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 30 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 30 transition count 89
Applied a total of 38 rules in 7 ms. Remains 30 /49 variables (removed 19) and now considering 89/108 (removed 19) transitions.
[2023-03-22 04:09:38] [INFO ] Flow matrix only has 31 transitions (discarded 58 similar events)
// Phase 1: matrix 31 rows 30 cols
[2023-03-22 04:09:38] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:09:38] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 04:09:38] [INFO ] Flow matrix only has 31 transitions (discarded 58 similar events)
[2023-03-22 04:09:38] [INFO ] Invariant cache hit.
[2023-03-22 04:09:38] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/156 places, 89/205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 30/156 places, 89/205 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s22 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 11 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-01 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Graph (complete) has 419 edges and 156 vertex of which 155 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 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 155 transition count 183
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 134 transition count 183
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 43 place count 134 transition count 169
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 71 place count 120 transition count 169
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 82 place count 109 transition count 158
Iterating global reduction 2 with 11 rules applied. Total rules applied 93 place count 109 transition count 158
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 104 place count 98 transition count 147
Iterating global reduction 2 with 11 rules applied. Total rules applied 115 place count 98 transition count 147
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 95 transition count 147
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 118 place count 95 transition count 144
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 124 place count 92 transition count 144
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 129 place count 87 transition count 139
Iterating global reduction 3 with 5 rules applied. Total rules applied 134 place count 87 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 137 place count 84 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 140 place count 84 transition count 136
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 147 place count 77 transition count 129
Iterating global reduction 3 with 7 rules applied. Total rules applied 154 place count 77 transition count 129
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 186 place count 61 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 189 place count 58 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 192 place count 58 transition count 110
Applied a total of 192 rules in 35 ms. Remains 58 /156 variables (removed 98) and now considering 110/205 (removed 95) transitions.
[2023-03-22 04:09:38] [INFO ] Flow matrix only has 70 transitions (discarded 40 similar events)
// Phase 1: matrix 70 rows 58 cols
[2023-03-22 04:09:38] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-22 04:09:38] [INFO ] Implicit Places using invariants in 44 ms returned [19, 22, 33, 35, 42, 44]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 46 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/156 places, 110/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 46 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 46 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 45 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 45 transition count 103
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 30 place count 37 transition count 95
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 35 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 35 transition count 93
Applied a total of 34 rules in 6 ms. Remains 35 /52 variables (removed 17) and now considering 93/110 (removed 17) transitions.
[2023-03-22 04:09:38] [INFO ] Flow matrix only has 39 transitions (discarded 54 similar events)
// Phase 1: matrix 39 rows 35 cols
[2023-03-22 04:09:38] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 04:09:38] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 04:09:38] [INFO ] Flow matrix only has 39 transitions (discarded 54 similar events)
[2023-03-22 04:09:38] [INFO ] Invariant cache hit.
[2023-03-22 04:09:38] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/156 places, 93/205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 35/156 places, 93/205 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s5 1), p1:(LT s18 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 8104 reset in 147 ms.
Product exploration explored 100000 steps with 8129 reset in 131 ms.
Computed a total of 35 stabilizing places and 93 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 transition count 93
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-02 finished in 629 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)||G(p1)))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 141 transition count 190
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 141 transition count 190
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 44 place count 127 transition count 176
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 127 transition count 176
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 124 transition count 176
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 76 place count 109 transition count 161
Iterating global reduction 1 with 15 rules applied. Total rules applied 91 place count 109 transition count 161
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 104 transition count 161
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 107 place count 93 transition count 150
Iterating global reduction 2 with 11 rules applied. Total rules applied 118 place count 93 transition count 150
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 126 place count 85 transition count 142
Iterating global reduction 2 with 8 rules applied. Total rules applied 134 place count 85 transition count 142
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 142 place count 77 transition count 134
Iterating global reduction 2 with 8 rules applied. Total rules applied 150 place count 77 transition count 134
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 163 place count 64 transition count 121
Iterating global reduction 2 with 13 rules applied. Total rules applied 176 place count 64 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 186 place count 54 transition count 111
Iterating global reduction 2 with 10 rules applied. Total rules applied 196 place count 54 transition count 111
Applied a total of 196 rules in 16 ms. Remains 54 /156 variables (removed 102) and now considering 111/205 (removed 94) transitions.
[2023-03-22 04:09:39] [INFO ] Flow matrix only has 61 transitions (discarded 50 similar events)
// Phase 1: matrix 61 rows 54 cols
[2023-03-22 04:09:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 04:09:39] [INFO ] Implicit Places using invariants in 41 ms returned [22, 32, 42]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/156 places, 111/205 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 43 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 43 transition count 103
Applied a total of 16 rules in 1 ms. Remains 43 /51 variables (removed 8) and now considering 103/111 (removed 8) transitions.
[2023-03-22 04:09:39] [INFO ] Flow matrix only has 50 transitions (discarded 53 similar events)
// Phase 1: matrix 50 rows 43 cols
[2023-03-22 04:09:39] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 04:09:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 04:09:39] [INFO ] Flow matrix only has 50 transitions (discarded 53 similar events)
[2023-03-22 04:09:39] [INFO ] Invariant cache hit.
[2023-03-22 04:09:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 43/156 places, 103/205 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 43/156 places, 103/205 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s31 1) (LT s36 1)), p1:(GEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 43 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 transition count 103
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)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-03 finished in 884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 140 transition count 189
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 140 transition count 189
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 47 place count 125 transition count 174
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 125 transition count 174
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 123 transition count 174
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 80 place count 107 transition count 158
Iterating global reduction 1 with 16 rules applied. Total rules applied 96 place count 107 transition count 158
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 101 place count 102 transition count 158
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 113 place count 90 transition count 146
Iterating global reduction 2 with 12 rules applied. Total rules applied 125 place count 90 transition count 146
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 132 place count 83 transition count 139
Iterating global reduction 2 with 7 rules applied. Total rules applied 139 place count 83 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 146 place count 76 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 153 place count 76 transition count 132
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 163 place count 66 transition count 122
Iterating global reduction 2 with 10 rules applied. Total rules applied 173 place count 66 transition count 122
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 183 place count 56 transition count 112
Iterating global reduction 2 with 10 rules applied. Total rules applied 193 place count 56 transition count 112
Applied a total of 193 rules in 13 ms. Remains 56 /156 variables (removed 100) and now considering 112/205 (removed 93) transitions.
[2023-03-22 04:09:40] [INFO ] Flow matrix only has 59 transitions (discarded 53 similar events)
// Phase 1: matrix 59 rows 56 cols
[2023-03-22 04:09:40] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 04:09:40] [INFO ] Implicit Places using invariants in 44 ms returned [32, 38, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/156 places, 112/205 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 45 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 45 transition count 104
Applied a total of 16 rules in 0 ms. Remains 45 /53 variables (removed 8) and now considering 104/112 (removed 8) transitions.
[2023-03-22 04:09:40] [INFO ] Flow matrix only has 48 transitions (discarded 56 similar events)
// Phase 1: matrix 48 rows 45 cols
[2023-03-22 04:09:40] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:09:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 04:09:40] [INFO ] Flow matrix only has 48 transitions (discarded 56 similar events)
[2023-03-22 04:09:40] [INFO ] Invariant cache hit.
[2023-03-22 04:09:40] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 45/156 places, 104/205 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 45/156 places, 104/205 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s21 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-05 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 140 transition count 189
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 140 transition count 189
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 47 place count 125 transition count 174
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 125 transition count 174
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 122 transition count 174
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 83 place count 104 transition count 156
Iterating global reduction 1 with 18 rules applied. Total rules applied 101 place count 104 transition count 156
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 106 place count 99 transition count 156
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 119 place count 86 transition count 143
Iterating global reduction 2 with 13 rules applied. Total rules applied 132 place count 86 transition count 143
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 140 place count 78 transition count 135
Iterating global reduction 2 with 8 rules applied. Total rules applied 148 place count 78 transition count 135
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 156 place count 70 transition count 127
Iterating global reduction 2 with 8 rules applied. Total rules applied 164 place count 70 transition count 127
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 177 place count 57 transition count 114
Iterating global reduction 2 with 13 rules applied. Total rules applied 190 place count 57 transition count 114
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 200 place count 47 transition count 104
Iterating global reduction 2 with 10 rules applied. Total rules applied 210 place count 47 transition count 104
Applied a total of 210 rules in 14 ms. Remains 47 /156 variables (removed 109) and now considering 104/205 (removed 101) transitions.
[2023-03-22 04:09:40] [INFO ] Flow matrix only has 48 transitions (discarded 56 similar events)
// Phase 1: matrix 48 rows 47 cols
[2023-03-22 04:09:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 04:09:40] [INFO ] Implicit Places using invariants in 42 ms returned [22, 30, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/156 places, 104/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 38 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 38 transition count 98
Applied a total of 12 rules in 1 ms. Remains 38 /44 variables (removed 6) and now considering 98/104 (removed 6) transitions.
[2023-03-22 04:09:40] [INFO ] Flow matrix only has 39 transitions (discarded 59 similar events)
// Phase 1: matrix 39 rows 38 cols
[2023-03-22 04:09:40] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 04:09:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 04:09:40] [INFO ] Flow matrix only has 39 transitions (discarded 59 similar events)
[2023-03-22 04:09:40] [INFO ] Invariant cache hit.
[2023-03-22 04:09:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 38/156 places, 98/205 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 38/156 places, 98/205 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s24 1) (GEQ s27 1)), p0:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-06 finished in 220 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||F(p1)||(!p0&&G(F(!p0))))))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 140 transition count 189
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 140 transition count 189
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 47 place count 125 transition count 174
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 125 transition count 174
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 123 transition count 174
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 80 place count 107 transition count 158
Iterating global reduction 1 with 16 rules applied. Total rules applied 96 place count 107 transition count 158
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 101 place count 102 transition count 158
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 113 place count 90 transition count 146
Iterating global reduction 2 with 12 rules applied. Total rules applied 125 place count 90 transition count 146
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 132 place count 83 transition count 139
Iterating global reduction 2 with 7 rules applied. Total rules applied 139 place count 83 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 146 place count 76 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 153 place count 76 transition count 132
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 164 place count 65 transition count 121
Iterating global reduction 2 with 11 rules applied. Total rules applied 175 place count 65 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 185 place count 55 transition count 111
Iterating global reduction 2 with 10 rules applied. Total rules applied 195 place count 55 transition count 111
Applied a total of 195 rules in 14 ms. Remains 55 /156 variables (removed 101) and now considering 111/205 (removed 94) transitions.
[2023-03-22 04:09:40] [INFO ] Flow matrix only has 58 transitions (discarded 53 similar events)
// Phase 1: matrix 58 rows 55 cols
[2023-03-22 04:09:40] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 04:09:40] [INFO ] Implicit Places using invariants in 56 ms returned [31, 37, 43]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/156 places, 111/205 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 45 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 45 transition count 104
Applied a total of 14 rules in 1 ms. Remains 45 /52 variables (removed 7) and now considering 104/111 (removed 7) transitions.
[2023-03-22 04:09:40] [INFO ] Flow matrix only has 48 transitions (discarded 56 similar events)
// Phase 1: matrix 48 rows 45 cols
[2023-03-22 04:09:40] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 04:09:40] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 04:09:40] [INFO ] Flow matrix only has 48 transitions (discarded 56 similar events)
[2023-03-22 04:09:40] [INFO ] Invariant cache hit.
[2023-03-22 04:09:40] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 45/156 places, 104/205 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 45/156 places, 104/205 transitions.
Stuttering acceptance computed with spot in 134 ms :[false, false, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s13 1)), p1:(OR (LT s21 1) (LT s23 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 45 stabilizing places and 104 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 45 transition count 104
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-07 finished in 686 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))&&F(p2))))'
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Graph (complete) has 419 edges and 156 vertex of which 155 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 155 transition count 185
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 136 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 134 transition count 183
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 43 place count 134 transition count 169
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 71 place count 120 transition count 169
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 80 place count 111 transition count 160
Iterating global reduction 3 with 9 rules applied. Total rules applied 89 place count 111 transition count 160
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 98 place count 102 transition count 151
Iterating global reduction 3 with 9 rules applied. Total rules applied 107 place count 102 transition count 151
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 101 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 108 place count 101 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 100 transition count 150
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 113 place count 97 transition count 147
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 97 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 96 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 96 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 120 place count 94 transition count 144
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 94 transition count 144
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 160 place count 75 transition count 125
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 165 place count 70 transition count 120
Iterating global reduction 4 with 5 rules applied. Total rules applied 170 place count 70 transition count 120
Applied a total of 170 rules in 27 ms. Remains 70 /156 variables (removed 86) and now considering 120/205 (removed 85) transitions.
[2023-03-22 04:09:41] [INFO ] Flow matrix only has 88 transitions (discarded 32 similar events)
// Phase 1: matrix 88 rows 70 cols
[2023-03-22 04:09:41] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-22 04:09:41] [INFO ] Implicit Places using invariants in 49 ms returned [5, 28, 34, 36, 43, 45, 54]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 50 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/156 places, 120/205 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 115
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 55 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 55 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 53 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 53 transition count 110
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 36 place count 45 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 43 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 43 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 42 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 42 transition count 99
Applied a total of 42 rules in 7 ms. Remains 42 /63 variables (removed 21) and now considering 99/120 (removed 21) transitions.
[2023-03-22 04:09:41] [INFO ] Flow matrix only has 46 transitions (discarded 53 similar events)
// Phase 1: matrix 46 rows 42 cols
[2023-03-22 04:09:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 04:09:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 04:09:41] [INFO ] Flow matrix only has 46 transitions (discarded 53 similar events)
[2023-03-22 04:09:41] [INFO ] Invariant cache hit.
[2023-03-22 04:09:41] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/156 places, 99/205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160 ms. Remains : 42/156 places, 99/205 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s9 1) (LT s12 1)), p2:(OR (LT s18 1) (LT s32 1)), p1:(OR (LT s17 1) (LT s20 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]]
Product exploration explored 100000 steps with 7726 reset in 118 ms.
Product exploration explored 100000 steps with 7734 reset in 133 ms.
Computed a total of 42 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 42 transition count 99
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 12 factoid took 330 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-08 finished in 963 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||(!p1 U G(p0))))))'
Support contains 2 out of 156 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 : 156/156 places, 205/205 transitions.
Graph (complete) has 419 edges and 156 vertex of which 155 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 155 transition count 184
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 135 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 134 transition count 183
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 43 place count 134 transition count 170
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 69 place count 121 transition count 170
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 78 place count 112 transition count 161
Iterating global reduction 3 with 9 rules applied. Total rules applied 87 place count 112 transition count 161
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 95 place count 104 transition count 153
Iterating global reduction 3 with 8 rules applied. Total rules applied 103 place count 104 transition count 153
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 106 place count 101 transition count 153
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 106 place count 101 transition count 150
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 112 place count 98 transition count 150
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 117 place count 93 transition count 145
Iterating global reduction 4 with 5 rules applied. Total rules applied 122 place count 93 transition count 145
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 90 transition count 142
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 90 transition count 142
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 134 place count 84 transition count 136
Iterating global reduction 4 with 6 rules applied. Total rules applied 140 place count 84 transition count 136
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 174 place count 67 transition count 119
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 182 place count 59 transition count 111
Iterating global reduction 4 with 8 rules applied. Total rules applied 190 place count 59 transition count 111
Applied a total of 190 rules in 23 ms. Remains 59 /156 variables (removed 97) and now considering 111/205 (removed 94) transitions.
[2023-03-22 04:09:42] [INFO ] Flow matrix only has 72 transitions (discarded 39 similar events)
// Phase 1: matrix 72 rows 59 cols
[2023-03-22 04:09:42] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-22 04:09:42] [INFO ] Implicit Places using invariants in 48 ms returned [5, 17, 20, 34, 36, 43, 45]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 49 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/156 places, 111/205 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 45 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 45 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 43 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 43 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 42 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 42 transition count 101
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 34 place count 35 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 33 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 33 transition count 92
Applied a total of 38 rules in 5 ms. Remains 33 /52 variables (removed 19) and now considering 92/111 (removed 19) transitions.
[2023-03-22 04:09:42] [INFO ] Flow matrix only has 35 transitions (discarded 57 similar events)
// Phase 1: matrix 35 rows 33 cols
[2023-03-22 04:09:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 04:09:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 04:09:42] [INFO ] Flow matrix only has 35 transitions (discarded 57 similar events)
[2023-03-22 04:09:42] [INFO ] Invariant cache hit.
[2023-03-22 04:09:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/156 places, 92/205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 33/156 places, 92/205 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-09 finished in 425 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||(!p1 U G(p1)))) U G(p1))||X(F(p0))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 141 transition count 190
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 141 transition count 190
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 44 place count 127 transition count 176
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 127 transition count 176
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 124 transition count 176
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 75 place count 110 transition count 162
Iterating global reduction 1 with 14 rules applied. Total rules applied 89 place count 110 transition count 162
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 93 place count 106 transition count 162
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 104 place count 95 transition count 151
Iterating global reduction 2 with 11 rules applied. Total rules applied 115 place count 95 transition count 151
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 122 place count 88 transition count 144
Iterating global reduction 2 with 7 rules applied. Total rules applied 129 place count 88 transition count 144
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 136 place count 81 transition count 137
Iterating global reduction 2 with 7 rules applied. Total rules applied 143 place count 81 transition count 137
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 155 place count 69 transition count 125
Iterating global reduction 2 with 12 rules applied. Total rules applied 167 place count 69 transition count 125
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 176 place count 60 transition count 116
Iterating global reduction 2 with 9 rules applied. Total rules applied 185 place count 60 transition count 116
Applied a total of 185 rules in 13 ms. Remains 60 /156 variables (removed 96) and now considering 116/205 (removed 89) transitions.
[2023-03-22 04:09:42] [INFO ] Flow matrix only has 66 transitions (discarded 50 similar events)
// Phase 1: matrix 66 rows 60 cols
[2023-03-22 04:09:42] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 04:09:42] [INFO ] Implicit Places using invariants in 44 ms returned [31, 37, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/156 places, 116/205 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 49 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 49 transition count 108
Applied a total of 16 rules in 1 ms. Remains 49 /57 variables (removed 8) and now considering 108/116 (removed 8) transitions.
[2023-03-22 04:09:42] [INFO ] Flow matrix only has 55 transitions (discarded 53 similar events)
// Phase 1: matrix 55 rows 49 cols
[2023-03-22 04:09:42] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 04:09:42] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-22 04:09:42] [INFO ] Flow matrix only has 55 transitions (discarded 53 similar events)
[2023-03-22 04:09:42] [INFO ] Invariant cache hit.
[2023-03-22 04:09:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/156 places, 108/205 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 49/156 places, 108/205 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s35 1) (GEQ s45 1)), p0:(GEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-10 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Graph (complete) has 419 edges and 156 vertex of which 155 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 155 transition count 182
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 133 transition count 182
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 45 place count 133 transition count 168
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 73 place count 119 transition count 168
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 84 place count 108 transition count 157
Iterating global reduction 2 with 11 rules applied. Total rules applied 95 place count 108 transition count 157
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 106 place count 97 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 117 place count 97 transition count 146
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 94 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 120 place count 94 transition count 143
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 126 place count 91 transition count 143
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 131 place count 86 transition count 138
Iterating global reduction 3 with 5 rules applied. Total rules applied 136 place count 86 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 139 place count 83 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 83 transition count 135
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 149 place count 76 transition count 128
Iterating global reduction 3 with 7 rules applied. Total rules applied 156 place count 76 transition count 128
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 188 place count 60 transition count 112
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 193 place count 55 transition count 107
Iterating global reduction 3 with 5 rules applied. Total rules applied 198 place count 55 transition count 107
Applied a total of 198 rules in 12 ms. Remains 55 /156 variables (removed 101) and now considering 107/205 (removed 98) transitions.
[2023-03-22 04:09:42] [INFO ] Flow matrix only has 67 transitions (discarded 40 similar events)
// Phase 1: matrix 67 rows 55 cols
[2023-03-22 04:09:42] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-22 04:09:42] [INFO ] Implicit Places using invariants in 53 ms returned [6, 18, 21, 23, 30, 32, 39, 41]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 54 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/156 places, 107/205 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 40 transition count 100
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 40 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 37 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 37 transition count 97
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 35 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 35 transition count 95
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 29 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 27 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 27 transition count 87
Applied a total of 40 rules in 5 ms. Remains 27 /47 variables (removed 20) and now considering 87/107 (removed 20) transitions.
[2023-03-22 04:09:42] [INFO ] Flow matrix only has 26 transitions (discarded 61 similar events)
// Phase 1: matrix 26 rows 27 cols
[2023-03-22 04:09:42] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 04:09:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 04:09:42] [INFO ] Flow matrix only has 26 transitions (discarded 61 similar events)
[2023-03-22 04:09:42] [INFO ] Invariant cache hit.
[2023-03-22 04:09:43] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/156 places, 87/205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 27/156 places, 87/205 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s4 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 8825 reset in 98 ms.
Product exploration explored 100000 steps with 8819 reset in 110 ms.
Computed a total of 27 stabilizing places and 87 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 87
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 99 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-S08C3-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-12 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 139 transition count 188
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 139 transition count 188
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 50 place count 123 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 66 place count 123 transition count 172
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 120 transition count 172
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 87 place count 102 transition count 154
Iterating global reduction 1 with 18 rules applied. Total rules applied 105 place count 102 transition count 154
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 97 transition count 154
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 123 place count 84 transition count 141
Iterating global reduction 2 with 13 rules applied. Total rules applied 136 place count 84 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 144 place count 76 transition count 133
Iterating global reduction 2 with 8 rules applied. Total rules applied 152 place count 76 transition count 133
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 160 place count 68 transition count 125
Iterating global reduction 2 with 8 rules applied. Total rules applied 168 place count 68 transition count 125
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 181 place count 55 transition count 112
Iterating global reduction 2 with 13 rules applied. Total rules applied 194 place count 55 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 204 place count 45 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 214 place count 45 transition count 102
Applied a total of 214 rules in 11 ms. Remains 45 /156 variables (removed 111) and now considering 102/205 (removed 103) transitions.
[2023-03-22 04:09:43] [INFO ] Flow matrix only has 45 transitions (discarded 57 similar events)
// Phase 1: matrix 45 rows 45 cols
[2023-03-22 04:09:43] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 04:09:43] [INFO ] Implicit Places using invariants in 32 ms returned [22, 28, 34]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/156 places, 102/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 36 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 36 transition count 96
Applied a total of 12 rules in 3 ms. Remains 36 /42 variables (removed 6) and now considering 96/102 (removed 6) transitions.
[2023-03-22 04:09:43] [INFO ] Flow matrix only has 36 transitions (discarded 60 similar events)
// Phase 1: matrix 36 rows 36 cols
[2023-03-22 04:09:43] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 04:09:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 04:09:43] [INFO ] Flow matrix only has 36 transitions (discarded 60 similar events)
[2023-03-22 04:09:43] [INFO ] Invariant cache hit.
[2023-03-22 04:09:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 36/156 places, 96/205 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 36/156 places, 96/205 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-13 finished in 214 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((G(p1)||p0))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 139 transition count 188
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 139 transition count 188
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 50 place count 123 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 66 place count 123 transition count 172
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 120 transition count 172
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 87 place count 102 transition count 154
Iterating global reduction 1 with 18 rules applied. Total rules applied 105 place count 102 transition count 154
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 97 transition count 154
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 123 place count 84 transition count 141
Iterating global reduction 2 with 13 rules applied. Total rules applied 136 place count 84 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 144 place count 76 transition count 133
Iterating global reduction 2 with 8 rules applied. Total rules applied 152 place count 76 transition count 133
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 160 place count 68 transition count 125
Iterating global reduction 2 with 8 rules applied. Total rules applied 168 place count 68 transition count 125
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 181 place count 55 transition count 112
Iterating global reduction 2 with 13 rules applied. Total rules applied 194 place count 55 transition count 112
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 203 place count 46 transition count 103
Iterating global reduction 2 with 9 rules applied. Total rules applied 212 place count 46 transition count 103
Applied a total of 212 rules in 15 ms. Remains 46 /156 variables (removed 110) and now considering 103/205 (removed 102) transitions.
[2023-03-22 04:09:43] [INFO ] Flow matrix only has 47 transitions (discarded 56 similar events)
// Phase 1: matrix 47 rows 46 cols
[2023-03-22 04:09:43] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 04:09:43] [INFO ] Implicit Places using invariants in 41 ms returned [23, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/156 places, 103/205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 99
Applied a total of 8 rules in 1 ms. Remains 40 /44 variables (removed 4) and now considering 99/103 (removed 4) transitions.
[2023-03-22 04:09:43] [INFO ] Flow matrix only has 41 transitions (discarded 58 similar events)
// Phase 1: matrix 41 rows 40 cols
[2023-03-22 04:09:43] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 04:09:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 04:09:43] [INFO ] Flow matrix only has 41 transitions (discarded 58 similar events)
[2023-03-22 04:09:43] [INFO ] Invariant cache hit.
[2023-03-22 04:09:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 40/156 places, 99/205 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 40/156 places, 99/205 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s5 1) (GEQ s25 1)), p0:(OR (LT s5 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 441 steps with 17 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-14 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 205/205 transitions.
Graph (complete) has 419 edges and 156 vertex of which 155 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 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 155 transition count 184
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 135 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 133 transition count 182
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 45 place count 133 transition count 168
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 73 place count 119 transition count 168
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 84 place count 108 transition count 157
Iterating global reduction 3 with 11 rules applied. Total rules applied 95 place count 108 transition count 157
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 106 place count 97 transition count 146
Iterating global reduction 3 with 11 rules applied. Total rules applied 117 place count 97 transition count 146
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 94 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 120 place count 94 transition count 143
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 91 transition count 143
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 131 place count 86 transition count 138
Iterating global reduction 4 with 5 rules applied. Total rules applied 136 place count 86 transition count 138
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 83 transition count 135
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 83 transition count 135
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 149 place count 76 transition count 128
Iterating global reduction 4 with 7 rules applied. Total rules applied 156 place count 76 transition count 128
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 188 place count 60 transition count 112
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 192 place count 56 transition count 108
Iterating global reduction 4 with 4 rules applied. Total rules applied 196 place count 56 transition count 108
Applied a total of 196 rules in 23 ms. Remains 56 /156 variables (removed 100) and now considering 108/205 (removed 97) transitions.
[2023-03-22 04:09:43] [INFO ] Flow matrix only has 68 transitions (discarded 40 similar events)
// Phase 1: matrix 68 rows 56 cols
[2023-03-22 04:09:43] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-22 04:09:43] [INFO ] Implicit Places using invariants in 41 ms returned [5, 17, 20, 22, 29, 42]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 42 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/156 places, 108/205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 46 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 46 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 44 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 44 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 43 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 43 transition count 101
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 28 place count 36 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 34 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 34 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 33 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 33 transition count 91
Applied a total of 34 rules in 4 ms. Remains 33 /50 variables (removed 17) and now considering 91/108 (removed 17) transitions.
[2023-03-22 04:09:43] [INFO ] Flow matrix only has 34 transitions (discarded 57 similar events)
// Phase 1: matrix 34 rows 33 cols
[2023-03-22 04:09:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 04:09:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 04:09:44] [INFO ] Flow matrix only has 34 transitions (discarded 57 similar events)
[2023-03-22 04:09:44] [INFO ] Invariant cache hit.
[2023-03-22 04:09:44] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/156 places, 91/205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 33/156 places, 91/205 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S08C3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s18 1), p0:(OR (LT s24 1) (LT s26 1) (AND (GEQ s13 1) (GEQ s22 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 8323 reset in 149 ms.
Product exploration explored 100000 steps with 8301 reset in 159 ms.
Computed a total of 33 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33 transition count 91
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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 151 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S08C3-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S08C3-LTLFireability-15 finished in 721 ms.
All properties solved by simple procedures.
Total runtime 9376 ms.
ITS solved all properties within timeout

BK_STOP 1679458185952

--------------------
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-S08C3"
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-S08C3, 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-167856416100460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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